Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

A time-invariant random graph with splitting events

Tools
- Tools
+ Tools

Georgakopoulos, Agelos and Haslegrave, John (2021) A time-invariant random graph with splitting events. Electronic Communications in Probability, 26 . pp. 1-15. 66. doi:10.1214/21-ECP436 ISSN 1083-589X.

[img]
Preview
PDF
WRAP-A-time-invariant-random-graph-splitting-events-2021.pdf - Published Version - Requires a PDF viewer.
Available under License Creative Commons Attribution 4.0.

Download (577Kb) | Preview
[img] PDF
maths-021121-wrap--tirgwse-revised-new.pdf - Accepted Version
Embargoed item. Restricted access to Repository staff only - Requires a PDF viewer.

Download (315Kb)
Official URL: https://doi.org/10.1214/21-ECP436

Request Changes to record.

Abstract

We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a Poisson random number of edges are added between them. The process is parametrised by a positive real λ which governs the limiting average degree. We show that for each value of λ there is a unique random connected rooted multigraph M(λ) invariant under this evolution. As a consequence, starting from any finite graph G the process will almost surely converge in distribution to M(λ), which does not depend on G. We show that this limit has finite expected size. The same process naturally extends to one in which connectedness is not necessarily preserved, and we give a sharp threshold for connectedness of this version.

Item Type: Journal Article
Alternative Title:
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science, Engineering and Medicine > Science > Mathematics
Library of Congress Subject Headings (LCSH): Random graphs , Combinatorial analysis , Programming (Mathematics) , Operations research
Journal or Publication Title: Electronic Communications in Probability
Publisher: Institute of Mathematical Statistics
ISSN: 1083-589X
Official Date: 6 December 2021
Dates:
DateEvent
6 December 2021Published
29 October 2021Accepted
Volume: 26
Page Range: pp. 1-15
Article Number: 66
DOI: 10.1214/21-ECP436
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Open Access (Creative Commons)
Date of first compliant deposit: 3 November 2021
Date of first compliant Open Access: 18 January 2022
RIOXX Funder/Project Grant:
Project/Grant IDRIOXX Funder NameFunder ID
639046[ERC] Horizon 2020 Framework Programmehttp://dx.doi.org/10.13039/100010661
MR/S016325/1UK Research and Innovationhttp://dx.doi.org/10.13039/100014013
Related URLs:
  • Publisher
Open Access Version:
  • ArXiv

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us