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
Random Graphs: Dynamic and Multi-type Extensions
Stockholm University, Faculty of Science, Department of Mathematics.
2017 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Random graphs is a well-studied field of probability theory, and have proven very useful in a range of applications. However, most random graphs are \textit{static} in the sense that the network structure does not change over time; they also tend to consist of \textit{single-type} objects. This puts restrictions on possible applications. In this thesis we extend two standard models to a \textit{dynamic} and \textit{multi-type} setting, respectively.

In the first paper we study a dynamic version of the famous Erd\H{o}s-Rényi graph. The graph changes dynamically over time, but still has the static Erd\H{o}s-Rényi graph as its stationary distribution. In studying the dynamic graph we present two results. The first one concerns the time to stationarity, and the second one the time to reach a certain number of edges.

In the second paper we introduce and study an extension of the preferential attachment model. The standard preferential attachment model is already dynamic, but its vertices are only allowed to be of one type. We introduce a multi-type analogue of the preferential attachment model and study its asymptotic degree distributions as well as its asymptotic composition.

Place, publisher, year, edition, pages
Stockholm University, 2017.
National Category
Probability Theory and Statistics
Identifiers
URN: urn:nbn:se:su:diva-146892OAI: oai:DiVA.org:su-146892DiVA: diva2:1141654
Presentation
2017-10-05, 306, Hus 6, Kräftriket, Roslagsvägen 101, Stockholm, 13:00 (English)
Opponent
Supervisors
Available from: 2017-09-28 Created: 2017-09-15 Last updated: 2017-09-28Bibliographically approved

Open Access in DiVA

summary(248 kB)15 downloads
File information
File name SUMMARY01.pdfFile size 248 kBChecksum SHA-512
35b0177e11a9120e8753348f3abd8a9c50fcff8eaf0cbcc9e93c4c58cf8142eb65393e497c2b71e3037cf596885c114061052aaa73d2cf8e7eb8af9492a6dfd2
Type summaryMimetype application/pdf

Search in DiVA

By author/editor
Rosengren, Sebastian
By organisation
Department of Mathematics
Probability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 79 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