S. Ganguly

activity

20112026

most citedUpper tails and independence polynomials in random graphs

55 citations · 138 across the 62 of their papers we have counts for

collaborators

Showing 2018 · math.PRShow all

4 papers · 2 filters

math.PR2018★ 1 cited

Information Percolation and Cutoff for the Random-Cluster Model

Shirshendu Ganguly, Insuk Seo

We consider the Random-Cluster model on $(Z / n Z)^{d}$ with parameters $p \in (0, 1)$ and $q \geq 1$ . This is a generalization of the standard bond percolation (with ope…

math.PR2018

Upper Tails for Edge Eigenvalues of Random Graphs

Bhaswar B. Bhattacharya, Shirshendu Ganguly

The upper tail problem for the largest eigenvalue of the Erdős--Rényi random graph $G_{n, p}$ is to estimate the probability that the largest eigenvalue of the adjacency m…

math.PR2018★ 7 cited

Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion

Hugo Duminil-Copin, Shirshendu Ganguly, Alan Hammond +1

Let $c_{n} = c_{n} (d)$ denote the number of self-avoiding walks of length $n$ starting at the origin in the Euclidean nearest-neighbour lattice $Z^{d}$ . Let $μ= \lim_n c_n^{1/n}…

math.PR2018

Time Correlation Exponents in Last Passage Percolation

Riddhipratim Basu, Shirshendu Ganguly

For directed last passage percolation on $Z^{2}$ with exponential passage times on the vertices, let $T_{n}$ denote the last passage time from $(0, 0)$ to $(n, n)$ . We conside…