On the equivalence between random graph models

DOI10.1080/09720529.2008.10698193MaRDI QIDQ3078467zbMATH OpenOpenAlexFDO

Authors Nikos Glinos, Yannis C. Stamatiou

Publication date 28 February 2011

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2008.10698193

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• On threshold properties
• scientific article; zbMATH DE number 17680
• Threshold Functions for Random Graphs on a Line Segment
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Equivalence of a random intersection graph and G (n ,p )

Cites work

• scientific article; zbMATH DE number 5604091 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1254188 (Why is no real title available?)
• Monotone properties of random geometric graphs have sharp thresholds

Cited in

(7)

• Ensemble nonequivalence in random graphs with modular structure
• Asymptotic equivalence and contiguity of some random graphs
• scientific article; zbMATH DE number 17680 (Why is no real title available?)
• On threshold properties
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• On vertex, edge, and vertex-edge random graphs (extended abstract)
• On vertex, edge, and vertex-edge random graphs

This page was built for publication: On the equivalence between random graph models

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