On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities

DOI10.1016/J.PHYSD.2020.132689arXiv1909.03846MaRDI QIDQ6324938FDOQ6324938

Authors: Umberto De Ambroggio, Federico Polito, Laura Sacerdote 

Publication date: 9 September 2019

Abstract: We analyze a dynamic random undirected graph in which newly added vertices are connected to those already present in the graph either using, with probability $p$, an anti-preferential attachment mechanism or, with probability $1-p$, a preferential attachment mechanism. We derive the asymptotic degree distribution in the general case and study the asymptotic behaviour of the expected degree process in the general and that of the degree process in the pure anti-preferential attachment case. Degree homogenization mainly affects convergence rates for the former case and also the limiting degree distribution in the latter.

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

This page was built for publication: On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6324938)