Information spreading in dynamic graphs

DOI10.1145/2332432.2332439zbMath1301.68200arXiv1111.0583OpenAlexW2095514855MaRDI QIDQ5891966

Luca Trevisan, Riccardo Silvestri, Andrea E. F. Clementi

Publication date: 5 December 2014

Published in: Distributed Computing, Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

Markov chainsdynamic graphsmobility modelsflooding protocols

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (11)

Performance analysis of multi-frame message spreading in delay tolerant networks ⋮ Random Walks on Randomly Evolving Graphs ⋮ Capacity and delay analysis in delay tolerant network with multiple communities ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ Evaluating the impact of selfish behaviors on epidemic forwarding in mobile social networks ⋮ The complexity of data aggregation in static and dynamic wireless sensor networks ⋮ Smoothed analysis of dynamic networks ⋮ Unnamed Item ⋮ Linking the mixing times of random walks on static and dynamic random graphs ⋮ Distributed computation in dynamic networks via random walks ⋮ Distributed agreement in dynamic peer-to-peer networks

Cites Work

• Unnamed Item
• Unnamed Item
• Rumor spreading in social networks
• Parsimonious flooding in dynamic graphs
• The infection time of graphs
• Broadcasting in dynamic radio networks
• The spread of a rumor or infection in a moving population
• Fast flooding over Manhattan
• Distributed computation in dynamic networks
• Tight bounds on information dissemination in sparse mobile networks
• Flooding Time of Edge-Markovian Evolving Graphs
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Tight Analyses of Two Local Load Balancing Algorithms
• Balanced Allocations
• Evolving graphs: dynamical models, inverse problems and propagation
• Information Propagation Speed in Mobile and Delay Tolerant Networks
• Information Dissemination via Random Walks in d-Dimensional Space

This page was built for publication: Information spreading in dynamic graphs