Year |
Citation |
Score |
2020 |
He M, Glasser J, Pritchard N, Bhamidi S, Kaza N. Demarcating geographic regions using community detection in commuting networks with significant self-loops. Plos One. 15: e0230941. PMID 32348311 DOI: 10.1371/Journal.Pone.0230941 |
0.363 |
|
2020 |
Bhamidi S, Dhara SS, Hofstad RRvd, Sen SS. Universality for critical heavy-tailed network models: Metric structure of maximal components Electronic Journal of Probability. 25: 1. DOI: 10.1214/19-Ejp408 |
0.452 |
|
2020 |
Bhamidi S, Sen S. Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees Random Structures and Algorithms. 56: 676-721. DOI: 10.1002/Rsa.20880 |
0.491 |
|
2019 |
Bhamidi S, Budhiraja A, Wu R. Weakly interacting particle systems on inhomogeneous random graphs Stochastic Processes and Their Applications. 129: 2174-2206. DOI: 10.1016/J.Spa.2018.06.014 |
0.432 |
|
2018 |
Addario-Berry L, Bhamidi S, Hofstad Rvd, Hollander Fd. Network Models: Structure and Function Oberwolfach Reports. 14: 3427-3470. DOI: 10.4171/Owr/2017/57 |
0.372 |
|
2018 |
Bhamidi S, Jin J, Nobel A. Change point detection in network models: Preferential attachment and long range dependence The Annals of Applied Probability. 28: 35-78. DOI: 10.1214/17-Aap1297 |
0.364 |
|
2018 |
Bhamidi S, Chakraborty S, Cranmer S, Desmarais B. Weighted Exponential Random Graph Models: Scope and Large Network Limits Journal of Statistical Physics. 173: 704-735. DOI: 10.1007/S10955-018-2103-0 |
0.538 |
|
2018 |
Bhamidi S, Hofstad RRvd, Sen SS. The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs Probability Theory and Related Fields. 170: 387-474. DOI: 10.1007/S00440-017-0760-6 |
0.489 |
|
2017 |
Stillman PE, Wilson JD, Denny MJ, Desmarais BA, Bhamidi S, Cranmer SJ, Lu ZL. Statistical Modeling of the Default Mode Brain Network Reveals a Segregated Highway Structure. Scientific Reports. 7: 11694. PMID 28916779 DOI: 10.1038/S41598-017-09896-6 |
0.412 |
|
2017 |
Bhamidi S, Hofstad Rvd, Hooghiemstra G. Erratum: First passage percolation on random graphs with finite mean degrees [Ann. Appl. Probab. 20(5) (2010) 1907–1965] Annals of Applied Probability. 27: 3246-3253. DOI: 10.1214/17-Aap1291 |
0.491 |
|
2017 |
Bhamidi S, Hofstad RRvd, Hooghiemstra GG. Universality for first passage percolation on sparse random graphs Annals of Probability. 45: 2568-2630. DOI: 10.1214/16-Aop1120 |
0.542 |
|
2017 |
Bhamidi S, Hofstad RRvd. Diameter of the Stochastic Mean-Field Model of Distance Combinatorics, Probability & Computing. 26: 797-825. DOI: 10.1017/S0963548317000232 |
0.499 |
|
2017 |
Wilson JD, Denny MJ, Bhamidi S, Cranmer SJ, Desmarais BA. Stochastic weighted graphs: Flexible model specification and simulation Social Networks. 49: 37-47. DOI: 10.1016/J.Socnet.2016.11.002 |
0.531 |
|
2017 |
Bhamidi S, Budhiraja A, Sen S. Critical random graphs and the differential equations technique Indian Journal of Pure & Applied Mathematics. 48: 633-669. DOI: 10.1007/S13226-017-0249-0 |
0.521 |
|
2016 |
Bhamidi S, Sen S, Wang X. Continuum limit of critical inhomogeneous random graphs Probability Theory and Related Fields. 1-77. DOI: 10.1007/S00440-016-0737-X |
0.495 |
|
2015 |
Szekely E, Pappa I, Wilson JD, Bhamidi S, Jaddoe VW, Verhulst FC, Tiemeier H, Shaw P. Childhood peer network characteristics: genetic influences and links with early mental health trajectories. Journal of Child Psychology and Psychiatry, and Allied Disciplines. PMID 26689862 DOI: 10.1111/Jcpp.12493 |
0.312 |
|
2015 |
Bhamidi S, Hannig J, Lee CY, Nolen J. The importance sampling technique for understanding rare events in Erdős-Rényi random graphs Electronic Journal of Probability. 20. DOI: 10.1214/Ejp.V20-2696 |
0.476 |
|
2015 |
Bhamidi S, Steele JM, Zaman T. Twitter event networks and the superstar model Annals of Applied Probability. 25: 2462-2502. DOI: 10.1214/14-Aap1053 |
0.508 |
|
2015 |
Bhamidi S, Goodman J, Van Der Hofstad R, Komjáthy J. Degree distribution of shortest path trees and bias of network sampling algorithms Annals of Applied Probability. 25: 1780-1826. DOI: 10.1214/14-Aap1036 |
0.565 |
|
2015 |
Bhamidi S, Budhiraja A, Wang X. Aggregation models with limited choice and the multiplicative coalescent Random Structures and Algorithms. 46: 55-116. DOI: 10.1002/Rsa.20493 |
0.495 |
|
2015 |
Addario-Berry L, Bhamidi S, Bubeck S, Devroye L, Lugosi G, Oliveira RI. Exceptional rotations of random graphs: A VC theory Journal of Machine Learning Research. 16: 1893-1922. |
0.318 |
|
2014 |
Shen D, Shen H, Bhamidi S, Maldonado YM, Kim Y, Marron JS. Functional Data Analysis of Tree Data Objects. Journal of Computational and Graphical Statistics : a Joint Publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America. 23: 418-438. PMID 25346588 DOI: 10.1080/10618600.2013.786943 |
0.304 |
|
2014 |
Bhamidi S, Van Der Hofstad R, Komjáthy J. The front of the epidemic spread and first passage percolation Journal of Applied Probability. 51: 101-121. DOI: 10.1239/Jap/1417528470 |
0.543 |
|
2014 |
Wilson JD, Wang S, Mucha PJ, Bhamidi S, Nobel AB. A testing based extraction algorithm for identifying significant communities in networks Annals of Applied Statistics. 8: 1853-1891. DOI: 10.1214/14-Aoas760 |
0.368 |
|
2014 |
Bhamidi S, Budhiraja A, Wang X. Bounded-size rules: The barely subcritical regime Combinatorics Probability and Computing. 23: 505-538. DOI: 10.1017/S0963548314000261 |
0.474 |
|
2014 |
Bhamidi S, Budhiraja A, Wang X. The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs Probability Theory and Related Fields. 160: 733-796. DOI: 10.1007/s00440-013-0540-x |
0.398 |
|
2013 |
Bhamidi S, Van Der Hofstad R, Hooghiemstra G. Weak disorder in the stochastic mean-field model of distance II Bernoulli. 19: 363-386. DOI: 10.3150/11-Bej402 |
0.407 |
|
2012 |
Bhamidi S, van Der Hofstad R, van Leeuwaarden JSH. Novel scaling limits for critical inhomogeneous random graphs Annals of Probability. 40: 2299-2361. DOI: 10.1214/11-Aop680 |
0.488 |
|
2012 |
Bhamidi S, Van Der Hofstad R. Weak disorder asymptotics in the stochastic mean-field model of distance Annals of Applied Probability. 22: 29-69. DOI: 10.1214/10-Aap753 |
0.488 |
|
2012 |
Bhamidi S, Evans SN, Sen A. Spectra of Large Random Trees Journal of Theoretical Probability. 25: 613-654. DOI: 10.1007/S10959-011-0360-9 |
0.475 |
|
2011 |
Bhamidi S, Van Der Hofstad R, Hooghiemstra G. First passage percolation on the Erdo″s-Réyi random graph Combinatorics Probability and Computing. 20: 683-707. DOI: 10.1017/S096354831100023X |
0.484 |
|
2010 |
Bhamidi S, Hofstad RVD, Hooghiemstra G. Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks Advances in Applied Probability. 42: 706-738. DOI: 10.1239/Aap/1282924060 |
0.544 |
|
2010 |
Bhamidi S, van der Hofstad R, van Leeuwaarden JSH. Scaling limits for critical inhomogeneous random graphs with finite third moments Electronic Journal of Probability. 15: 1682-1702. DOI: 10.1214/Ejp.V15-817 |
0.501 |
|
2010 |
Bhamidi S, Van Der Hofstad R, Hooghiemstra G. First passage percolation on random graphs with finite mean degrees Annals of Applied Probability. 20: 1907-1965. DOI: 10.1214/09-Aap666 |
0.575 |
|
2010 |
Aldous DJ, Bhamidi S. Edge flows in the complete random-lengths network Random Structures and Algorithms. 37: 271-311. DOI: 10.1002/Rsa.V37:3 |
0.47 |
|
2010 |
Bhamidi S, Rajagopal R, Roch S. Network delay inference from additive metrics Random Structures and Algorithms. 37: 176-203. DOI: 10.1002/Rsa.V37:2 |
0.475 |
|
2010 |
Aldous DJ, Bhamidi S. Edge flows in the complete random-lengths network: Complete Random-Lengths Network Random Structures and Algorithms. 37: 271-311. DOI: 10.1002/Rsa.20306 |
0.452 |
|
2010 |
Bhamidi S, Rajagopal R, Roch S. Network delay inference from additive metrics Random Structures and Algorithms. 37: 176-203. DOI: 10.1002/Rsa.20305 |
0.383 |
|
2008 |
Bhamidi S, Bresler G, Sly A. Mixing time of exponential random graphs Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 803-812. DOI: 10.1214/10-Aap740 |
0.496 |
|
2008 |
Bhamidi S. First passage percolation on locally treelike networks. I. Dense random graphs Journal of Mathematical Physics. 49. DOI: 10.1063/1.3039876 |
0.569 |
|
Show low-probability matches. |