A Markov chain approach to randomly grown graphs (Q937488)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Markov chain approach to randomly grown graphs |
scientific article; zbMATH DE number 5312415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Markov chain approach to randomly grown graphs |
scientific article; zbMATH DE number 5312415 |
Statements
A Markov chain approach to randomly grown graphs (English)
0 references
15 August 2008
0 references
Summary: 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,\dots ,\) in large graphs, and apply our results to the partial duplication model. We further illustrate the results by application to real data.
0 references
Markov chain approach
0 references
randomly grown graphs
0 references
biology
0 references
partial duplication model
0 references
0 references
0 references
0.91145104
0 references
0.9024684
0 references
0.90133625
0 references
0 references
0.90006024
0 references
0 references
