Respondent-Driven Sampling for Characterizing Unstructured Overlays
暂无分享,去创建一个
Walter Willinger | Daniel Stutzbach | Reza Rejaie | Nick G. Duffield | Mojtaba Torkjazi | Amir H. Rasti
[1] Stefan Saroiu,et al. A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .
[2] S. Chib,et al. Understanding the Metropolis-Hastings Algorithm , 1995 .
[3] Albert-László Barabási,et al. Scale‐Free and Hierarchical Structures in Complex Networks , 2003 .
[4] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[5] Richard J. Lipton,et al. Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[6] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[7] Walter Willinger,et al. On unbiased sampling for unstructured peer-to-peer networks , 2009, TNET.
[8] László Lovász,et al. Random Walks on Graphs: A Survey , 1993 .
[9] Matthew J. Salganik,et al. 5. Sampling and Estimation in Hidden Populations Using Respondent-Driven Sampling , 2004 .
[10] Walter Willinger,et al. Evaluating Sampling Techniques for Large Dynamic Graphs , 2008 .
[11] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..
[12] W. K. Hastings,et al. Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .
[13] Daniel Stutzbach,et al. Characterizing unstructured overlay topologies in modern P2P file-sharing systems , 2005 .
[14] M. H. Hansen,et al. On the Theory of Sampling from Finite Populations , 1943 .
[15] Krishna P. Gummadi,et al. King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.
[16] Douglas D. Heckathorn,et al. Respondent-driven sampling II: deriving valid population estimates from chain-referral samples of hi , 2002 .
[17] Daniel Stutzbach,et al. Understanding churn in peer-to-peer networks , 2006, IMC '06.
[18] Daniel Stutzbach,et al. Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems , 2005, IEEE/ACM Transactions on Networking.
[19] Matthew J. Salganik,et al. Respondent‐driven sampling as Markov chain Monte Carlo , 2009, Statistics in medicine.
[20] Daniel Stutzbach,et al. Characterizing unstructured overlay topologies in modern P2P file-sharing systems , 2008, TNET.
[21] L. Asz. Random Walks on Graphs: a Survey , 2022 .