uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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
Asymptotics of a Random Graph Model
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Analysis and Probability Theory.
2016 (English)Licentiate thesis, comprehensive summary (Other academic)
Place, publisher, year, edition, pages
2016. , 32 p.
Series
U.U.D.M. report / Uppsala University, Department of Mathematics, ISSN 1101-3591 ; 2016:3
National Category
Probability Theory and Statistics
Identifiers
URN: urn:nbn:se:uu:diva-273524OAI: oai:DiVA.org:uu-273524DiVA: diva2:894759
Opponent
Supervisors
Available from: 2016-01-25 Created: 2016-01-15 Last updated: 2016-01-25Bibliographically approved
List of papers
1. Asymptotic Degree Distribution of a Duplication–Deletion Random Graph Model
Open this publication in new window or tab >>Asymptotic Degree Distribution of a Duplication–Deletion Random Graph Model
2015 (English)In: Internet Mathematics, ISSN 1542-7951, E-ISSN 1944-9488, Vol. 11, no 3, 289-305 p.Article in journal (Refereed) Published
National Category
Probability Theory and Statistics
Research subject
Mathematics
Identifiers
urn:nbn:se:uu:diva-274480 (URN)10.1080/15427951.2015.1009523 (DOI)
Available from: 2016-01-21 Created: 2016-01-21 Last updated: 2017-11-30
2. The dominating colour of an infinite Pólya urn model
Open this publication in new window or tab >>The dominating colour of an infinite Pólya urn model
2016 (English)In: Journal of Applied Probability, ISSN 0021-9002, E-ISSN 1475-6072, Vol. 53, no 3, 914-924 p.Article in journal (Refereed) Published
Abstract [en]

We study a Pólya-type urn model defined as follows. Start at time 0 with a single ball of some colour. Then, at each time n≥1, choose a ball from the urn uniformly at random. With probability ½<p<1, return the ball to the urn along with another ball of the same colour. With probability 1−p, recolour the ball to a new colour and then return it to the urn. This is equivalent to the supercritical case of a random graph model studied by Backhausz and Móri (2015), (2016) and Thörnblad (2015). We prove that, with probability 1, there is a dominating colour, in the sense that, after some random but finite time, there is a colour that always has the most number of balls. A crucial part of the proof is the analysis of an urn model with two colours, in which the observed ball is returned to the urn along with another ball of the same colour with probability p, and removed with probability 1−p. Our results here generalise a classical result about the Pólya urn model (which corresponds to p=1).

National Category
Probability Theory and Statistics
Identifiers
urn:nbn:se:uu:diva-274483 (URN)10.1017/jpr.2016.49 (DOI)000386349900019 ()
Available from: 2016-01-21 Created: 2016-01-21 Last updated: 2017-11-30Bibliographically approved

Open Access in DiVA

No full text

Authority records BETA

Thörnblad, Erik

Search in DiVA

By author/editor
Thörnblad, Erik
By organisation
Analysis and Probability Theory
Probability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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