activity
20052009
most citedMixing time of exponential random graphs

2 citations · 3 across the 3 of their papers we have counts for

collaborators

5 papers

math.PR2009

Scaling limits for critical inhomogeneous random graphs with finite third moments

Shankar Bhamidi, Remco van der Hofstad, Johan van Leeuwaarden

We identify the scaling limits for the sizes of the largest components at criticality for inhomogeneous random graphs when the degree exponent satisfies . We see that the…

math.PR2009

Extreme value theory, Poisson-Dirichlet distributions and FPP on random networks

Shankar Bhamidi, Remco van der Hofstad, Gerard Hooghiemstra

We study first passage percolation on the configuration model (CM) having power-law degrees with exponent . To this end we equip the edges with exponential weights. We…

math.PR20082 cited

Mixing time of exponential random graphs

Shankar Bhamidi, Guy Bresler, Allan Sly

Exponential random graphs are used extensively in the sociology literature. This model seeks to incorporate in random graphs the notion of reciprocity, that is, the larger than exp…

math.PR20071 cited

Edge Flows in the Complete Random-Lengths Network

David J. Aldous, Shankar Bhamidi

Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow be…

math.PR2005

Brownian motion on disconnected sets, basic hypergeometric functions, and some continued fractions of Ramanujan

Shankar Bhamidi, Steven N. Evans, Ron Peled +1

Motivated by Lévy's characterization of Brownian motion on the line, we propose an analogue of Brownian motion that has as its state space an arbitrary closed subset of the line th…