A new class of scale free random graphs

Zsolt Katona and Tamás F. Móri

Statistics & Probability Letters, 2006, vol. 76, issue 15, 1587-1593

Abstract: Consider the following modification of the Barabási-Albert random graph. At every step a new vertex is added to the graph. It is connected to the old vertices randomly, with probabilities proportional to the degree of the other vertex, and independently of each other. We show that the proportion of vertices of degree k decreases at the rate of k-3. Furthermore, we prove a strong law of large numbers for the maximum degree.

Keywords: Random; graph; Scale-free; distribution (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(06)00110-6
Full text for ScienceDirect subscribers only

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:eee:stapro:v:76:y:2006:i:15:p:1587-1593

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().