Expansion and flooding in dynamic random networks with node churn

DOI10.1002/rsa.21133zbMath1522.94019arXiv2007.14681OpenAlexW3046091992MaRDI QIDQ6051059

Andrea E. F. Clementi, Isabella Ziccardi, Luca Becchetti, Luca Trevisan, Francesco Pasquale

Publication date: 12 October 2023

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

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

zbMATH Keywords

dynamic networksfloodingvertex expansionnode churnrandom evolving graphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial probability (60C05) Information theory (general) (94A15)

Cites Work

• Unnamed Item
• Unnamed Item
• Xheal: a localized self-healing algorithm using expanders
• Distributed computation in dynamic networks
• Flooding Time of Edge-Markovian Evolving Graphs
• Markov Chains
• Expanders via Local Edge Flips
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• Local Update Algorithms for Random Graphs
• Sampling Regular Graphs and a Peer-to-Peer Network
• Perigee: Efficient Peer-to-Peer Network Design for Blockchains
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*
• Concentration of Measure for the Analysis of Randomized Algorithms

This page was built for publication: Expansion and flooding in dynamic random networks with node churn