Further properties of a random graph with duplications and deletions
From MaRDI portal
Publication:2803405
DOI10.1080/15326349.2015.1088789zbMath1338.05240arXiv1409.5279OpenAlexW1588578190MaRDI QIDQ2803405
Tamás F. Móri, Agnes Backhausz
Publication date: 4 May 2016
Published in: Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.5279
Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (2)
The connected component of the partial duplication graph ⋮ A time-invariant random graph with splitting events
Cites Work
- Unnamed Item
- Weights and degrees in a random graph model based on 3-interactions
- Randomised reproducing graphs
- Splitting trees with neutral Poissonian mutations. I: Small families
- The degree distribution of the generalized duplication model
- On a 2-parameter class of scale free random graphs
- A survey of random processes with reinforcement
- Random networks with sublinear preferential attachment: degree evolutions
- Weighing the ``heaviest Polya urn
- Splitting trees with neutral Poissonian mutations. II: Largest and oldest families
- On a preferential attachment and generalized Pólya's urn model
- Power laws for family sizes in a duplication model
- Transition of the Degree Sequence in the Random Graph Model of Cooper, Frieze, and Vera
- Asymptotic Properties of a Random Graph with Duplications
- Tracking a Markov-Modulated Stationary Degree Distribution of a Dynamic Random Graph
- Emergence of Scaling in Random Networks
- Polya Urn Models
- Preferential duplication graphs
- The Maximum Degree of the Barabási–Albert Random Tree
- Robust Analysis of Preferential Attachment Models with Fitness
This page was built for publication: Further properties of a random graph with duplications and deletions
