A probabilistic approach to the leader problem in random graphs

DOI10.1002/rsa.20966zbMath1523.60045arXiv1703.09908OpenAlexW3096725197MaRDI QIDQ6049915

Louigi Addario-Berry, Shankar Bhamidi, Sanchayan Sen

Publication date: 11 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.09908

zbMATH Keywords

Markov processescritical random graphsentrance boundarymultiplicative coalescentErdős-Rényi random graphinhomogeneous random graphs

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Discrete-time Markov processes on general state spaces (60J05) Coalescent processes (60J90)

Related Items (2)

Root finding algorithms and persistence of Jordan centrality in growing random trees ⋮ Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes

Cites Work

• The component sizes of a critical random graph with given degree sequence
• The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs
• Critical window for the configuration model: finite third moment degrees
• Scaling limits for critical inhomogeneous random graphs with finite third moments
• The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
• Continuum limit of critical inhomogeneous random graphs
• Novel scaling limits for critical inhomogeneous random graphs
• Birth control for giants
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The entrance boundary of the multiplicative coalescent
• The scaling limit of the minimum spanning tree of the complete graph
• Concentration around the mean for maxima of empirical processes
• Universality for critical heavy-tailed network models: metric structure of maximal components
• Heavy-tailed configuration models at criticality
• Rigid representations of the multiplicative coalescent with linear deletion
• The continuum limit of critical random graphs
• Critical behavior in inhomogeneous random graphs
• The Phase Transition in the Configuration Model
• OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
• Susceptibility in subcritical random graphs
• Component behavior near the critical point of the random graph process
• The Structure of a Random Graph at the Point of the Phase Transition
• Probability
• A critical point for random graphs with a given degree sequence
• Paths in graphs
• Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees
• Component structure of the configuration model: Barely supercritical case
• The phase transition in inhomogeneous random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A probabilistic approach to the leader problem in random graphs