The evolution of uniform random planar graphs (Q2380439)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5686989
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The evolution of uniform random planar graphs |
scientific article; zbMATH DE number 5686989 |
Statements
The evolution of uniform random planar graphs (English)
0 references
26 March 2010
0 references
A random graph is selected according to a uniform distribution over the set of planar graphs on \(\{1,\dots,n\}\) with \(m=m(n)\) edges. The probability \(P\) is investigated that the random planar graph will have a connected component isomorphic to some fixed specified graph \(H\). Also the probability \(P'\) that the random planar graph will contain a subgraph isomorphic to \(H\) is investigated. Asymptotic results for \(P\) and \(P'\) are given for different behaviour of the ratio m/n as n tends to infinity and for \(H\) specified arbitrary or as a tree.
0 references
Planar graphs
0 references
random graphs
0 references
isomorphic components
0 references
isomorphic subgraphs
0 references
0.8453176617622375
0 references
0.8392118215560913
0 references
0.8332197070121765
0 references
0.8313202261924744
0 references
0.8309608697891235
0 references
