A Markov chain approach to randomly grown graphs

DOI10.1155/2008/190836zbMath1146.05311OpenAlexW1997448075WikidataQ58645953 ScholiaQ58645953MaRDI QIDQ937488

Michael Knudsen, Carsten Wiuf

Publication date: 15 August 2008

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/54519

zbMATH Keywords

biologyMarkov chain approachpartial duplication modelrandomly grown graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Vertex degrees (05C07) General biology and biomathematics (92B05)

Related Items (1)

A genetic algorithm for the maximum 2-packing set problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence properties of the degree distribution of some growing network models
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Sufficient conditions for regularity, recurrence and ergodicity of Markov processes
• Algebraic characterization of infinite Markov chains where movement to the right is limited to one step
• A MODEL OF LARGE-SCALE PROTEOME EVOLUTION
• The Structure and Function of Complex Networks
• A likelihood approach to analysis of network data
• A Note on Feedback Queues with Bulk Service

This page was built for publication: A Markov chain approach to randomly grown graphs