Shankar Bhamidi
Shankar Bhamidi
Verified email at email.unc.edu
Title
Cited by
Cited by
Year
Mixing time of exponential random graphs
S Bhamidi, G Bresler, A Sly
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 803-812, 2008
1472008
First passage percolation on random graphs with finite mean degrees
S Bhamidi, R van der Hofstad, G Hooghiemstra
The Annals of Applied Probability 20 (5), 1907-1965, 2010
892010
Scaling limits for critical inhomogeneous random graphs with finite third moments
S Bhamidi, R Van Der Hofstad, J van Leeuwaarden
Electronic Journal of Probability 15, 1682-1702, 2010
742010
Novel scaling limits for critical inhomogeneous random graphs
S Bhamidi, R van der Hofstad, JSH Van Leeuwaarden
The Annals of Probability 40 (6), 2299-2361, 2012
672012
First passage percolation on the Erdős–Rényi random graph
S Bhamidi, R Van der Hofstad, G Hooghiemstra
Combinatorics, Probability and Computing 20 (5), 683-707, 2011
612011
Universality for first passage percolation on sparse random graphs
S Bhamidi, R van der Hofstad, G Hooghiemstra
The Annals of Probability 45 (4), 2568-2630, 2017
482017
Estimating network degree distributions under sampling: An inverse problem, with applications to monitoring social media networks
Y Zhang, ED Kolaczyk, BD Spencer
The Annals of Applied Statistics 9 (1), 166-199, 2015
432015
A testing based extraction algorithm for identifying significant communities in networks
JD Wilson, S Wang, PJ Mucha, S Bhamidi, AB Nobel
The Annals of Applied Statistics 8 (3), 1853-1891, 2014
392014
Stochastic weighted graphs: Flexible model specification and simulation
JD Wilson, MJ Denny, S Bhamidi, SJ Cranmer, BA Desmarais
Social Networks 49, 37-47, 2017
372017
Spectra of large random trees
S Bhamidi, SN Evans, A Sen
Journal of Theoretical Probability 25 (3), 613-654, 2012
342012
Community extraction in multilayer networks with heterogeneous community structure
JD Wilson, J Palowitch, S Bhamidi, AB Nobel
The Journal of Machine Learning Research 18 (1), 5458-5506, 2017
332017
Universal techniques to analyze preferential attachment trees: Global and local analysis
S Bhamidi
Preprint available at http://www. unc. edu/∼ bhamidi, 2007
322007
The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs
S Bhamidi, A Budhiraja, X Wang
Probability Theory and Related Fields 160 (3-4), 733-796, 2014
312014
First passage percolation on locally treelike networks. I. Dense random graphs
S Bhamidi
Journal of Mathematical Physics 49 (12), 125218, 2008
302008
Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erd\H {o} sR\'enyi random graph
S Bhamidi, N Broutin, S Sen, X Wang
arXiv preprint arXiv:1411.3417, 2014
292014
Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks
S Bhamidi, R Van Der Hofstad, G Hooghiemstra
Advances in applied probability 42 (3), 706-738, 2010
282010
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
S Bhamidi, R van der Hofstad, S Sen
Probability Theory and Related Fields 170 (1-2), 387-474, 2018
272018
Twitter event networks and the superstar model
S Bhamidi, JM Steele, T Zaman
The Annals of Applied Probability 25 (5), 2462-2502, 2015
272015
Continuum limit of critical inhomogeneous random graphs
S Bhamidi, S Sen, X Wang
arXiv preprint arXiv:1404.4118, 2014
272014
Functional data analysis of tree data objects
D Shen, H Shen, S Bhamidi, Y Muńoz Maldonado, Y Kim, JS Marron
Journal of Computational and Graphical Statistics 23 (2), 418-438, 2014
232014
The system can't perform the operation now. Try again later.
Articles 1–20