SearcharxivSearch

arXiv subjects

Rakesh Ghosh

Publications and source records attributed to Rakesh Ghosh.

4 recordsLinked to original sources

Cohen-Macaulayness of squarefree powers of edge ideals of whisker graphs

Let $G$ be a finite simple graph with edge ideal $I(G)$. For $q\ge 1$, the $q$-th squarefree power $I(G)^{[q]}$ is generated by products of $q$ pairwise disjoint edges of $G$. It is the Stanley-Reisner ideal of a simplicial complex $\mathsf{MF}^q(G)$, called the $q$-matching-free complex, whose faces are those subsets $F\subseteq V(G)$ for which the induced subgraph $G[F]$ contains no matching of size $q$. We study $\mathsf{MF}^q(G)$ when $G=W(H)$ is a whisker graph. We first characterize purity. If $H$ is bipartite, then $\mathsf{MF}^q(G)$ is pure for all $q$. Otherwise, let $\ell$ denote the length of the smallest odd cycle of $H$ and set $n=|V(H)|$. Then $\mathsf{MF}^q(G)$ is pure if and only if $q<\lceil \ell/2\rceil$ or $q>n-\lfloor \ell/2\rfloor.$ We next determine the exact range of shellability. Let $m=\operatorname{girth}(H)$, with $m=\infty$ if $H$ is acyclic. Then $\mathsf{MF}^q(G)$ is shellable for \[ 1\le q\le \begin{cases} \lceil m/2\rceil, & \text{if } m<\infty,\\ \nu(G), & \text{if } m=\infty. \end{cases} \] Consequently, $I(G)^{[q]}$ is Cohen-Macaulay for $1\le q\le\lfloor m/2\rfloor$ when $m<\infty$, and for all $1\le q\le\nu(G)$ when $m=\infty$. If $m$ is odd, then $I(G)^{[q]}$ is sequentially Cohen-Macaulay for $q=\lceil m/2\rceil$. We further obtain extremal characterizations: $\mathsf{MF}^{2}(G)$ is Cohen-Macaulay if and only if $H$ has no induced $3$-cycle, and $\mathsf{MF}^{\,n-1}(G)$ is Cohen-Macaulay if and only if $H$ is acyclic. Finally, we compute the depth of $I(G)^{[q]}$ for whisker graphs and verify a conjecture on the depth of squarefree powers of whisker cycles in the relevant range.

math.AC

Shellability in Clique-Free Complexes of Graphs

We study combinatorial and algebraic properties of $t$-clique-free complexes, a family of simplicial complexes associated with finite simple graphs that generalize the classical independence complex. For a graph $G$ and an integer $t \ge 2$, the $t$-clique-free complex $\mathsf{CF}_t(G)$ is the simplicial complex on the vertex set of $G$ whose faces are the subsets inducing no cliques of size $t$. Our main results provide sufficient conditions for shellability and related decomposability properties of $t$-clique-free complexes. In particular, we show that if $G$ is a $t$-diamond-free chordal graph (in particular, a block graph), then $\mathsf{CF}_t(G)$ is $(t-2)$-decomposable and hence shellable. We also investigate how graph modifications via clique attachments influence shellability. Generalizing earlier constructions involving whiskers and clique extensions, we introduce the following operation: given a graph $H$, a subset $S \subseteq V(H)$, and an integer $t \ge 2$, we form a graph $\operatorname{Cl}(H,S,t)$ by attaching to each vertex in $S$ a clique of size at least $t$. We prove that $\mathsf{CF}_t(H\setminus S)$ is shellable if and only if $\mathsf{CF}_t(\operatorname{Cl}(H,S,t))$ is shellable. This yields a flexible method for constructing shellable complexes, particularly when $S$ is a cycle cover. In addition, we extend the notion of clique whiskering and show that for any graph admitting a clique vertex-partition, the resulting $t$-clique whiskering produces a pure and shellable, and hence Cohen-Macaulay, $t$-clique-free complex. Finally, we establish a Fr\"oberg-type result linking chordality and linear resolutions. We show that for any chordal graph $G$, the edge ideal of the complement $t$-clique clutter $\overline{\mathcal{CH}_t(G)}$ admits a $t$-linear resolution over any field.

math.CO

FlashBench: A lightning nowcasting framework based on the hybrid deep learning and physics-based dynamical models

Lightning strikes are a well-known danger, and are a leading cause of accidental fatality worldwide. Unfortunately, lightning hazards seldom make headlines in international media coverage because of their infrequency and the low number of casualties each incidence. According to readings from the TRMM LIS lightning sensor, thunderstorms are more common in the tropics while being extremely rare in the polar regions. To improve the precision of lightning forecasts, we develop a technique similar to LightNet's, with one key modification. We didn't just base our model off the results of preliminary numerical simulations; we also factored in the observed fields' time-dependent development. The effectiveness of the lightning forecast rose dramatically once this adjustment was made. The model was tested in a case study during a thunderstorm. Using lightning parameterization in the WRF model simulation, we compared the simulated fields. As the first of its type, this research has the potential to set the bar for how regional lightning predictions are conducted in the future because of its data-driven approach. In addition, we have built a cloud-based lightning forecast system based on Google Earth Engine. With this setup, lightning forecasts over West India may be made in real time, giving critically important information for the area.

physics.ao-ph

Defining and Estimating Effects in Cluster Randomized Trials: A Methods Comparison

Across research disciplines, cluster randomized trials (CRTs) are commonly implemented to evaluate interventions delivered to groups of participants, such as communities and clinics. Despite advances in the design and analysis of CRTs, several challenges remain. First, there are many possible ways to specify the causal effect of interest (e.g., at the individual-level or at the cluster-level). Second, the theoretical and practical performance of common methods for CRT analysis remain poorly understood. Here, we present a general framework to formally define an array of causal effects in terms of summary measures of counterfactual outcomes. Next, we provide a comprehensive overview of CRT estimators, including the t-test, generalized estimating equations (GEE), augmented-GEE, and targeted maximum likelihood estimation (TMLE). Using finite sample simulations, we illustrate the practical performance of these estimators for different causal effects and when, as commonly occurs, there are limited numbers of clusters of different sizes. Finally, our application to data from the Preterm Birth Initiative (PTBi) study demonstrates the real-world impact of varying cluster sizes and targeting effects at the cluster-level or at the individual-level. Specifically, the relative effect of the PTBI intervention was 0.81 at the cluster-level, corresponding to a 19% reduction in outcome incidence, and was 0.66 at the individual-level, corresponding to a 34% reduction in outcome risk. Given its flexibility to estimate a variety of user-specified effects and ability to adaptively adjust for covariates for precision gains while maintaining Type-I error control, we conclude TMLE is a promising tool for CRT analysis.

stat.ME