Diameter of P.A. random graphs with edge‐step functions

DOI10.1002/RSA.20929zbMath1462.05322arXiv1902.10165OpenAlexW3029805828MaRDI QIDQ5136926

Rémy Sanchis, Caio Alves, Rodrigo Ribeiro

Publication date: 30 November 2020

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.10165

zbMATH Keywords

diametercliquescomplex networkspreferential attachmentscale-freesmall-worldconcentration bounds

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Extreme value theory; extremal stochastic processes (60G70) Distance in graphs (05C12)

Related Items (3)

Spread of Infection over P.A. random graphs with edge insertion ⋮ Preferential attachment random graphs with edge-step functions ⋮ \(\gamma\)-variable first-order logic of uniform attachment random graphs

This page was built for publication: Diameter of P.A. random graphs with edge‐step functions