How likely is an LLD degree sequence to be graphical?

DOI10.1214/105051604000000693zbMath1079.05023arXivmath/0504096OpenAlexW3100210151MaRDI QIDQ1774191

Richard Arratia, Thomas M. Liggett

Publication date: 29 April 2005

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

order statisticsgraphical sequencesdegree distributions

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extreme value theory; extremal stochastic processes (60G70) Vertex degrees (05C07)

Related Items (6)

Typical distances in the directed configuration model ⋮ Ensemble nonequivalence in random graphs with modular structure ⋮ Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy ⋮ Empirical spectral distributions of sparse random graphs ⋮ Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs ⋮ Directed random graphs with given degree distributions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast uniform generation of regular graphs
• Extremes and related properties of random sequences and processes
• Confirming two conjectures about the integer partitions
• A Random Graph Model for Power Law Graphs
• Statistical mechanics of complex networks
• A simple proof of the Erdos-Gallai theorem on graph sequences
• Seven criteria for integer sequences being graphic
• Robustness and Vulnerability of Scale-Free Random Graphs
• Generating Random Regular Graphs Quickly
• Life Testing
• On the theory of order statistics
• Probability

This page was built for publication: How likely is an LLD degree sequence to be graphical?