Thesis

### Uniform random planar graphs with degree constraints

Abstract:

Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph $P_{n}$, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set ${ 1,2, ldots, n }$, are now known, and variations on this standard random graph are also attracting interest. Prominent among the work on $P_{n}$ have been asymptotic results for the probability that $P_{n}$ will be connected or contain given components...

### Access Document

Files:
• (pdf, 913.8KB)

### Authors

More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Statistics
Research group:
Combinatorics
Oxford college:
Merton College
Role:
Author

#### Contributors

Division:
MPLS
Department:
Statistics
Role:
Supervisor
Publication date:
2008
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
Oxford University, UK
Language:
English
Keywords:
Subjects:
UUID:
Local pid:
ora:2334
Deposit date:
2008-09-10