Universality for the directed configuration model: metric space convergence of the strongly connected components at criticality

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
The component sizes of a critical random graph with given degree sequence
Critical window for the configuration model: finite third moment degrees
Scaling limit of multitype Galton-Watson trees with infinitely many types
Random trees and applications
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
Brownian excursions, critical random graphs and the multiplicative coalescent
Universality for critical heavy-tailed network models: metric structure of maximal components
Heavy-tailed configuration models at criticality
Nonstandard regular variation of in-degree and out-degree in the preferential attachment model
Random graphs and complex networks. Volume 1
Local Limit Theorems for Lattice Random Variables
Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph
A new approach to the giant component problem
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Probability
A critical point for random graphs with a given degree sequence
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
The giant component of the directed configuration model revisited
Connectivity of a general class of inhomogeneous random digraphs
Directed random graphs with given degree distributions
An Introduction to the Theory of Point Processes

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)