Convergence properties of the degree distribution of some growing network models

DOI10.1007/s11538-006-9085-9zbMath1334.92158OpenAlexW2102285371WikidataQ51927486 ScholiaQ51927486MaRDI QIDQ263683

Carsten Wiuf, Oskar Hagberg

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

zbMATH Keywords

Markov chainnetwork modelbiological networkrandomly grown grapsh

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial probability (60C05) Systems biology, networks (92C42)

Related Items (5)

A preferential attachment model with random initial degrees ⋮ From trees to graphs: collapsing continuous-time branching processes ⋮ A Markov chain approach to randomly grown graphs ⋮ Robust Analysis of Preferential Attachment Models with Fitness ⋮ Diameters in preferential attachment models

Cites Work

• Unnamed Item
• 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

This page was built for publication: Convergence properties of the degree distribution of some growing network models