Shankar Bhamidi

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Functional Central limit theorems for microscopic and macroscopic functionals of inhomogeneous random graphs	2024	Shankar Bhamidi Amarjit Budhiraja Akshay Sakanaveeti
+ PDF Chat	Critical first passage percolation on random graphs	2024	Shankar Bhamidi Rick Durrett Xiangying Huang
+ PDF Chat	Network evolution with mesoscopic delay	2024	Sayan Banerjee Shankar Bhamidi Partha S. Dey Akshay Sakanaveeti
+ PDF Chat	Network evolution with Macroscopic Delays: asymptotics and condensation	2024	Sayan Banerjee Shankar Bhamidi Partha S. Dey Akshay Sakanaveeti
+	Scaling limits and universality: Critical percolation on weighted graphs converging to an 𝐿³ graphon	2024	Jnaneshwar Baslingker Shankar Bhamidi Nicolas Broutin Sanchayan Sen Xuan Wang
+ PDF Chat	Local weak convergence and its applications	2024	Sayan Banerjee Shankar Bhamidi Jianan Shen Seth Parker Young
+	Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes	2024	Shankar Bhamidi Sanchayan Sen
+ PDF Chat	Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes	2024	Shankar Bhamidi Sanchayan Sen
+ PDF Chat	Fluctuation bounds for continuous time branching processes and evolution of growing trees with a change point	2023	Sayan Banerjee Shankar Bhamidi Iain Carmichael
+ PDF Chat	Improved baselines for causal structure learning on interventional data	2023	Robin Richter Shankar Bhamidi Sach Mukherjee
+	Scaling limits and universality: Critical percolation on weighted graphs converging to an $L^3$ graphon	2023	Jnaneshwar Baslingker Shankar Bhamidi Nicolas Broutin Sanchayan Sen Xuan Wang
+	Attribute network models, stochastic approximation, and network sampling and ranking algorithms	2023	Nelson Antunes Sayan Banerjee Shankar Bhamidi Vladas Pipiras
+	Dynamic factor and VARMA models: equivalent representations, dimension reduction and nonlinear matrix equations	2023	Shankar Bhamidi Dhruv Patel Vladas Pipiras
+	Correlation networks, dynamic factor models and community detection	2023	Shankar Bhamidi Dhruv Patel Vladas Pipiras Guo‐Rong Wu
+	Consistency of Lloyd's Algorithm Under Perturbations	2023	Dhruv Patel Hui Shen Shankar Bhamidi Yufeng Liu Vladas Pipiras
+ PDF Chat	A Conversation with David J. Aldous	2022	Shankar Bhamidi
+ PDF Chat	Near equilibrium fluctuations for supermarket models with growing choices	2022	Shankar Bhamidi Amarjit Budhiraja Miheer Dewaskar
+ PDF Chat	Root finding algorithms and persistence of Jordan centrality in growing random trees	2022	Sayan Banerjee Shankar Bhamidi
+ PDF Chat	Rare event asymptotics for exploration processes for random graphs	2022	Shankar Bhamidi Amarjit Budhiraja Paul Dupuis Ruoyu Wu
+	Co-evolving dynamic networks	2022	Sayan Banerjee Shankar Bhamidi Xiangying Huang
+ PDF Chat	Global lower mass-bound for critical configuration models in the heavy-tailed regime	2022	Shankar Bhamidi Souvik Dhara Remco van der Hofstad Sanchayan Sen
+	Community detection using low-dimensional network embedding algorithms	2021	Aman Barot Shankar Bhamidi Souvik Dhara
+ PDF Chat	Community modulated recursive trees and population dependent branching processes	2021	Shankar Bhamidi Ruituo Fan Nicolás Fraiman Andrew B. Nobel
+ PDF Chat	Community modulated recursive trees and population dependent branching processes	2021	Shankar Bhamidi Ruituo Fan Nicolás Fraiman Andrew B. Nobel
+ PDF Chat	Persistence of hubs in growing random networks	2021	Sayan Banerjee Shankar Bhamidi
+	Sampling Based Estimation of In-Degree Distribution for Directed Complex Networks	2021	Nelson Antunes Shankar Bhamidi Tianjian Guo Vladas Pipiras Bang Wang
+ PDF Chat	Survival and extinction of epidemics on random graphs with general degree	2021	Shankar Bhamidi Danny Nam Hoi H. Nguyen Allan Sly
+	Multiscale genesis of a tiny giant for percolation on scale-free random graphs	2021	Shankar Bhamidi Souvik Dhara Remco van der Hofstad
+	Community detection using low-dimensional network embedding algorithms	2021	Aman Barot Shankar Bhamidi Souvik Dhara
+ PDF Chat	A probabilistic approach to the leader problem in random graphs	2020	Louigi Addario‐Berry Shankar Bhamidi Sanchayan Sen
+ PDF Chat	Demarcating geographic regions using community detection in commuting networks with significant self-loops	2020	Mark He Joseph Glasser Nathaniel Pritchard Shankar Bhamidi Nikhil Kaza
+	Persistence of hubs in growing random networks	2020	Sayan Banerjee Shankar Bhamidi
+ PDF Chat	Universality for critical heavy-tailed network models: Metric structure of maximal components	2020	Shankar Bhamidi Souvik Dhara Remco van der Hofstad Sanchayan Sen
+	Global lower mass-bound for critical configuration models in the heavy-tailed regime	2020	Shankar Bhamidi Souvik Dhara Remco van der Hofstad Sanchayan Sen
+	Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes	2020	Shankar Bhamidi Sanchayan Sen
+	Root finding algorithms and persistence of Jordan centrality in growing random trees	2020	Sayan Banerjee Shankar Bhamidi
+	Persistence of hubs in growing random networks	2020	Sayan Banerjee Shankar Bhamidi
+	Community modulated recursive trees and population dependent branching processes	2020	Shankar Bhamidi Ruituo Fan Nicolás Fraiman Andrew B. Nobel
+	Near Equilibrium Fluctuations for Supermarket Models with Growing Choices	2020	Shankar Bhamidi Amarjit Budhiraja Miheer Dewaskar
+ PDF Chat	Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees	2019	Shankar Bhamidi Sanchayan Sen
+	Intertemporal Community Detection in Bikeshare Networks	2019	Mark He Joseph Glasser Shankar Bhamidi Nikhil Kaza
+	Survival and extinction of epidemics on random graphs with general degrees	2019	Shankar Bhamidi Danny Nam Hoi H. Nguyen Allan Sly
+	Intertemporal Community Detection in Human Mobility Networks	2019	Mark He Joseph Glasser Shankar Bhamidi Nikhil Kaza
+	Rare event asymptotics for exploration processes for random graphs	2019	Shankar Bhamidi Amarjit Budhiraja Paul Dupuis Ruoyu Wu
+	Survival and extinction of epidemics on random graphs with general degrees	2019	Shankar Bhamidi Danny Nam Oanh Kieu Nguyen Allan Sly
+	Fluctuation bounds for continuous time branching processes and nonparametric change point detection in growing networks	2018	Sayan Banerjee Shankar Bhamidi Iain Carmichael
+ PDF Chat	Weakly interacting particle systems on inhomogeneous random graphs	2018	Shankar Bhamidi Amarjit Budhiraja Ruoyu Wu
+ PDF Chat	Weighted Exponential Random Graph Models: Scope and Large Network Limits	2018	Shankar Bhamidi Suman Chakraborty Skyler Cranmer Bruce Desmarais
+ PDF Chat	Change point detection in network models: Preferential attachment and long range dependence	2018	Shankar Bhamidi Jimmy Jin Andrew B. Nobel
+ PDF Chat	The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs	2018	Shankar Bhamidi Remco van der Hofstad Sanchayan Sen
+	Sampling-based Estimation of In-degree Distribution with Applications to Directed Complex Networks	2018	Nelson Antunes Shankar Bhamidi Tianjian Guo Vladas Pipiras Bang Wang
+	Fluctuation Bounds for Continuous Time Branching Processes and Evolution of Growing Trees With a Change Point	2018	Sayan Banerjee Shankar Bhamidi Iain Carmichael
+	Critical random graphs and the differential equations technique	2017	Shankar Bhamidi Amarjit Budhiraja Sanchayan Sen
+ PDF Chat	Erratum: First passage percolation on random graphs with finite mean degrees [Ann. Appl. Probab. 20(5) (2010) 1907–1965]	2017	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+ PDF Chat	Diameter of the Stochastic Mean-Field Model of Distance	2017	Shankar Bhamidi Remco van der Hofstad
+	Universality for first passage percolation on sparse random graphs	2017	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+ PDF Chat	Energy landscape for large average submatrix detection problems in Gaussian random matrices	2017	Shankar Bhamidi Partha S. Dey Andrew B. Nobel
+ PDF Chat	The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs	2017	Shankar Bhamidi Remco van der Hofstad Sanchayan Sen
+	A probabilistic approach to the leader problem in random graphs	2017	Louigi Addario‐Berry Shankar Bhamidi Sanchayan Sen
+	Large Deviation Principle for the Exploration Process of the Configuration Model	2017	Shankar Bhamidi Amarjit Budhiraja Paul Dupuis Ruoyu Wu
+ PDF Chat	Stochastic weighted graphs: Flexible model specification and simulation	2017	James D. Wilson Matthew J. Denny Shankar Bhamidi Skyler Cranmer Bruce Desmarais
+ PDF Chat	Stochastic weighted graphs: Flexible model specification and simulation	2016	James Wilson Matthew J. Denny Shankar Bhamidi Skyler Cranmer Bruce Desmarais
+ PDF Chat	Continuum limit of critical inhomogeneous random graphs	2016	Shankar Bhamidi Sanchayan Sen Xuan Wang
+	Significance-based community detection in weighted networks	2016	John Palowitch Shankar Bhamidi Andrew B. Nobel
+ PDF Chat	Stochastic Weighted Graphs: Flexible Model Specification and Simulation	2016	James Wilson Matthew Denny Shankar Bhamidi Skyler Cranmer Bruce Desmarais
+	Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees	2016	Shankar Bhamidi Sanchayan Sen
+	Large subgraphs in pseudo-random graphs	2016	Anirban Basak Shankar Bhamidi Suman Chakraborty Andrew B. Nobel
+	Weakly interacting particle systems on inhomogeneous random graphs	2016	Shankar Bhamidi Amarjit Budhiraja Ruoyu Wu
+	Community extraction in multilayer networks with heterogeneous community structure	2016	James Wilson John Palowitch Shankar Bhamidi Andrew B. Nobel
+	Significance-based community detection in weighted networks	2016	John Palowitch Shankar Bhamidi Andrew B. Nobel
+	Change point detection in Network models: Preferential attachment and long range dependence	2015	Shankar Bhamidi Jimmy Jin Andrew B. Nobel
+	Twitter event networks and the Superstar model	2015	Shankar Bhamidi J. Michael Steele Tauhid Zaman
+ PDF Chat	Degree distribution of shortest path trees and bias of network sampling algorithms	2015	Shankar Bhamidi Jesse Goodman Remco van der Hofstad Júlia Komjáthy
+	Stochastic Weighted Graphs: Flexible Model Specification and Simulation	2015	James Wilson Matthew J. Denny Shankar Bhamidi Skyler Cranmer Bruce Desmarais
+	Exceptional rotations of random graphs: a VC theory	2015	Louigi Addario‐Berry Shankar Bhamidi Sébastien Bubeck Luc Devroye Gábor Lugosi Roberto I. Oliveira
+	The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs	2015	Shankar Bhamidi Remco van der Hofstad Sanchayan Sen
+ PDF Chat	Exceptional Rotations of Random Graphs: A VC Theory	2015	Louigi Addario‐Berry Shankar Bhamidi Sébastien Bubeck Luc Devroye Gábor Lugosi Roberto I. Oliveira
+ PDF Chat	The importance sampling technique for understanding rare events in Erdős–Rényi random graphs	2015	Shankar Bhamidi Jan Hannig Chia Ying Lee James Nolen
+ PDF Chat	Twitter event networks and the Superstar model	2015	Shankar Bhamidi John Steele Tauhid Zaman
+ PDF Chat	Degree distribution of shortest path trees and bias of network sampling algorithms	2015	Shankar Bhamidi Jesse Goodman Remco van der Hofstad Júlia Komjáthy
+	Stochastic Weighted Graphs: Flexible Model Specification and Simulation	2015	James D. Wilson Matthew J. Denny Shankar Bhamidi Skyler Cranmer Bruce Desmarais
+	Change point detection in Network models: Preferential attachment and long range dependence	2015	Shankar Bhamidi Jimmy Jin Andrew B. Nobel
+ PDF Chat	The front of the epidemic spread and first passage percolation	2014	Shankar Bhamidi Remco van der Hofstad Júlia Komjáthy
+ PDF Chat	The front of the epidemic spread and first passage percolation	2014	Shankar Bhamidi Remco van der Hofstad Júlia Komjáthy
+	Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erdős-Rényi random graph	2014	Shankar Bhamidi Nicolas Broutin Sanchayan Sen Xuan Wang
+	A testing based extraction algorithm for identifying significant communities in networks	2014	James Wilson Simi Wang Peter J. Mucha Shankar Bhamidi Andrew B. Nobel
+ PDF Chat	Bounded-Size Rules: The Barely Subcritical Regime	2014	Shankar Bhamidi Amarjit Budhiraja Xuan Wang
+	Universality for first passage percolation on sparse uniform and rank-1 random graphs	2014	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+	Universality for first passage percolation on sparse random graphs	2014	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+	Continuum limit of critical inhomogeneous random graphs	2014	Shankar Bhamidi Sanchayan Sen Xuan Wang
+	Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erdős-Rényi random graph	2014	Shankar Bhamidi Nicolas Broutin Sanchayan Sen Xuan Wang
+ PDF Chat	A testing based extraction algorithm for identifying significant communities in networks	2014	James D. Wilson Simi Wang Peter J. Mucha Shankar Bhamidi Andrew B. Nobel
+ PDF Chat	The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs	2013	Shankar Bhamidi Amarjit Budhiraja Wang Xuan
+ PDF Chat	Functional Data Analysis of Tree Data Objects	2013	Dan Shen Haipeng Shen Shankar Bhamidi Yolanda Muñoz Maldonado Yongdai Kim J. S. Marron
+	Diameter of the stochastic mean-field model of distance	2013	Shankar Bhamidi Remco van der Hofstad
+ PDF Chat	Aggregation models with limited choice and the multiplicative coalescent	2013	Shankar Bhamidi Amarjit Budhiraja Xuan Wang
+	Weak disorder in the stochastic mean-field model of distance II	2013	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+	The importance sampling technique for understanding rare events in Erd\H{o}s-R\'enyi random graphs	2013	Shankar Bhamidi Jan Hannig Chia Ying Lee James Nolen
+	Degree distribution of shortest path trees and bias of network sampling algorithms	2013	Shankar Bhamidi J.A. Goodman Remco van der Hofstad Júlia Komjáthy
+	The importance sampling technique for understanding rare events in Erdős-Rényi random graphs	2013	Shankar Bhamidi Jan Hannig Chia Ying Lee James Nolen
+ PDF Chat	Weak disorder in the stochastic mean-field model of distance II	2013	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+	Diameter of the stochastic mean-field model of distance	2013	Shankar Bhamidi Remco van der Hofstad
+	Energy Landscape for large average submatrix detection problems in Gaussian random matrices	2012	Shankar Bhamidi Partha S. Dey Andrew B. Nobel
+	Novel scaling limits for critical inhomogeneous random graphs	2012	Shankar Bhamidi Remco van der Hofstad Johan S. H. van Leeuwaarden
+	Universality for first passage percolation on sparse random graphs	2012	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+ PDF Chat	Weak disorder asymptotics in the stochastic mean-field model of distance	2012	Shankar Bhamidi Remco van der Hofstad
+	The augmented multiplicative coalescent and critical dynamic random graph models	2012	Shankar Bhamidi Amarjit Budhiraja Xuan Wang
+	Energy Landscape for large average submatrix detection problems in Gaussian random matrices	2012	Shankar Bhamidi Partha S. Dey Andrew B. Nobel
+ PDF Chat	Novel scaling limits for critical inhomogeneous random graphs	2012	Shankar Bhamidi Remco van der Hofstad Johan S. H. van Leeuwaarden
+ PDF Chat	Weak disorder asymptotics in the stochastic mean-field model of distance	2012	Shankar Bhamidi Remco van der Hofstad
+	Universality for first passage percolation on sparse random graphs	2012	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+ PDF Chat	Mixing time of exponential random graphs	2011	Shankar Bhamidi Guy Bresler Allan Sly
+ PDF Chat	First Passage Percolation on the Erdős–Rényi Random Graph	2011	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+ PDF Chat	Spectra of Large Random Trees	2011	Shankar Bhamidi Steven N. Evans Arnab Sen
+	Variants of <scp>B</scp> rownian Motion	2011	Shankar Bhamidi Priscilla E. Greenwood
+	Bohman-Frieze processes at criticality and emergence of the giant component	2011	Shankar Bhamidi Amarjit Budhiraja Xuan Wang
+ PDF Chat	Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks	2010	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+ PDF Chat	Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks	2010	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+ PDF Chat	First passage percolation on random graphs with finite mean degrees	2010	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+	First passage percolation on the Erdős-Rényi random graph	2010	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+	First passage percolation on the Erd\H{o}s-R\'enyi random graph	2010	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+ PDF Chat	Edge flows in the complete random‐lengths network	2010	David Aldous Shankar Bhamidi
+ PDF Chat	Network delay inference from additive metrics	2010	Shankar Bhamidi Ram Rajagopal Sébastien Roch
+ PDF Chat	Scaling Limits for Critical Inhomogeneous Random Graphs with Finite Third Moments	2010	Shankar Bhamidi Remco van der Hofstad Johan S. H. van Leeuwaarden
+ PDF Chat	Network delay inference from additive metrics	2010	Shankar Bhamidi Ram Rajagopal Sébastien Roch
+	First passage percolation on the Erdős-Rényi random graph	2010	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+ PDF Chat	Scaling Limits for Critical Inhomogeneous Random Graphs with Finite Third Moments	2010	Shankar Bhamidi Remco van der Hofstad Johan S. H. van Leeuwaarden
+ PDF Chat	First passage percolation on random graphs with finite mean degrees	2010	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+	Extreme value theory, Poisson-Dirichlet distributions and FPP on random networks	2009	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+	Novel scaling limits for critical inhomogeneous random graphs	2009	Shankar Bhamidi Remco van der Hofstad Johan S. H. van Leeuwaarden
+	Scaling limits for critical inhomogeneous random graphs with finite third moments	2009	Shankar Bhamidi Remco van der Hofstad Johan S. H. van Leeuwaarden
+	Scaling limits for critical inhomogeneous random graphs with finite third moments	2009	Shankar Bhamidi Remco van der Hofstad Johan S. H. van Leeuwaarden
+	Spectra of large random trees	2009	Shankar Bhamidi Steven N. Evans Arnab Sen
+	Extreme value theory, Poisson-Dirichlet distributions and FPP on random networks	2009	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra
+	First passage percolation on locally treelike networks. I. Dense random graphs	2008	Shankar Bhamidi
+ PDF Chat	Mixing Time of Exponential Random Graphs	2008	Shankar Bhamidi Guy Bresler Allan Sly
+ PDF Chat	Brownian motion on disconnected sets, basic hypergeometric functions, and some continued fractions of Ramanujan	2008	Shankar Bhamidi Steven N. Evans Ron Peled Peter L. Ralph
+	Spectra of Random trees	2008	Shankar Bhamidi Steve Evans Arnab Sen
+	Mixing time of exponential random graphs	2008	Shankar Bhamidi Guy Bresler Allan Sly
+	Edge Flows in the Complete Random-Lengths Network	2007	David Aldous Shankar Bhamidi
+	Network Delay Inference from Additive Metrics	2006	Shankar Bhamidi Ram Rajagopal Sébastien Roch
+	Network Delay Inference from Additive Metrics	2006	Shankar Bhamidi Ram Rajagopal Sébastien Roch
+	Brownian motion on time scales, basic hypergeometric functions, and some continued fractions of Ramanujan	2005	Shankar Bhamidi Steven N. Evans Ron Peled Peter L. Ralph

