![](/images/graphics-bg.png)
A Markov Chain Approach to Randomly Grown Graphs
Joint Authors
Source
Journal of Applied Mathematics
Issue
Vol. 2008, Issue 2008 (31 Dec. 2008), pp.1-14, 14 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2008-01-24
Country of Publication
Egypt
No. of Pages
14
Main Subjects
Abstract EN
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 0,1,…, in large graphs, and apply our results to the partial duplication model.
We further illustrate the results by application to real data.
American Psychological Association (APA)
Knudsen, Michael& Wiuf, Carsten. 2008. A Markov Chain Approach to Randomly Grown Graphs. Journal of Applied Mathematics،Vol. 2008, no. 2008, pp.1-14.
https://search.emarefa.net/detail/BIM-987959
Modern Language Association (MLA)
Knudsen, Michael& Wiuf, Carsten. A Markov Chain Approach to Randomly Grown Graphs. Journal of Applied Mathematics No. 2008 (2008), pp.1-14.
https://search.emarefa.net/detail/BIM-987959
American Medical Association (AMA)
Knudsen, Michael& Wiuf, Carsten. A Markov Chain Approach to Randomly Grown Graphs. Journal of Applied Mathematics. 2008. Vol. 2008, no. 2008, pp.1-14.
https://search.emarefa.net/detail/BIM-987959
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-987959