The first-order contiguity of sparse random graphs with prescribed degrees

DOI10.1007/978-3-319-17142-5_16MaRDI QIDQ2948465zbMATH OpenOpenAlexFDO

Authors Nans Lefebvre

Publication date 30 September 2015

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

Full work available at URL https://doi.org/10.1007/978-3-319-17142-5_16

zbMATH Keywords

finite model theorylogicrandom graphsconvergence laws

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Model theory of finite structures (03C13)

Recommendations

• Convergence law for random graphs with specified degree sequence
• scientific article; zbMATH DE number 747040
• Asymptotic equivalence and contiguity of some random graphs
• scientific article; zbMATH DE number 426367
• Random graphs with a given degree sequence

Cites work

• scientific article; zbMATH DE number 6902684 (Why is no real title available?)
• scientific article; zbMATH DE number 3274494 (Why is no real title available?)
• scientific article; zbMATH DE number 3333280 (Why is no real title available?)
• Complex graphs and networks
• Convergence law for random graphs with specified degree sequence
• Information, Physics, and Computation
• Probabilities of Sentences about Very Sparse Random Graphs
• Probabilities on finite models
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• The logic of random regular graphs
• The probability that a random multigraph is simple
• The strange logic of random graphs

Cited in

(3)

• Permutation Pseudographs and Contiguity
• Asymptotic equivalence and contiguity of some random graphs
• Cooperation in partly observable networked markets

This page was built for publication: The first-order contiguity of sparse random graphs with prescribed degrees

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