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,200

via OpenAlex

Publications
82

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 (82)

Sorted by most cited.

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

    Electron. J. Probab.1970journal article

    View DOI
    24 cites

  2. 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

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

    Random Structures & Algorithms2020journal article

    View DOI
    4 cites

  4. Network Evolution With Mesoscopic Delays

    Random Structures & Algorithms2025journal article

    View DOI
    0 cites

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

    The Annals of Applied Probability2023journal article

    View DOI
    0 cites

  6. Improved baselines for causal structure learning on interventional data

    Statistics and Computing2023journal article

    View DOI
    0 cites

  7. Learning attribute and homophily measures through random walks

    Applied Network Science2023journal article

    View DOI
    0 cites

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

    2023

    View DOI
    0 cites

  9. A Conversation with David J. Aldous

    Statistical Science2022journal article

    View DOI
    0 cites

  10. Near equilibrium fluctuations for supermarket models with growing choices

    The Annals of Applied Probability2022journal article

    View DOI
    0 cites

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

    The Annals of Applied Probability2022journal article

    View DOI
    0 cites

  12. Rare event asymptotics for exploration processes for random graphs

    The Annals of Applied Probability2022journal article

    View DOI
    0 cites

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

    Electronic Journal of Probability2022journal article

    View DOI
    0 cites

  14. Community modulated recursive trees and population dependent branching processes

    Random Structures & Algorithms2021journal article

    View DOI
    0 cites

  15. Persistence of hubs in growing random networks

    Probability Theory and Related Fields2021journal article

    View DOI
    0 cites

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

    The Annals of Probability2021journal article

    View DOI
    0 cites

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

    PLOS ONE2020journal article

    View DOI
    0 cites

  18. Weakly interacting particle systems on inhomogeneous random graphs

    Stochastic Processes and their Applications2019journal article

    View DOI
    0 cites

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

    Journal of Statistical Physics2018journal article

    View DOI
    0 cites

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

    The Annals of Applied Probability2018journal article

    View DOI
    0 cites

  21. Critical random graphs and the differential equations technique

    Indian Journal of Pure and Applied Mathematics2018journal article

    View DOI
    0 cites

  22. 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
    0 cites

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

    Combinatorics, Probability and Computing2017journal article

    View DOI
    0 cites

  24. Universality for first passage percolation on sparse random graphs

    The Annals of Probability2017journal article

    View DOI
    0 cites

  25. Stochastic weighted graphs: Flexible model specification and simulation

    Social Networks2017journal article

    View DOI
    0 cites

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

    Probability Theory and Related Fields2017journal article

    View DOI
    0 cites

  27. Continuum limit of critical inhomogeneous random graphs

    Probability Theory and Related Fields2016journal article

    View DOI
    0 cites

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

    Advances in Applied Probability2016journal article

    View DOI
    0 cites

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

    Advances in Applied Probability2016journal article

    View DOI
    0 cites

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

    Journal of Applied Probability2016journal article

    View DOI
    0 cites

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

    Journal of Applied Probability2016journal article

    View DOI
    0 cites

  32. Twitter event networks and the Superstar model

    The Annals of Applied Probability2015journal article

    View DOI
    0 cites

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

    The Annals of Applied Probability2015journal article

    View DOI
    0 cites

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

    Electronic Journal of Probability2015journal article

    View DOI
    0 cites

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

    The Annals of Applied Statistics2014journal article

    View DOI
    0 cites

  36. Bounded-Size Rules: The Barely Subcritical Regime

    Combinatorics, Probability and Computing2014journal article

    View DOI
    0 cites

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

    Probability Theory and Related Fields2013journal article

    View DOI
    0 cites

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

    Bernoulli2013journal article

    View DOI
    0 cites

  39. Aggregation models with limited choice and the multiplicative coalescent

    Random Structures & Algorithms2013journal article

    View DOI
    0 cites

  40. Novel scaling limits for critical inhomogeneous random graphs

    The Annals of Probability2012journal article

    View DOI
    0 cites

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

    The Annals of Applied Probability2012journal article

    View DOI
    0 cites

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

    Combinatorics, Probability and Computing2011journal article

    View DOI
    0 cites

  43. Spectra of Large Random Trees

    Journal of Theoretical Probability2011journal article

    View DOI
    0 cites

  44. Variants of Brownian Motion

    Wiley Encyclopedia of Operations Research and Management Science2011other

    View DOI
    0 cites

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

    The Annals of Applied Probability2010journal article

    View DOI
    0 cites

  46. Edge flows in the complete random-lengths network

    Random Structures & Algorithms2010journal article

    View DOI
    0 cites

  47. Network delay inference from additive metrics

    Random Structures & Algorithms2010journal article

    View DOI
    0 cites

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

    Electronic Journal of Probability2010journal article

    View DOI
    0 cites

  49. Mixing Time of Exponential Random Graphs

    2008 49th Annual IEEE Symposium on Foundations of Computer Science2008other

    View DOI
    0 cites

  50. Co-evolving dynamic networks

    Probability Theory and Related Fields1970journal article

    0 cites

  51. Critical first passage percolation on random graphs

    arXiv preprint arXiv:2412.034151970journal article

    0 cites

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

    Probability Theory and Related Fields1970journal article

    0 cites

  53. Local weak convergence and its applications

    arXiv preprint arXiv:2403.015441970journal article

    0 cites

  54. Network evolution with Macroscopic Delays: asymptotics and condensation

    arXiv preprint arXiv:2409.060481970journal article

    0 cites

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

    Social Network Analysis and Mining1970journal article

    0 cites

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

    Neurobiology of Aging1970journal article

    0 cites

  57. Consistency of Lloyd's Algorithm Under Perturbations

    arXiv preprint arXiv:2309.005781970journal article

    0 cites

  58. Correlation networks, dynamic factor models and community detection

    arXiv preprint arXiv:2307.099701970journal article

    0 cites

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

    arXiv preprint arXiv:2307.099741970journal article

    0 cites

  60. Minority Representation and Relative Ranking in Sampling Attributed Networks

    International Conference on Complex Networks and Their Applications1970conference paper

    0 cites

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

    arXiv preprint arXiv:2303.100821970journal article

    0 cites

  62. Statistical significance of clustering with multidimensional scaling

    Journal of Computational and Graphical Statistics1970journal article

    View DOI
    0 cites

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

    medRxiv1970journal article

    0 cites

  64. Co-evolving dynamic networks

    arXiv preprint arXiv:2203.118771970journal article

    0 cites

  65. Learning attribute distributions through random walks

    International Conference on Complex Networks and Their Applications1970conference paper

    0 cites

  66. Community detection using low-dimensional network embedding algorithms

    arXiv preprint arXiv:2111.052671970journal article

    0 cites

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

    arXiv preprint arXiv:2107.041031970journal article

    0 cites

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

    Journal of Computational and Graphical Statistics1970journal article

    View DOI
    0 cites

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

    arXiv preprint arXiv:2009.106961970journal article

    0 cites

  70. Network Models: Structure and Function

    Oberwolfach Reports1970journal article

    View DOI
    0 cites

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

    Probab. Theory Related Fields1970journal article

    View DOI
    0 cites

  72. Community extraction in multilayer networks with heterogeneous community structure

    J. Mach. Learn. Res.1970journal article

    0 cites

  73. Significance-based community detection in weighted networks

    J. Mach. Learn. Res.1970journal article

    0 cites

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

    Scientific reports1970journal article

    0 cites

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

    Journal of Child Psychology and Psychiatry1970journal article

    0 cites

  76. Exceptional rotations of random graphs: a VC theory

    J. Mach. Learn. Res.1970journal article

    0 cites

  77. Functional data analysis of tree data objects

    J. Comput. Graph. Statist.1970journal article

    View DOI
    0 cites

  78. Mixing time of exponential random graphs

    The Annals of Applied Probability1970journal article

    View DOI
    0 cites

  79. 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
    0 cites

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

    Journal of Mathematical Physics1970journal article

    View DOI
    0 cites

  81. Random networks: Flows and asymptotics

    1970book

    0 cites

  82. Stochastic Weighted Graphs: Flexible Model Specification and Simulation

    SSRN Electronic Journaljournal article

    View DOI
    0 cites