Limiting the spread of misinformation in social networks
暂无分享,去创建一个
[1] David Bruce Wilson,et al. Generating random spanning trees more quickly than the cover time , 1996, STOC '96.
[2] Mark S. Granovetter. Threshold Models of Collective Behavior , 1978, American Journal of Sociology.
[3] Giorgio Gallo,et al. On the supermodular knapsack problem , 1989, Math. Program..
[4] O. Diekmann. Mathematical Epidemiology of Infectious Diseases , 1996 .
[5] Shishir Bharathi,et al. Competitive Influence Maximization in Social Networks , 2007, WINE.
[6] Stefan Schmid,et al. On the windfall of friendship: inoculation strategies on social networks , 2008, EC '08.
[7] David Aldous,et al. The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees , 1990, SIAM J. Discret. Math..
[8] Masahiro Kimura,et al. Finding Influential Nodes in a Social Network from Information Diffusion Data , 2009 .
[9] Jacob Goldenberg,et al. Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth , 2001 .
[10] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[11] Jeffrey O. Kephart,et al. Measuring and modeling computer virus prevalence , 1993, Proceedings 1993 IEEE Computer Society Symposium on Research in Security and Privacy.
[12] Herbert W. Hethcote,et al. The Mathematics of Infectious Diseases , 2000, SIAM Rev..
[13] Masahiro Kimura,et al. Extracting Influential Nodes for Information Diffusion on a Social Network , 2007, AAAI.
[14] Matthew Richardson,et al. Mining the network value of customers , 2001, KDD '01.
[15] Tom A. B. Snijders,et al. Social Network Analysis , 2011, International Encyclopedia of Statistical Science.
[16] O. Diekmann,et al. Mathematical Epidemiology of Infectious Diseases: Model Building, Analysis and Interpretation , 2000 .
[17] G. Kirchhoff. Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .
[18] David Bruce Wilson,et al. How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time , 1996, SODA '96.
[19] John Scott. What is social network analysis , 2010 .
[20] R. Durrett. Lecture notes on particle systems and percolation , 1988 .
[21] Yifei Yuan,et al. Scalable Influence Maximization in Social Networks under the Linear Threshold Model , 2010, 2010 IEEE International Conference on Data Mining.
[22] P. Kaye. Infectious diseases of humans: Dynamics and control , 1993 .
[23] Andreas Krause,et al. Cost-effective outbreak detection in networks , 2007, KDD '07.
[24] Wei Chen,et al. Efficient influence maximization in social networks , 2009, KDD.
[25] George L. Nemhauser,et al. Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .
[26] Lisa Fleischer,et al. Submodular Approximation: Sampling-based Algorithms and Lower Bounds , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[27] David Kempe,et al. Structure and Dynamics of Information in Networks , 2010 .
[28] Joel E. Cohen,et al. Infectious Diseases of Humans: Dynamics and Control , 1992 .
[29] Andrei Z. Broder,et al. Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.
[30] Jure Leskovec,et al. Inferring networks of diffusion and influence , 2010, KDD.
[31] Stefan Grosskinsky Warwick,et al. Interacting particle systems , 2009 .
[32] Ben Y. Zhao,et al. User interactions in social networks and their implications , 2009, EuroSys '09.
[33] Rahul Garg,et al. Competing for Customers in a Social Network , 2006 .
[34] Roger Wattenhofer,et al. Word of Mouth: Rumor Dissemination in Social Networks , 2008, SIROCCO.
[35] G. Nemhauser,et al. Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .
[36] Matthew C. Elder,et al. On computer viral infection and the effect of immunization , 2000, Proceedings 16th Annual Computer Security Applications Conference (ACSAC'00).
[37] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[38] Matthew Richardson,et al. Mining knowledge-sharing sites for viral marketing , 2002, KDD.
[39] W. T. Tutte,et al. The Dissection of Rectangles Into Squares , 1940 .
[40] Alexander Grey,et al. The Mathematical Theory of Infectious Diseases and Its Applications , 1977 .
[41] Stefan M. Wild,et al. Maximizing influence in a competitive social network: a follower's perspective , 2007, ICEC.
[42] N. Ling. The Mathematical Theory of Infectious Diseases and its applications , 1978 .
[43] Pradeep Dubey,et al. Competing for Customers in a Social Network: The Quasi-linear Case , 2006, WINE.
[44] Maksim Kitsak,et al. Identifying influential spreaders in complex networks , 2010 .
[45] Vidyadhar G. Kulkarni,et al. Generating Random Combinatorial Objects , 1990, J. Algorithms.