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

DOI10.1239/AAP/1151337072zbMATH Open1102.05054OpenAlexW2044357746MaRDI QIDQ5480000FDOQ5480000

Authors: Maria Deijfen, Ronald 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

Recommendations

• Stationary random graphs on \(\mathbb Z\) with prescribed iid degrees and finite mean connections
• Stationary random graphs with prescribed iid degrees on a spatial Poisson process
• Generating simple random graphs with prescribed degree distribution
• scientific article; zbMATH DE number 15335
• Uniform generation of random regular graphs of moderate degree
• Efficient and simple generation of random simple connected graphs with prescribed degree sequence
• Computing and Combinatorics
• On a possible generation modality of random graphs
• Uniform generation of random graphs with power-law degree sequences
• Fast uniform generation of random graphs with given degree sequences

zbMATH Keywords

random number

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Percolation in invariant Poisson graphs with i.i.d. degrees
• Invariant random graphs with iid degrees in a general geography
• Stationary map coloring
• Stationary random graphs with prescribed iid degrees on a spatial Poisson process
• The orbital equivalence of Bernoulli actions and their Sinai factors
• Stationary random graphs on \(\mathbb Z\) with prescribed iid degrees and finite mean connections
• Finitary isomorphisms of Brownian motions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5480000)