Seeing Red: Locating People of Interest in Networks
暂无分享,去创建一个
[1] David J. Aldous,et al. Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .
[2] H. Milward,et al. Dark Networks as Problems , 2003 .
[3] Lada A. Adamic,et al. Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.
[4] A. Asztalos,et al. Network discovery by generalized random walks , 2010, 1008.4980.
[5] Erik C. Rye,et al. The Marginal Benefit of Monitor Placement on Networks , 2016, CompleNet.
[6] W. Baker,et al. THE SOCIAL ORGANIZATION OF CONSPIRACY: ILLEGAL NETWORKS IN THE HEAVY ELECTRICAL EQUIPMENT INDUSTRY* , 1993 .
[7] Christopher M. Danforth,et al. Estimation of Global Network Statistics from Incomplete Data , 2014, PloS one.
[8] A. Fronczak,et al. Biased random walks in complex networks: the role of local navigation rules. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.
[9] Nir Friedman,et al. Being Bayesian About Network Structure. A Bayesian Approach to Structure Discovery in Bayesian Networks , 2004, Machine Learning.
[10] Christos Faloutsos,et al. Sampling from large graphs , 2006, KDD '06.
[11] P. Biernacki,et al. Snowball Sampling: Problems and Techniques of Chain Referral Sampling , 1981 .
[12] Heiko Rieger,et al. Random walks on complex networks. , 2004, Physical review letters.