Random Multigraphs : Complexity Measures, Probability Models and Statistical Inference
This thesis is concerned with multigraphs and their complexity which is defined and quantified by the distribution of edge multiplicities. Two random multigraph models are considered. The first model is random stub matching (RSM) where the edges are formed by randomly coupling pairs of stubs accord...
| Main Author: | |
|---|---|
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
Stockholms universitet, Statistiska institutionen
2012
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-82697 http://nbn-resolving.de/urn:isbn:978-91-7447-610-1 |