On a method for random graphs
From MaRDI portal
For a random graph of order n it might hold that events \(A_{ni}\) and \(B_{ni}\) satisfy \(P(A_{ni})>0\), \(P(B_{ni}| A_{ni})\to 1\), \(P(U_ iA_{ni})\to 1\) and we would like to infer that \(P(U_ iB_{ni})\to 1\) as \(n\to \infty\). A sufficient condition and several illustrations are given.
Recommendations
Cites work
Cited in
(10)- The harmonic mean formula for probabilities of unions: Applications to sparse random graphs
- Sieve methods in random graph theory
- General paritioning on random graphs
- Characterization of randomly k-dimensional graphs.
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 4215043 (Why is no real title available?)
- scientific article; zbMATH DE number 4160788 (Why is no real title available?)
- scientific article; zbMATH DE number 4029600 (Why is no real title available?)
- scientific article; zbMATH DE number 1890147 (Why is no real title available?)
- scientific article; zbMATH DE number 7478535 (Why is no real title available?)
This page was built for publication: On a method for random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078580)