55 citations · 138 across the 62 of their papers we have counts for
4 papers · 1 filter
High-girth near-Ramanujan graphs with localized eigenvectors
Noga Alon, Shirshendu Ganguly, Nikhil Srivastava
We show that for every prime and , there is an infinite sequence of -regular graphs with girth at least , second adjac…
On Non-localization of Eigenvectors of High Girth Graphs
Shirshendu Ganguly, Nikhil Srivastava
We prove improved bounds on how localized an eigenvector of a high girth regular graph can be, and present examples showing that these bounds are close to sharp. This study was ini…
Upper tails and independence polynomials in random graphs
Bhaswar B. Bhattacharya, Shirshendu Ganguly, Eyal Lubetzky +1
The upper tail problem in the Erdős--Rényi random graph asks to estimate the probability that the number of copies of a graph in exceeds its expect…
Minimum-Weight Edge Discriminator in Hypergraphs
Bhaswar B. Bhattacharya, Sayantan Das, Shirshendu Ganguly
In this paper we introduce the concept of minimum-weight edge-discriminators in hypergraphs, and study its various properties. For a hypergraph $\mathcal H=(\mathcal V, \mathcal E)…