Generalized Random Dot Product graph

Tin Lok James Ng and Thomas Brendan Murphy

Statistics & Probability Letters, 2019, vol. 148, issue C, 143-149

Abstract: The Random Dot Product model for social network was introduced in Nickel (2007) and extended by Young and Scheinerman (2007), where each asymptotic results such as degree distribution, clustering and diameter on both dense and sparse cases were derived. Young and Scheinerman (2007) explored two generalizations of the model in the dense case and obtained similar asymptotic results. In this paper, we consider a generalization of the Random Dot Product model and derive its theoretical properties under the dense, sparse and intermediate cases. In particular, properties such as the size of the largest component and connectivity can be derived by applying recent results on inhomogeneous random graphs (Bollobás et al., 2007; Devroye and Fraiman, 2014).

Keywords: Random graph; Connectivity; Degree distribution; Asymptotic equivalence (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167715219300173
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:148:y:2019:i:c:p:143-149

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

DOI: 10.1016/j.spl.2019.01.011

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 ().