REAL

Asymptotic degree distribution in preferential attachment graph models with multiple type edges

Backhausz, Ágnes and Rozner, Bence (2019) Asymptotic degree distribution in preferential attachment graph models with multiple type edges. Stochastic Models. ISSN 1532-4214 (In Press)

[img]
Preview
Text
1707.05064.pdf - Accepted Version
Available under License Creative Commons Attribution.

Download (256kB) | Preview

Abstract

We deal with a general preferential attachment graph model with multiple type edges. The types are chosen randomly, in a way that depends on the evolution of the graph. In the N-type case, we define the (generalized) degree of a given vertex as d=(d_1,d_2,…,d_N), where d is the number of type k edges connected to it. We prove the existence of an a.s. asymptotic degree distribution for a general family of preferential attachment random graph models with multi-type edges. More precisely, we show that the proportion of vertices with (generalized) degree d tends to some random variable as the number of steps goes to infinity. We also provide recurrence equations for the asymptotic degree distribution. Finally, we generalize the scale-free property of random graphs to the multi-type case.

Item Type: Article
Uncontrolled Keywords: Random graphs, preferential attachment, asymptotic degree distribution
Subjects: Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet
Depositing User: Ágnes Backhausz
Date Deposited: 22 Sep 2019 11:03
Last Modified: 03 Apr 2023 06:32
URI: http://real.mtak.hu/id/eprint/100253

Actions (login required)

Edit Item Edit Item