Generating Random Networks Without Short Cycles

DOI10.1287/opre.2018.1730zbMath1443.90142arXiv0811.2853OpenAlexW2963003535MaRDI QIDQ4971560

Amin Saberi, Mohsen Bayati, Andrea Montanari

Publication date: 12 October 2020

Published in: Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

random graphsPoisson approximationnetwork models

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Deterministic network models in operations research (90B10)

Uses Software

• Randgraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sequential algorithm for generating random graphs
• The early evolution of the \(H\)-free process
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Bootstrap methods: another look at the jackknife
• The evolution of social and economic networks.
• Constrainted graph processes
• Efficient importance sampling for binary contingency tables
• A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
• Modern Coding Theory
• Poisson approximation for large deviations
• Random Graph Processes with Degree Restrictions
• The Structure and Function of Complex Networks
• Concentration of non‐Lipschitz functions and applications
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• On the size of a random maximal graph
• Generating Random Regular Graphs Quickly
• Random maximalH-free graphs
• Algorithms, games, and the internet
• Triangle‐free subgraphs in the triangle‐free process
• Dynamic concentration of the triangle-free process
• The C_ℓ‐free process
• Sequential Monte Carlo Methods for Statistical Analysis of Tables
• Generating random regular graphs