A Markov Chain Approach to Randomly Grown Graphs

Michael Knudsen and Carsten Wiuf

Journal of Applied Mathematics, 2008, vol. 2008, 1-14

Abstract:

A Markov chain approach to the study of randomly grown graphs is proposed and applied to some popular models that have found use in biology and elsewhere. For most randomly grown graphs used in biology, it is not known whether the graph or properties of the graph converge (in some sense) as the number of vertices becomes large. Particularly, we study the behaviour of the degree sequence, that is, the number of vertices with degree in large graphs, and apply our results to the partial duplication model. We further illustrate the results by application to real data.

Date: 2008
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2008/190836.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2008/190836.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnljam:190836

DOI: 10.1155/2008/190836

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().