Convergence properties of the degree distribution of some growing network models
From MaRDI portal
Publication:263683
DOI10.1007/s11538-006-9085-9zbMath1334.92158WikidataQ51927486 ScholiaQ51927486MaRDI QIDQ263683
Publication date: 5 April 2016
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11538-006-9085-9
05C90: Applications of graph theory
60C05: Combinatorial probability
92C42: Systems biology, networks
Related Items
From trees to graphs: collapsing continuous-time branching processes, Robust Analysis of Preferential Attachment Models with Fitness, A preferential attachment model with random initial degrees, A Markov chain approach to randomly grown graphs, Diameters in preferential attachment models
Cites Work
- The degree sequence of a scale-free random graph process
- Emergence of Scaling in Random Networks
- Sampling with Varying Probabilities Without Replacement: Rotating and Non-Rotating Samples
- The phase transition in the uniformly grown random graph has infinite order
- A general model of web graphs
- A likelihood approach to analysis of network data
- Transactions on Computational Systems Biology III
- Unnamed Item