The evolution of uniform random planar graphs
Abstract
Let Pn,m denote the graph taken uniformly at random from the set of all planar graphs on 1,2,..., n with exactly m(n) edges. We use counting arguments to investigate the probability that Pn,m will contain given components and subgraphs, finding that there is different asymptotic behaviour depending on the ratio m/n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.