The diameter of the directed configuration model

DOI10.1214/22-AIHP1252MaRDI QIDQ2686613

Guillem Perarnau, Xing Shi Cai

Publication date: 28 February 2023

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

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

zbMATH Keywords

distancesdiameterdirected configuration model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items

Rankings in directed configuration models with heavy tailed in-degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bootstrap percolation in living neural networks
• Diameter and stationary distribution of random \(r\)-out digraphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Typical distances in the directed configuration model
• The diameter of random regular graphs
• Stationary distribution and cover time of sparse directed configuration models
• Random walk on sparse random digraphs
• The strong giant in a random digraph
• Random Graphs and Complex Networks
• The critical behavior of random digraphs
• The transitive closure of a random digraph
• The Probability That a Random Multigraph is Simple
• The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
• Characterizing optimal sampling of binary contingency tables via the configuration model
• The Diameter of Sparse Random Graphs
• The giant component of the directed configuration model revisited
• Probability Inequalities for Sums of Bounded Random Variables
• The graph structure of a deterministic automaton chosen at random
• The diameter of sparse random graphs
• On Recent Theorems Concerning the Supercritical Galton-Watson Process
• Some limit theorems for the total progeny of a branching process
• Probability