Self-organised criticality in random graph processes
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 <style> td.upper_line { border-top:solid 1px black; } table.fraction { text-align: center; vertical-align:...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
University of Oxford
2016
|
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.735872 |