Segui
Shankar Bhamidi
Shankar Bhamidi
Email verificata su email.unc.edu - Home page
Titolo
Citata da
Citata da
Anno
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
1912008
First passage percolation on random graphs with finite mean degrees
S Bhamidi, R van der Hofstad, G Hooghiemstra
962010
Scaling limits for critical inhomogeneous random graphs with finite third moments
S Bhamidi, R van der Hofstad, J van Leeuwaarden
942010
Novel scaling limits for critical inhomogeneous random graphs
S Bhamidi, R van Der Hofstad, JSH Van Leeuwaarden
882012
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
662017
First passage percolation on the Erdős–Rnyi random graph
S Bhamidi, R Van der Hofstad, G Hooghiemstra
Combinatorics, Probability and Computing 20 (5), 683-707, 2011
662011
A testing based extraction algorithm for identifying significant communities in networks
JD Wilson, S Wang, PJ Mucha, S Bhamidi, AB Nobel
592014
Universality for first passage percolation on sparse random graphs
S Bhamidi, R van der Hofstad, G Hooghiemstra
562017
Stochastic weighted graphs: Flexible model specification and simulation
JD Wilson, MJ Denny, S Bhamidi, SJ Cranmer, BA Desmarais
Social Networks 49, 37-47, 2017
512017
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, 387-474, 2018
502018
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
462014
Universal techniques to analyze preferential attachment trees: Global and local analysis
S Bhamidi
preparation. Version August 19, 2007
462007
Continuum limit of critical inhomogeneous random graphs
S Bhamidi, S Sen, X Wang
Probability Theory and Related Fields 169 (1-2), 565-641, 2017
452017
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
432014
Spectra of large random trees
S Bhamidi, SN Evans, A Sen
Journal of Theoretical Probability 25 (3), 613-654, 2012
422012
Weakly interacting particle systems on inhomogeneous random graphs
S Bhamidi, A Budhiraja, R Wu
Stochastic Processes and their Applications 129 (6), 2174-2206, 2019
382019
Twitter event networks and the superstar model
S Bhamidi, JM Steele, T Zaman
372015
Weak disorder asymptotics in the stochastic mean-field model of distance
S Bhamidi, R Van Der Hofstad
322012
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
312010
First passage percolation on locally treelike networks. I. Dense random graphs
S Bhamidi
Journal of Mathematical Physics 49 (12), 125218, 2008
302008
Il sistema al momento non pu eseguire l'operazione. Riprova pi tardi.
Articoli 1–20