Common Coauthors

Coauthor	Papers Together
Remco van der Hofstad	42
Sanchayan Sen	20
Gerard Hooghiemstra	18
Andrew B. Nobel	15
Amarjit Budhiraja	14
Sayan Banerjee	12
Johan S. H. van Leeuwaarden	7
Allan Sly	6
Xuan Wang	6
Skyler Cranmer	6
Souvik Dhara	6
Bruce Desmarais	6
Vladas Pipiras	6
Ruoyu Wu	5
Júlia Komjáthy	5
Partha S. Dey	5
James Wilson	5
Nicolas Broutin	4
Steven N. Evans	4
Matthew J. Denny	4
Louigi Addario‐Berry	4
Sébastien Roch	4
Ram Rajagopal	4
Danny Nam	3
James Nolen	3
Guy Bresler	3
Chia Ying Lee	3
Mark He	3
Arnab Sen	3
Jan Hannig	3
Ruituo Fan	3
Iain Carmichael	3
Nicolás Fraiman	3
Nikhil Kaza	3
Nelson Antunes	3
Dhruv Patel	3
Joseph Glasser	3
Paul Dupuis	3
Akshay Sakanaveeti	3
John Palowitch	3
Xuan Wang	2
Suman Chakraborty	2
Aman Barot	2
Sébastien Bubeck	2
Peter L. Ralph	2
Xiangying Huang	2
Gábor Lugosi	2
Jesse Goodman	2
Simi Wang	2
Jimmy Jin	2

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	The Structure and Function of Complex Networks	2003	Michael Newman	24
+	Random graph dynamics	2007	Richard Durrett	23
+ PDF Chat	Brownian excursions, critical random graphs and the multiplicative coalescent	1997	David Aldous	23
+	A critical point for random graphs with a given degree sequence	1995	Michael Molloy Bruce Reed	22
+ PDF Chat	Statistical mechanics of complex networks	2002	Réka Albert Albert‐László Barabási	22
+	None	2007	Béla Bollobás Svante Janson Oliver Riordan	21
+ PDF Chat	The continuum limit of critical random graphs	2010	Louigi Addario‐Berry Nicolas Broutin Christina Goldschmidt	20
+ PDF Chat	Optimal Paths in Disordered Complex Networks	2003	Lidia A. Braunstein Sergey V. Buldyrev Reuven Cohen Shlomo Havlin H. Eugene Stanley	19
+	The growth and composition of branching populations	1984	Peter Jagers Olle Nerman	18
+ PDF Chat	The Probability That a Random Multigraph is Simple	2009	Svante Janson	16
+ PDF Chat	The phase transition in inhomogeneous random graphs	2007	Béla Bollobás Svante Janson Oliver Riordan	15
+	A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs	1980	Béla Bollobás	15
+	The asymptotic number of labeled graphs with given degree sequences	1978	Edward A. Bender E. Rodney Canfield	14
+ PDF Chat	The component sizes of a critical random graph with given degree sequence	2014	Adrien Joseph	14
+ PDF Chat	Generating Simple Random Graphs with Prescribed Degree Distribution	2006	Tom Britton Maria Deijfen Anders Martin‐Löf	14
+	Connected Components in Random Graphs with Given Expected Degree Sequences	2002	Fan Chung Linyuan Lü	14
+ PDF Chat	Emergence of Scaling in Random Networks	1999	Albert‐László Barabási Réka Albert	13
+	The average distances in random graphs with given expected degrees	2002	Fan Chung Linyuan Lü	13
+	Component behavior near the critical point of the random graph process	1990	Tomasz Łuczak	13
+ PDF Chat	The Entrance Boundary of the Multiplicative Coalescent	1998	David Aldous Vlada Limic	12
+	First passage percolation on locally treelike networks. I. Dense random graphs	2008	Shankar Bhamidi	12
+	One, Two and Three Times log <i>n</i>/<i>n</i> for Paths in a Complete Graph with Random Weights	1999	Svante Janson	12
+ PDF Chat	On a conditionally Poissonian graph process	2006	Ilkka Norros Hannu Reittu	11
+	None	2009	Christian Borgs Jennifer Chayes Stephan Mertens Chandra Nair	11
+ PDF Chat	Random trees and applications	2005	Jean-François Le Gall	11
+ PDF Chat	The Phase Transition in the Configuration Model	2012	Oliver Riordan	11
+ PDF Chat	Continuum limit of critical inhomogeneous random graphs	2016	Shankar Bhamidi Sanchayan Sen Xuan Wang	11
+	Novel scaling limits for critical inhomogeneous random graphs	2012	Shankar Bhamidi Remco van der Hofstad Johan S. H. van Leeuwaarden	11
+ PDF Chat	Community detection in graphs	2009	Santo Fortunato	11
+	Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erdős-Rényi random graph	2014	Shankar Bhamidi Nicolas Broutin Sanchayan Sen Xuan Wang	10
+ PDF Chat	Scaling Limits for Critical Inhomogeneous Random Graphs with Finite Third Moments	2010	Shankar Bhamidi Remco van der Hofstad Johan S. H. van Leeuwaarden	10
+ PDF Chat	Limit Distributions and Random Trees Derived from the Birthday Problem with Unequal Probabilities	2000	Michael Camarri Jim Pitman	10
+ PDF Chat	The Continuum Random Tree. I	1991	David Aldous	10
+	The birth of the giant component	1993	Svante Janson Donald E. Knuth Tomasz Łuczak Boris Pittel	10
+ PDF Chat	The Average Distance in a Random Graph with Given Expected Degrees	2004	Fan Chung Linyuan Lü	10
+	Birth control for giants	2007	Joel Spencer Nicholas Wormald	10
+ PDF Chat	The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence	2004	David Aldous John Steele	9
+	None	2010	Tom Bohman Alan Frieze Dhruv Mubayi	9
+ PDF Chat	A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces	2013	Romain Abraham Jean‐François Delmas Patrick Hoscheit	9
+	Random Graphs	2001	Béla Bollobás	9
+ PDF Chat	Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems	1968	Krishna B. Athreya Samuel Karlin	9
+	A Course in Metric Geometry	2001	Dmitri Burago Yuri Burago S. V. Ivanov	9
+ PDF Chat	Asymptotic Fringe Distributions for General Families of Random Trees	1991	David Aldous	9
+	On the value of a random minimum spanning tree problem	1985	Alan Frieze	9
+	The scaling limit of the minimum spanning tree of the complete graph	2017	Louigi Addario‐Berry Nicolas Broutin Christina Goldschmidt Grégory Miermont	9
+ PDF Chat	First passage percolation on random graphs with finite mean degrees	2010	Shankar Bhamidi Remco van der Hofstad Gerard Hooghiemstra	9
+ PDF Chat	Evolution of networks	2002	S. N. Dorogovt︠s︡ev J. F. F. Mendes	8
+ PDF Chat	Convergence in distribution of random metric measure spaces (Λ-coalescent measure trees)	2008	Andreas Greven Peter Pfaffelhuber Anita Winter	8
+	Probability and Real Trees	2007	Steven N. Evans	8
+ PDF Chat	The Size of the Giant Component of a Random Graph with a Given Degree Sequence	1998	Michael Molloy Bruce Reed	8