Weighted distances in scale‐free preferential attachment models. Issue 3 (3rd July 2020)

• Record Type: Journal Article
• Authors: Jorritsma, Joost; Komjáthy, Júlia
• Is Part Of: Random structures & algorithms. Volume 57:Issue 3(2020)
• Page Start: 823
• Page End: 859
• Publication Date: 2020-07-03
• Subjects: first passage percolation -- preferential attachment -- random networks -- typical distances; Random graphs -- Periodicals; Mathematical analysis -- Periodicals; 519
• DOI: 10.1002/rsa.20947
• Languages: English
• ISSNs: 1042-9832

Abstract

Abstract : We study three preferential attachment models where the parameters are such that the asymptotic degree distribution has infinite variance. Every edge is equipped with a nonnegative i.i.d. weight. We study the weighted distance between two vertices chosen uniformly at random, the typical weighted distance, and the number of edges on this path, the typical hopcount. We prove that there are precisely two universality classes of weight distributions, called the explosive and conservative class. In the explosive class, we show that the typical weighted distance converges in distribution to the sum of two i.i.d. finite random variables. In the conservative class, we prove that the typical weighted distance tends to infinity, and we give an explicit expression for the main growth term, as well as for the hopcount. Under a mild assumption on the weight distribution the fluctuations around the main term are tight.