Change search

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
Random Graph Distributions of Degree variance
Stockholm University, Faculty of Social Sciences, Department of Statistics.
Identifiers
OAI: oai:DiVA.org:su-22911DiVA, id: diva2:189723
Note
Part of urn:nbn:se:su:diva-126Available from: 2004-01-02 Created: 2004-01-02 Last updated: 2010-01-13Bibliographically approved
In thesis
1. On Degree Variance in Random Graphs
Open this publication in new window or tab >>On Degree Variance in Random Graphs
2004 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

This thesis is concerned with degree moments and degree variance in random graphs. The degree of vertex i in a graph is the number of edges incident to vertex i.

In the first paper, degree moments and functions of degree moments are investigated for three random graph models. In statistical applications of random graph models the degree moments, and functions of the degree moments, have been found useful both as summary statistics and for inference on particular random graph models. Exact and asymptotic formulas are given for various degree statistics, in particular the degree variance.

The second paper focus on the degree variance. Exact and asymptotic distributions of the degree variance are investigated for Bernoulli graphs and uniform random graphs. For graphs of large order, we show that the degree variance is approximately gamma distributed with parameters obtained from the first two moments of the degree variance. The usefulness of the results is illustrated by a graph centrality test with a critical value obtained from the gamma distribution.

The third and last paper is concerned with extreme values and other attained values of the degree variance among graphs of fixed order and size, and among graphs of fixed order. The structure of the extreme graphs is investegated and it is shown that the maximum value of the degree variance can be obtained from integer sequences associated to the triangular numbers. Explicite formulas for the number of possible values and recurrence relations for the attained values of the degree variance are developed.

Place, publisher, year, edition, pages
Stockholm: Statistiska institutionen, 2004. p. 9
Keyword
Degree Sequences, Uniform Random Graphs, Bernoulli Graphs, Degree Moments, Degree Statistics, Degree Variance, Gamma Approximation, Centrality Testing, Integer Sequences
National Category
Probability Theory and Statistics
Identifiers
urn:nbn:se:su:diva-126 (URN)91-7265-786-3 (ISBN)
Public defence
2004-01-23, hörsal 3, hus B, Universitetsvägen 10, Stockholm, 10:00
Supervisors
Available from: 2004-01-02 Created: 2004-01-02Bibliographically approved

Open Access in DiVA

No full text in DiVA
By organisation
Department of Statistics

urn-nbn

Altmetric score

urn-nbn
Total: 21 hits

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