Depth first exploration of a configuration model
DOI10.1214/22-EJP762zbMath1490.60268arXiv1911.10083MaRDI QIDQ2136094
Nathanaël Enriquez, Laurent Ménard, Nathan Noiry, Gabriel Faraud
Publication date: 10 May 2022
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.10083
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Large deviations (60F10) Dynamic continuum models (systems of particles, etc.) in time-dependent statistical mechanics (82C21)
Cites Work
- Unnamed Item
- Critical window for the configuration model: finite third moment degrees
- Almost all regular graphs are Hamiltonian
- Large holes in sparse random graphs
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The asymptotic number of labeled graphs with given degree sequences
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Differential equations for random processes and random graphs
- An old approach to the giant component problem
- The continuum limit of critical random graphs
- Random Graphs and Complex Networks
- The Phase Transition in the Configuration Model
- The scaling window for a random graph with a given degree sequence
- A new approach to the giant component problem
- Some problems in the enumeration of labelled graphs
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- A critical point for random graphs with a given degree sequence
- Limiting shape of the depth first search tree in an Erdős‐Rényi graph
- A scaling limit for the length of the longest cycle in a sparse random digraph
This page was built for publication: Depth first exploration of a configuration model
