Thesis icon

Thesis

Self-organised criticality in random graph processes

Abstract:

In the first half of this thesis, we study the random forest obtained by conditioning the Erdős--Rényi random graph G(N,p) to include no cycles. We focus on the critical window, in which, as studied by Aldous for G(N,p):


p(N) =   1+λN-1/3
N

We describe a scaling limit for the sizes...

Expand abstract

Actions


Access Document


Files:

Authors


More by this author
Division:
MPLS
Department:
Statistics
Role:
Author

Contributors

Role:
Supervisor
Role:
Supervisor
More from this funder
Name:
Engineering & Physical Sciences Research Council
Funding agency for:
Yeo, D
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
University of Oxford
UUID:
uuid:23af1abc-2128-4315-9b25-55ed8f290875
Deposit date:
2018-01-11

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP