Universality for the directed configuration model: metric space convergence of the strongly connected components at criticality
From MaRDI portal
Publication:6595703
Recommendations
- The scaling limit of a critical random directed graph
- The diameter of the directed configuration model
- The giant component of the directed configuration model revisited
- Heavy-tailed configuration models at criticality
- Universality for critical heavy-tailed network models: metric structure of maximal components
Cites work
- scientific article; zbMATH DE number 3951715 (Why is no real title available?)
- scientific article; zbMATH DE number 19286 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1859371 (Why is no real title available?)
- scientific article; zbMATH DE number 7273765 (Why is no real title available?)
- scientific article; zbMATH DE number 3194856 (Why is no real title available?)
- A critical point for random graphs with a given degree sequence
- A new approach to the giant component problem
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- An Introduction to the Theory of Point Processes
- Birth of a strongly connected giant in an inhomogeneous random digraph
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Connectivity of a general class of inhomogeneous random digraphs
- Critical window for the configuration model: finite third moment degrees
- Directed random graphs with given degree distributions
- Heavy-tailed configuration models at criticality
- Local Limit Theorems for Lattice Random Variables
- Nonstandard regular variation of in-degree and out-degree in the preferential attachment model
- Probability
- Random graphs and complex networks. Volume 1
- Random trees and applications
- Scaling limit of multitype Galton-Watson trees with infinitely many types
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
- The component sizes of a critical random graph with given degree sequence
- The giant component of the directed configuration model revisited
- Universality for critical heavy-tailed network models: metric structure of maximal components
This page was built for publication: Universality for the directed configuration model: metric space convergence of the strongly connected components at criticality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595703)