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 2015 · math.PRShow all

7 papers · 2 filters

math.PR2015

Entropic CLT and phase transition in high-dimensional Wishart matrices

Sébastien Bubeck, Shirshendu Ganguly

We consider high dimensional Wishart matrices where the entries of are i.i.d. from a log-concave distribut…

math.PR2015

Non-fixation for conservative stochastic dynamics on the line

Riddhipratim Basu, Shirshendu Ganguly, Christopher Hoffman

We consider Activated Random Walk (ARW), a model which generalizes the Stochastic Sandpile, one of the canonical examples of self organized criticality. Informally ARW is a particl…

math.PR2015

Recovery and Rigidity in a Regular Stochastic Block Model

Gerandy Brito, Ioana Dumitriu, Shirshendu Ganguly +2

The stochastic block model is a natural model for studying community detection in random networks. Its clustering properties have been extensively studied in the statistics, physic…

math.PR2015

Heat diffusion with frozen boundary

Laura Florescu, Shirshendu Ganguly, Yuval Peres +1

Consider "Frozen Random Walk" on : particles start at the origin. At any discrete time, the leftmost and rightmost particles are "froz…

math.PR2015

Competitive Erosion is Conformally Invariant

Shirshendu Ganguly, Yuval Peres

We study a graph-theoretic model of interface dynamics called . Each vertex of the graph is occupied by a particle, which can be either red or blue. New red…

math.PR2015

Convergence of discrete Green functions with Neumann boundary conditions

Shirshendu Ganguly, Yuval Peres

In this note we prove convergence of Green functions with Neumann boundary conditions for the random walk to their continuous counterparts. Also a few Beurling type hitting estimat…

math.PR2015

Formation of an interface by competitive erosion

Shirshendu Ganguly, Lionel Levine, Yuval Peres +1

In 2006, the fourth author proposed a graph-theoretic model of interface dynamics called competitive erosion. Each vertex of the graph is occupied by a particle that can be either…