Standard

On the continuous-time limit of the Barabási–Albert random graph. / Pachon, Angelica; Polito, Federico; Sacerdote, Laura.

Yn: Applied Mathematics and Computation, Cyfrol 378, 125177, 01.08.2020.

Allbwn ymchwil: Cyfraniad at gyfnodolynErthygl

Harvard

Pachon, A, Polito, F & Sacerdote, L 2020, 'On the continuous-time limit of the Barabási–Albert random graph', Applied Mathematics and Computation, cyfrol. 378, 125177. https://doi.org/10.1016/j.amc.2020.125177

APA

Pachon, A., Polito, F., & Sacerdote, L. (2020). On the continuous-time limit of the Barabási–Albert random graph. Applied Mathematics and Computation, 378, [125177]. https://doi.org/10.1016/j.amc.2020.125177

Vancouver

Pachon A, Polito F, Sacerdote L. On the continuous-time limit of the Barabási–Albert random graph. Applied Mathematics and Computation. 2020 Aug 1;378. 125177. https://doi.org/10.1016/j.amc.2020.125177

Author

Pachon, Angelica ; Polito, Federico ; Sacerdote, Laura. / On the continuous-time limit of the Barabási–Albert random graph. Yn: Applied Mathematics and Computation. 2020 ; Cyfrol 378.

BibTeX

@article{92be35d286b74c2b9f261184c46e4eaf,
title = "On the continuous-time limit of the Barab{\'a}si–Albert random graph",
abstract = "We prove that, via an appropriate scaling, the degree of a fixed vertex in the Barab{\'a}si–Albert model appeared at a large enough time converges in distribution to a Yule process. Using this relation we explain why the limit degree distribution of a vertex chosen uniformly at random (as the number of vertices goes to infinity), coincides with the limit distribution of the number of species in a genus selected uniformly at random in a Yule model (as time goes to infinity). To prove this result we do not assume that the number of vertices increases exponentially over time (linear rates). On the contrary, we retain their natural growth with a constant rate superimposing to the overall graph structure a suitable set of processes that we call the planted model and introducing an ad-hoc sampling procedure.",
keywords = "Barab{\'a}si–Albert model, Discrete - and continuous-time models, Planted model, Preferential attachment random graphs, Yule model",
author = "Angelica Pachon and Federico Polito and Laura Sacerdote",
year = "2020",
month = "8",
day = "1",
doi = "10.1016/j.amc.2020.125177",
language = "English",
volume = "378",
journal = "Applied Mathematics and Computation",
issn = "0096-3003",
publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - On the continuous-time limit of the Barabási–Albert random graph

AU - Pachon, Angelica

AU - Polito, Federico

AU - Sacerdote, Laura

PY - 2020/8/1

Y1 - 2020/8/1

N2 - We prove that, via an appropriate scaling, the degree of a fixed vertex in the Barabási–Albert model appeared at a large enough time converges in distribution to a Yule process. Using this relation we explain why the limit degree distribution of a vertex chosen uniformly at random (as the number of vertices goes to infinity), coincides with the limit distribution of the number of species in a genus selected uniformly at random in a Yule model (as time goes to infinity). To prove this result we do not assume that the number of vertices increases exponentially over time (linear rates). On the contrary, we retain their natural growth with a constant rate superimposing to the overall graph structure a suitable set of processes that we call the planted model and introducing an ad-hoc sampling procedure.

AB - We prove that, via an appropriate scaling, the degree of a fixed vertex in the Barabási–Albert model appeared at a large enough time converges in distribution to a Yule process. Using this relation we explain why the limit degree distribution of a vertex chosen uniformly at random (as the number of vertices goes to infinity), coincides with the limit distribution of the number of species in a genus selected uniformly at random in a Yule model (as time goes to infinity). To prove this result we do not assume that the number of vertices increases exponentially over time (linear rates). On the contrary, we retain their natural growth with a constant rate superimposing to the overall graph structure a suitable set of processes that we call the planted model and introducing an ad-hoc sampling procedure.

KW - Barabási–Albert model

KW - Discrete - and continuous-time models

KW - Planted model

KW - Preferential attachment random graphs

KW - Yule model

U2 - 10.1016/j.amc.2020.125177

DO - 10.1016/j.amc.2020.125177

M3 - Article

AN - SCOPUS:85082683024

VL - 378

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

SN - 0096-3003

M1 - 125177

ER -

ID: 3804711