The First-Order Contiguity of Sparse Random Graphs with Prescribed Degrees

DOI10.1007/978-3-319-17142-5_16zbMath1461.03026OpenAlexW2290945253MaRDI QIDQ2948465

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

random graphslogicfinite model theoryconvergence laws

Mathematics Subject Classification ID

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

Related Items (1)

Cooperation in partly observable networked markets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The logic of random regular graphs
• The Probability That a Random Multigraph is Simple
• Information, Physics, and Computation
• Probabilities of Sentences about Very Sparse Random Graphs
• Probabilities on finite models
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Convergence law for random graphs with specified degree sequence
• The strange logic of random graphs

This page was built for publication: The First-Order Contiguity of Sparse Random Graphs with Prescribed Degrees