Minimum Expected *-Cast Time in DTNs
From MaRDI portal
Publication:3006019
DOI10.1007/978-3-642-12808-0_10zbMath1214.68045MaRDI QIDQ3006019
Andreea Picu, Thrasyvoulos Spyropoulos
Publication date: 10 June 2011
Published in: Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12808-0_10
91D30: Social networks; opinion dynamics
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
62P99: Applications of statistics
Cites Work
- Unnamed Item
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- General asymptotic estimates for the coupon collector problem
- Statistical mechanics of complex networks
- A random graph model for massive graphs
- The Structure and Function of Complex Networks
- The coupon-collector's problem revisited
- WAITING TIME IN THE COUPON‐COLLECTOR'S PROBLEM1
- Random Walks with Lookahead on Power Law Random Graphs