Tight Analysis of Randomized Rumor Spreading in Complete Graphs
暂无分享,去创建一个
[1] Amin Saberi,et al. On the spread of viruses on the internet , 2005, SODA '05.
[2] Valerio Schiavoni,et al. BRISA: Combining Efficiency and Reliability in Epidemic Data Dissemination , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium.
[3] Doug Terry,et al. Epidemic algorithms for replicated database maintenance , 1988, OPSR.
[4] B. Pittel. On spreading a rumor , 1987 .
[5] G. Pólya,et al. Problems and theorems in analysis , 1983 .
[6] Konrad Iwanicki,et al. Gossip-Based Self-Management of a Recursive Area Hierarchy for Large Wireless SensorNets , 2010, IEEE Transactions on Parallel and Distributed Systems.
[7] Benjamin Doerr,et al. Analyzing Randomized Search Heuristics: Tools from Probability Theory , 2011, Theory of Randomized Search Heuristics.
[8] Devdatt P. Dubhashi,et al. Concentration of Measure for the Analysis of Randomized Algorithms: Contents , 2009 .
[9] T. Liggett,et al. Stochastic Interacting Systems: Contact, Voter and Exclusion Processes , 1999 .
[10] Mahmoud Fouz,et al. Why rumors spread so quickly in social networks , 2012, Commun. ACM.
[11] Anne-Marie Kermarrec,et al. Gossip-based peer sampling , 2007, TOCS.
[12] Alan M. Frieze,et al. The shortest-path problem for graphs with random arc-lengths , 1985, Discret. Appl. Math..