On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree
暂无分享,去创建一个
[1] Alessandro Vespignani,et al. Epidemic spreading in scale-free networks. , 2000, Physical review letters.
[2] R. May,et al. Infection dynamics on scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.
[3] M. Murty,et al. Multiple Hurwitz Zeta Functions , 2006 .
[4] W. Fischer,et al. A Course in Complex Analysis , 2012 .
[5] Po-Ling Loh,et al. Confidence Sets for the Source of a Diffusion in Regular Trees , 2015, IEEE Transactions on Network Science and Engineering.
[6] Victor S. Adamchik,et al. On Stirling numbers and Euler sums , 1997 .
[7] Alexander Grey,et al. The Mathematical Theory of Infectious Diseases and Its Applications , 1977 .
[8] Chee Wei Tan,et al. Rooting out the rumor culprit from suspects , 2013, 2013 IEEE International Symposium on Information Theory.
[9] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science , 1991 .
[10] Helmut Prodinger,et al. A Note on Stirling Series , 2010, Integers.
[11] N. Ling. The Mathematical Theory of Infectious Diseases and its applications , 1978 .
[12] Devavrat Shah,et al. Finding Rumor Sources on Random Trees , 2011, Oper. Res..
[13] Vicente Montesinos,et al. An Introduction to Modern Analysis , 2015 .
[14] Michael E. Hoffman,et al. Multiple harmonic series. , 1992 .
[15] D. A. Sprott. Urn Models and Their Application—An Approach to Modern Discrete Probability Theory , 1978 .
[16] Devavrat Shah,et al. Rumors in a Network: Who's the Culprit? , 2009, IEEE Transactions on Information Theory.
[17] Terrence Tao,et al. An Introduction To Measure Theory , 2011 .