暂无分享,去创建一个
[1] Yong Gao,et al. Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs , 2009, Discret. Appl. Math..
[2] A. Laforgia. Further inequalities for the gamma function , 1984 .
[3] Muhittin Mungan,et al. Comment on "Apollonian networks: simultaneously scale-free, small world, euclidean, space filling, and with matching graphs". , 2011, Physical review letters.
[4] Mahmoud Fouz,et al. Why rumors spread so quickly in social networks , 2012, Commun. ACM.
[5] George Giakkoupis. Tight Bounds for Rumor Spreading with Vertex Expansion , 2014, SODA.
[6] Ryuhei Uehara,et al. Scale Free Properties of Random k-Trees , 2010, Math. Comput. Sci..
[7] Thomas Sauerwald,et al. Randomized Rumour Spreading: The Effect of the Network Topology , 2014, Combinatorics, Probability and Computing.
[8] Mor Harchol-Balter,et al. Resource discovery in distributed networks , 1999, PODC '99.
[9] Amin Saberi,et al. On the spread of viruses on the internet , 2005, SODA '05.
[10] J. S. Andrade,et al. Apollonian networks: simultaneously scale-free, small world, euclidean, space filling, and with matching graphs. , 2004, Physical review letters.
[11] Yong Gao. The degree distribution of random k-trees , 2009, Theor. Comput. Sci..
[12] Amin Saberi,et al. On certain connectivity properties of the Internet topology , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[13] Robert Elsässer,et al. Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems , 2016, Distributed Computing.
[14] Petar Maymounkov,et al. Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance , 2011, STOC '12.
[15] G. Fertin,et al. High-dimensional Apollonian networks , 2005, cond-mat/0503316.
[16] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[17] George Giakkoupis,et al. Tight bounds for rumor spreading in graphs of a given conductance , 2011, STACS.
[18] Silvio Lattanzi,et al. Rumor spreading in social networks , 2011, Theor. Comput. Sci..
[19] Tao Zhou,et al. Maximal planar networks with large clustering coefficient and power-law degree distribution. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[20] Thomas Sauerwald,et al. Ultra-fast rumor spreading in social networks , 2012, SODA.
[21] Mahmoud Fouz,et al. Asynchronous Rumor Spreading in Preferential Attachment Graphs , 2012, SWAT.
[22] Richard M. Karp,et al. Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[23] F. Chung,et al. Spectra of random graphs with given expected degrees , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[24] Mahmoud Fouz,et al. Social networks spread rumors in sublogarithmic time , 2011, STOC '11.
[25] Alan M. Frieze,et al. The height of random k‐trees and related branching processes , 2013, Random Struct. Algorithms.
[26] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.
[27] Robert Elsässer,et al. On the communication complexity of randomized broadcasting in random-like graphs , 2006, SPAA '06.
[28] Philippe Flajolet,et al. Some exactly solvable models of urn process theory , 2006 .
[29] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[30] Eli Upfal,et al. Randomized Broadcast in Networks , 1990, Random Struct. Algorithms.
[31] Doug Terry,et al. Epidemic algorithms for replicated database maintenance , 1988, OPSR.
[32] Samuel Kotz,et al. Urn Models and Their Application: An Approach to Modern Discrete Probability Theory , 1978 .
[33] Konstantinos Panagiotou,et al. Rumor spreading on random regular graphs and expanders , 2010, Random Struct. Algorithms.
[34] Tao Zhou,et al. Erratum: Maximal planar networks with large clustering coefficient and power-law degree distribution [Phys. Rev. E 71, 046141 (2005)] , 2005 .
[35] Ton Kloks. Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.
[36] M. Drmota. Random Trees: An Interplay between Combinatorics and Probability , 2009 .
[37] Hosam M. Mahmoud,et al. Polya Urn Models and Connections to Ran- dom Trees: A Review , 2003 .
[38] Johannes Gehrke,et al. Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[39] Sarah Eichmann,et al. Mathematics And Computer Science Algorithms Trees Combinatorics And Probabilities , 2016 .
[40] Stephen P. Boyd,et al. Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.
[41] Konstantinos Panagiotou,et al. Reliable Broadcasting in Random Networks and the Effect of Density , 2010, 2010 Proceedings IEEE INFOCOM.