Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Statistical Analysis of Multigraphs
Stockholm University, Faculty of Social Sciences, Department of Statistics.
(English)Manuscript (preprint) (Other academic)
National Category
Social Sciences
Research subject
Statistics
Identifiers
URN: urn:nbn:se:su:diva-82692OAI: oai:DiVA.org:su-82692DiVA: diva2:571316
Note

Utgiven som Research Report 2012:2, Statistiska institutionen, Stockholms universitet

Available from: 2012-11-22 Created: 2012-11-22 Last updated: 2012-12-20Bibliographically approved
In thesis
1. Random Multigraphs: Complexity Measures, Probability Models and Statistical Inference
Open this publication in new window or tab >>Random Multigraphs: Complexity Measures, Probability Models and Statistical Inference
2012 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

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 according to a fixed stub multiplicity sequence. The second model is obtained by independent edge assignments (IEA) according to a common probability distribution over the edge sites. Two different methods for obtaining an approximate IEA model from an RSM model are also presented.

In Paper I, multigraphs are analyzed with respect to structure and complexity by using entropy and joint information. The main results include formulae for numbers of graphs of different kinds and their complexity. The local and global structure of multigraphs under RSM are analyzed in Paper II. The distribution of multigraphs under RSM is shown to depend on a single complexity statistic. The distributions under RSM and IEA are used for calculations of moments and entropies, and for comparisons by information divergence. The main results include new formulae for local edge probabilities and probability approximation for simplicity of an RSM multigraph. In Paper III, statistical tests of a simple or composite IEA hypothesis are performed using goodness-of-fit measures. The results indicate that even for very small number of edges, the null distributions of the test statistics under IEA have distributions that are  well approximated by their asymptotic χ2-distributions. Paper IV contains the multigraph algorithms that are used for numerical calculations in Papers I-III.

Place, publisher, year, edition, pages
Stockholm: Department of Statistics, Stockholm University, 2012. 9 p.
Keyword
multigraph, vertex labeled graph, edge labeled graph, isomorphism, edge multiplicity, simplicity and complexity, entropy, joint information, information divergence, goodness-of-fit
National Category
Social Sciences
Research subject
Statistics
Identifiers
urn:nbn:se:su:diva-82697 (URN)978-91-7447-610-1 (ISBN)
Public defence
2013-01-10, hörsal 5, hus B, Universitetsvägen 10 B, Stockholm, 13:00 (English)
Opponent
Supervisors
Available from: 2012-12-20 Created: 2012-11-22 Last updated: 2012-12-20Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Shafie, Termeh
By organisation
Department of Statistics
Social Sciences

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 104 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf