Persistence of centrality in random growing trees

DOI10.1002/rsa.20726zbMath1386.05176arXiv1511.01975OpenAlexW2963429368MaRDI QIDQ4601443

Po-Ling Loh, Varun Jog

Publication date: 16 January 2018

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

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

zbMATH Keywords

persistencediffusion processcentralitypreferential attachmentuniform attachment

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Related Items (6)

Correlated randomly growing graphs ⋮ Finding the seed of uniform attachment trees ⋮ Root finding algorithms and persistence of Jordan centrality in growing random trees ⋮ Degree centrality and root finding in growing random networks ⋮ Contagion Source Detection in Epidemic and Infodemic Outbreaks: Mathematical Analysis and Network Algorithms ⋮ Persistence of hubs in growing random networks

This page was built for publication: Persistence of centrality in random growing trees