Skip to content
GraphTheory.in

Shankar Bhamidi

University of North Carolina at Chapel HillIN
ORCID0009-0000-3953-936X
Claim this profile
h-index
21

via OpenAlex

Citations
1,201

via OpenAlex

Publications
166

About

Shankar Bhamidi is a researcher at the University of North Carolina at Chapel Hill. With a prolific output of over 82 publications spanning nearly five decades, from 1970 to 2025, his work focuses on understanding the geometric and probabilistic structures of complex networks, including critical heavy-tailed network models, random graphs, and evolving networks with delays.

Research areas

  • Mathematics
  • Combinatorics
  • Computer science
  • Statistics
  • Physics

Publications (166)

Sorted by most cited.

  1. Mixing time of exponential random graphs

    Ann. Appl. Probab.1970journal article

    View DOI
    108 cites

  2. Scaling Limits for Critical Inhomogeneous Random Graphs with Finite Third Moments

    Electronic Journal of Probability2010journal article

    View DOI
    81 cites

  3. First Passage Percolation on the Erdős–Rényi Random Graph

    Combinatorics, Probability and Computing2011journal article

    View DOI
    57 cites

  4. Universality for first passage percolation on sparse random graphs

    The Annals of Probability2017journal article

    View DOI
    43 cites

  5. A testing based extraction algorithm for identifying significant communities in networks

    The Annals of Applied Statistics2014journal article

    View DOI
    42 cites

  6. Spectra of Large Random Trees

    Journal of Theoretical Probability2011journal article

    View DOI
    42 cites

  7. Weakly interacting particle systems on inhomogeneous random graphs

    Stochastic Processes and their Applications2019journal article

    View DOI
    40 cites

  8. The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs

    Probab. Theory Related Fields1970journal article

    View DOI
    40 cites

  9. Continuum limit of critical inhomogeneous random graphs

    Probability Theory and Related Fields2016journal article

    View DOI
    39 cites

  10. Community Extraction in Multilayer Networks with Heterogeneous Community Structure.

    2024

    View DOI
    33 cites

  11. Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks

    Advances in Applied Probability2016journal article

    View DOI
    29 cites

  12. The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs

    Probability Theory and Related Fields2013journal article

    View DOI
    29 cites

  13. First passage percolation on locally treelike networks. I. Dense random graphs

    Journal of Mathematical Physics1970journal article

    View DOI
    28 cites

  14. Community extraction in multilayer networks with heterogeneous community structure

    2016

    View DOI
    27 cites

  15. Demarcating geographic regions using community detection in commuting networks with significant self-loops

    PLOS ONE2020journal article

    View DOI
    25 cites

  16. Functional data analysis of tree data objects

    J. Comput. Graph. Statist.1970journal article

    View DOI
    25 cites

  17. Universality for critical heavy-tailed network models: metric structure of maximal components

    Electron. J. Probab.1970journal article

    View DOI
    24 cites

  18. Statistical Modeling of the Default Mode Brain Network Reveals a Segregated Highway Structure

    2017

    View DOI
    23 cites

  19. Survival and extinction of epidemics on random graphs with general degree

    The Annals of Probability2021journal article

    View DOI
    22 cites

  20. Aggregation models with limited choice and the multiplicative coalescent

    Random Structures & Algorithms2013journal article

    View DOI
    16 cites

  21. Energy landscape for large average submatrix detection problems in Gaussian random matrices

    Probability Theory and Related Fields2017journal article

    View DOI
    15 cites

  22. Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees

    Random Structures Algorithms1970journal article

    View DOI
    15 cites

  23. Root finding algorithms and persistence of Jordan centrality in growing random trees

    The Annals of Applied Probability2022journal article

    View DOI
    14 cites

  24. Childhood peer network characteristics: genetic influences and links with early mental health trajectories

    2015

    View DOI
    14 cites

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

    Probability and statistics: essays in honor of David A. Freedman1970book chapter

    View DOI
    13 cites

  26. Edge flows in the complete random-lengths network

    Random Structures & Algorithms2010journal article

    View DOI
    12 cites

  27. Stochastic Weighted Graphs: Flexible Model Specification and Simulation

    SSRN Electronic Journal2016journal article

    View DOI
    10 cites

  28. Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees

    2016

    View DOI
    9 cites

  29. Bounded-Size Rules: The Barely Subcritical Regime

    Combinatorics, Probability and Computing2014journal article

    View DOI
    9 cites

  30. The augmented multiplicative coalescent and critical dynamic random graph models

    2012

    View DOI
    9 cites

  31. The front of the epidemic spread and first passage percolation

    Journal of Applied Probability2016journal article

    View DOI
    8 cites

  32. The Continuous Configuration Model: A Null for Community Detection on Weighted Networks.

    2016

    7 cites

  33. Fluctuation bounds for continuous time branching processes and evolution of growing trees with a change point

    The Annals of Applied Probability2023journal article

    View DOI
    6 cites

  34. Global lower mass-bound for critical configuration models in the heavy-tailed regime

    Electronic Journal of Probability2022journal article

    View DOI
    6 cites

  35. Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks

    Advances in Applied Probability2016journal article

    View DOI
    6 cites

  36. The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs

    2015

    View DOI
    6 cites

  37. The importance sampling technique for understanding rare events in Erdős–Rényi random graphs

    Electronic Journal of Probability2015journal article

    View DOI
    6 cites

  38. Novel scaling limits for critical inhomogeneous random graphs

    2009

    View DOI
    6 cites

  39. Spectra of large random trees

    2009

    View DOI
    6 cites

  40. Near equilibrium fluctuations for supermarket models with growing choices

    The Annals of Applied Probability2022journal article

    View DOI
    5 cites

  41. Global lower mass-bound for critical configuration models in the heavy-tailed regime

    2020

    View DOI
    5 cites

  42. A probabilistic approach to the leader problem in random graphs

    2017

    View DOI
    5 cites

  43. Weakly interacting particle systems on inhomogeneous random graphs

    2016

    View DOI
    5 cites

  44. Large subgraphs in pseudo-random graphs

    2016

    View DOI
    5 cites

  45. A probabilistic approach to the leader problem in random graphs

    Random Structures & Algorithms2020journal article

    View DOI
    4 cites

  46. Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes

    2020

    View DOI
    4 cites

  47. Demarcating Geographic Regions using Community Detection in Commuting Networks.

    2019

    4 cites

  48. Sampling-based Estimation of In-degree Distribution with Applications to Directed Complex Networks

    2018

    View DOI
    4 cites

  49. Fluctuation bounds for continuous time branching processes and nonparametric change point detection in growing networks

    2018

    4 cites

  50. Diameter of the Stochastic Mean-Field Model of Distance

    Combinatorics, Probability and Computing2017journal article

    View DOI
    4 cites

  51. Significance-based community detection in weighted networks

    2016

    View DOI
    4 cites

  52. Universality for first passage percolation on sparse random graphs

    2012

    View DOI
    4 cites

  53. Learning Attribute Distributions Through Random Walks

    2023

    View DOI
    3 cites

  54. Rare event asymptotics for exploration processes for random graphs

    The Annals of Applied Probability2022journal article

    View DOI
    3 cites

  55. The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs

    2020

    View DOI
    3 cites

  56. Intertemporal Community Detection in Human Mobility Networks

    2019

    View DOI
    3 cites

  57. Change point detection in network models: Preferential attachment and long range dependence

    The Annals of Applied Probability2018journal article

    View DOI
    3 cites

  58. Degree distribution of shortest path trees and bias of network sampling algorithms

    The Annals of Applied Probability2015journal article

    View DOI
    3 cites

  59. Bohman-Frieze processes at criticality and emergence of the giant component

    2011

    View DOI
    3 cites

  60. Co-evolving dynamic networks

    2024

    View DOI
    2 cites

  61. The spatial distribution of coupling between tau and neurodegeneration in amyloid-β positive mild cognitive impairment

    2024

    View DOI
    2 cites

  62. Community modulated recursive trees and population dependent branching processes

    Random Structures & Algorithms2021journal article

    View DOI
    2 cites

  63. Persistence of hubs in growing random networks

    Probability Theory and Related Fields2021journal article

    View DOI
    2 cites

  64. Survival and extinction of epidemics on random graphs with general\n degrees

    2019

    View DOI
    2 cites

  65. Continuum limit of critical inhomogeneous random graphs

    2014

    View DOI
    2 cites

  66. UNIVERSALITY FOR FIRST PASSAGE PERCOLATION ON SPARSE UNIFORM AND RANK-1 RANDOM GRAPHS

    2014

    View DOI
    2 cites

  67. Variants of Brownian Motion

    Wiley Encyclopedia of Operations Research and Management Science2011other

    View DOI
    2 cites

  68. Network delay inference from additive metrics

    Random Structures & Algorithms2010journal article

    View DOI
    2 cites

  69. Scaling Limits for Critical Inhomogeneous Random Graphs with Finite Third Moments

    2009

    View DOI
    2 cites

  70. Mixing time of exponential random graphs

    2008 49th Annual IEEE Symposium on Foundations of Computer Science2008other

    View DOI
    2 cites

  71. Network Evolution With Mesoscopic Delays

    Random Structures & Algorithms2025journal article

    View DOI
    1 cites

  72. Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms

    2025

    View DOI
    1 cites

  73. Multiscale genesis of a tiny giant for percolation on scale-free random graphs

    2025

    View DOI
    1 cites

  74. Functional Central limit theorems for microscopic and macroscopic functionals of inhomogeneous random graphs

    2024

    View DOI
    1 cites

  75. Community modulated recursive trees and population dependent branching processes

    2024

    View DOI
    1 cites

  76. Minority Representation and Relative Ranking in Sampling Attributed Networks

    2024

    View DOI
    1 cites

  77. Learning attribute and homophily measures through random walks

    Applied Network Science2023journal article

    View DOI
    1 cites

  78. Attribute network models, stochastic approximation, and network sampling and ranking algorithms

    2023

    View DOI
    1 cites

  79. Functional Data Analysis of Tree Data Objects

    2020

    View DOI
    1 cites

  80. Root finding algorithms and persistence of Jordan centrality in growing random trees

    2020

    View DOI
    1 cites

  81. Near Equilibrium Fluctuations for Supermarket Models with Growing Choices

    2020

    View DOI
    1 cites

  82. Rare event asymptotics for exploration processes for random graphs

    2019

    View DOI
    1 cites

  83. Intertemporal Community Detection in Bikeshare Networks

    2019

    1 cites

  84. Erratum: First passage percolation on random graphs with finite mean degrees [Ann. Appl. Probab. 20(5) (2010) 1907–1965]

    The Annals of Applied Probability2017journal article

    View DOI
    1 cites

  85. Exceptional rotations of random graphs: a VC theory

    2015

    View DOI
    1 cites

  86. The importance sampling technique for understanding rare events in Erd\H{o}s-R\'enyi random graphs

    2013

    1 cites

  87. First passage percolation on the Erdős-Rényi random graph

    2010

    View DOI
    1 cites

  88. Spectra of Random trees

    2008

    1 cites

  89. Edge Flows in the Complete Random-Lengths Network

    2007

    View DOI
    1 cites

  90. The spatial distribution of coupling between tau and neurodegeneration in amyloid-β positive mild cognitive impairment

    2026

    View DOI
    0 cites

  91. Consistency of Lloyd’s algorithm under perturbations

    2026

    View DOI
    0 cites

  92. Evolution of recursive trees with limited memory

    2025

    View DOI
    0 cites

  93. Large Deviations for Markovian Graphon Processes and Associated Dynamical Systems on Networks

    2025

    View DOI
    0 cites

  94. Critical first passage percolation on random graphs

    2024

    View DOI
    0 cites

  95. Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes

    2024

    View DOI
    0 cites

  96. Network evolution with mesoscopic delay

    2024

    View DOI
    0 cites

  97. Network evolution with Macroscopic Delays: asymptotics and condensation

    2024

    View DOI
    0 cites

  98. Scaling limits and universality: Critical percolation on weighted graphs converging to an 𝐿³ graphon

    2024

    View DOI
    0 cites

  99. Representation, ranking and bias of minorities in sampling attributed networks

    2024

    View DOI
    0 cites

  100. Local weak convergence and its applications

    2024

    View DOI
    0 cites

  101. Consistency of Lloyd's Algorithm Under Perturbations

    2023

    View DOI
    0 cites

  102. Dynamic factor and VARMA models: equivalent representations, dimension reduction and nonlinear matrix equations

    2023

    View DOI
    0 cites

  103. Correlation networks, dynamic factor models and community detection

    2023

    View DOI
    0 cites

  104. Improved baselines for causal structure learning on interventional data

    Statistics and Computing2023journal article

    View DOI
    0 cites

  105. The spatial distribution of coupling between tau and neurodegeneration in amyloid-β positive mild cognitive impairment

    2023

    View DOI
    0 cites

  106. Scaling limits and universality: Critical percolation on weighted graphs converging to an $L^3$ graphon

    2023

    View DOI
    0 cites

  107. A Conversation with David J. Aldous

    Statistical Science2022journal article

    View DOI
    0 cites

  108. Co-evolving dynamic networks

    2022

    View DOI
    0 cites

  109. Community detection using low-dimensional network embedding algorithms

    2021

    View DOI
    0 cites

  110. Network delay inference from additive metrics

    2021

    View DOI
    0 cites

  111. Multiscale genesis of a tiny giant for percolation on scale-free random graphs

    2021

    View DOI
    0 cites

  112. Weak disorder in the stochastic mean-field model of distance II

    2021

    View DOI
    0 cites

  113. Novel scaling limits for critical inhomogeneous random graphs

    2021

    View DOI
    0 cites

  114. Twitter event networks and the Superstar model

    2021

    View DOI
    0 cites

  115. Degree distribution of shortest path trees and bias of network sampling algorithms

    2021

    View DOI
    0 cites

  116. Weak disorder asymptotics in the stochastic mean-field model of distance

    2021

    View DOI
    0 cites

  117. A testing based extraction algorithm for identifying significant communities in networks

    2021

    View DOI
    0 cites

  118. Stochastic weighted graphs: Flexible model specification and simulation

    2020

    View DOI
    0 cites

  119. Statistical Modeling of the Default Mode Brain Network Reveals a Segregated Highway Structure

    2020

    View DOI
    0 cites

  120. Community modulated recursive trees and population dependent branching processes

    2020

    View DOI
    0 cites

  121. Fluctuation Bounds for Continuous Time Branching Processes and Evolution of Growing Trees With a Change Point

    2018

    View DOI
    0 cites

  122. Weighted Exponential Random Graph Models: Scope and Large Network Limits

    Journal of Statistical Physics2018journal article

    View DOI
    0 cites

  123. Critical random graphs and the differential equations technique

    Indian Journal of Pure and Applied Mathematics2018journal article

    View DOI
    0 cites

  124. Large Deviation Principle for the Exploration Process of the Configuration Model

    2017

    View DOI
    0 cites

  125. Stochastic weighted graphs: Flexible model specification and simulation

    Social Networks2017journal article

    View DOI
    0 cites

  126. The front of the epidemic spread and first passage percolation

    Journal of Applied Probability2016journal article

    View DOI
    0 cites

  127. Twitter event networks and the Superstar model

    The Annals of Applied Probability2015journal article

    View DOI
    0 cites

  128. Change point detection in Network models: Preferential attachment and\n long range dependence

    2015

    View DOI
    0 cites

  129. Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erdős-Rényi random graph

    2014

    View DOI
    0 cites

  130. Degree distribution of shortest path trees and bias of network sampling algorithms

    2013

    View DOI
    0 cites

  131. Weak disorder in the stochastic mean-field model of distance II

    Bernoulli2013journal article

    View DOI
    0 cites

  132. The importance sampling technique for understanding rare events in Erdős-Rényi random graphs

    2013

    View DOI
    0 cites

  133. Energy Landscape for large average submatrix detection problems in\n Gaussian random matrices

    2012

    View DOI
    0 cites

  134. Novel scaling limits for critical inhomogeneous random graphs

    The Annals of Probability2012journal article

    View DOI
    0 cites

  135. Weak disorder asymptotics in the stochastic mean-field model of distance

    The Annals of Applied Probability2012journal article

    View DOI
    0 cites

  136. First passage percolation on random graphs with finite mean degrees

    The Annals of Applied Probability2010journal article

    View DOI
    0 cites

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

    2009

    View DOI
    0 cites

  138. Brownian motion on time scales, basic hypergeometric functions, and some continued fractions of Ramanujan

    2005

    0 cites

  139. Mixing time of exponential random graphs

    The Annals of Applied Probability1970journal article

    View DOI
    0 cites

  140. Co-evolving dynamic networks

    Probability Theory and Related Fields1970journal article

    0 cites

  141. Critical first passage percolation on random graphs

    arXiv preprint arXiv:2412.034151970journal article

    0 cites

  142. Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes

    Probability Theory and Related Fields1970journal article

    0 cites

  143. Local weak convergence and its applications

    arXiv preprint arXiv:2403.015441970journal article

    0 cites

  144. Network evolution with Macroscopic Delays: asymptotics and condensation

    arXiv preprint arXiv:2409.060481970journal article

    0 cites

  145. Representation, ranking and bias of minorities in sampling attributed networks

    Social Network Analysis and Mining1970journal article

    0 cites

  146. The spatial distribution of coupling between tau and neurodegeneration in amyloid-$β$ positive mild cognitive impairment

    Neurobiology of Aging1970journal article

    0 cites

  147. Consistency of Lloyd's Algorithm Under Perturbations

    arXiv preprint arXiv:2309.005781970journal article

    0 cites

  148. Correlation networks, dynamic factor models and community detection

    arXiv preprint arXiv:2307.099701970journal article

    0 cites

  149. Dynamic factor and VARMA models: equivalent representations, dimension reduction and nonlinear matrix equations

    arXiv preprint arXiv:2307.099741970journal article

    0 cites

  150. Minority Representation and Relative Ranking in Sampling Attributed Networks

    International Conference on Complex Networks and Their Applications1970conference paper

    0 cites

  151. Scaling limits and universality: Critical percolation on weighted graphs converging to an $ L^ 3$ graphon

    arXiv preprint arXiv:2303.100821970journal article

    0 cites

  152. Statistical significance of clustering with multidimensional scaling

    Journal of Computational and Graphical Statistics1970journal article

    View DOI
    0 cites

  153. The spatial distribution of coupling between tau and neurodegeneration in amyloid-$β$ positive mild cognitive impairment

    medRxiv1970journal article

    0 cites

  154. Co-evolving dynamic networks

    arXiv preprint arXiv:2203.118771970journal article

    0 cites

  155. Learning attribute distributions through random walks

    International Conference on Complex Networks and Their Applications1970conference paper

    0 cites

  156. Community detection using low-dimensional network embedding algorithms

    arXiv preprint arXiv:2111.052671970journal article

    0 cites

  157. Multiscale genesis of a tiny giant for percolation on scale-free random graphs

    arXiv preprint arXiv:2107.041031970journal article

    0 cites

  158. Sampling based estimation of in-degree distribution for directed complex networks

    Journal of Computational and Graphical Statistics1970journal article

    View DOI
    0 cites

  159. Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes

    arXiv preprint arXiv:2009.106961970journal article

    0 cites

  160. Network Models: Structure and Function

    Oberwolfach Reports1970journal article

    View DOI
    0 cites

  161. Community extraction in multilayer networks with heterogeneous community structure

    J. Mach. Learn. Res.1970journal article

    0 cites

  162. Significance-based community detection in weighted networks

    J. Mach. Learn. Res.1970journal article

    0 cites

  163. Statistical modeling of the default mode brain network reveals a segregated highway structure

    Scientific reports1970journal article

    0 cites

  164. Childhood peer network characteristics: genetic influences and links with early mental health trajectories

    Journal of Child Psychology and Psychiatry1970journal article

    0 cites

  165. Exceptional rotations of random graphs: a VC theory

    J. Mach. Learn. Res.1970journal article

    0 cites

  166. Random networks: Flows and asymptotics

    1970book

    0 cites