Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees

DOI10.1239/aap/1151337072zbMath1102.05054OpenAlexW2044357746MaRDI QIDQ5480000

Maria Deijfen, Ronald W. J. Meester

Publication date: 25 July 2006

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1151337072

zbMATH Keywords

random number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Stationary map coloring ⋮ Percolation in invariant Poisson graphs with i.i.d. degrees ⋮ The orbital equivalence of Bernoulli actions and their Sinai factors ⋮ Invariant random graphs with iid degrees in a general geography ⋮ Finitary isomorphisms of Brownian motions

Cites Work

• Generating simple random graphs with prescribed degree distribution
• Distance in random graphs with infinite mean degrees
• Invariants for finitary isomorphisms with finite expected code lengths
• Limiting point processes for rescalings of coalescing and annihilating random walks on \(Z^ n\).
• Connected components in random graphs with given expected degree sequences
• The diameter of a scale-free random graph
• Extra heads and invariant allocations
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• A critical point for random graphs with a given degree sequence
• The average distances in random graphs with given expected degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees