Upper Bounds for Number of Removed Edges in the Erased Configuration Model

DOI10.1007/978-3-319-26784-5_5zbMath1342.05174arXiv1507.05008OpenAlexW2231467818MaRDI QIDQ3460739

Pim Van der Hoorn, Nelly Litvak

Publication date: 8 January 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Distance in graphs (05C12)

Related Items (5)

Optimal subgraph structures in scale-free configuration models ⋮ Triadic closure in configuration models with unbounded degree fluctuations ⋮ Degree correlations in scale-free random graph models ⋮ Limit theorems for assortativity and clustering in null models for scale-free networks ⋮ Limit laws for self-loops and multiple edges in the configuration model

This page was built for publication: Upper Bounds for Number of Removed Edges in the Erased Configuration Model