Permutation Pseudographs and Contiguity

DOI10.1017/S0963548301005065MaRDI QIDQ3147239zbMATH OpenFDO

Authors Catherine Greenhill, Svante Janson, Jeong Han Kim, Nicholas Wormald

Publication date 9 March 2003

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548301005065

zbMATH Keywords

pseudograph spacesrandom regular graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (05C99)

Recommendations

• Random Regular Graphs: Asymptotic Distributions and Contiguity
• scientific article; zbMATH DE number 1033851
• scientific article; zbMATH DE number 1342092
• The first-order contiguity of sparse random graphs with prescribed degrees
• Asymptotic equivalence and contiguity of some random graphs

Cited in

(12)

• Relative expanders or weakly relatively Ramanujan graphs.
• Size biased couplings and the spectral gap for random regular graphs
• Exchangeable pairs, switchings, and random regular graphs
• Asymptotic equivalence and contiguity of some random graphs
• Local resilience and hamiltonicity maker-breaker games in random regular graphs
• Functional limit theorems for random regular graphs
• On the number of perfect matchings in random lifts
• Expansion of random graphs: new proofs, new results
• Sofic homological invariants and the weak Pinsker property
• Statistics of finite degree covers of torus knot complements
• Robustly self-ordered graphs: constructions and applications to property testing
• Algebraic dynamical systems from LDPC codes satisfy a strong negation of the weak Pinsker property

This page was built for publication: Permutation Pseudographs and Contiguity

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