On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
暂无分享,去创建一个
Cristopher Moore | David Kempe | Aaron Clauset | Dimitris Achlioptas | A. Clauset | C. Moore | D. Achlioptas | D. Kempe | Cristopher Moore
[1] Jeong Han Kim,et al. Poisson Cloning Model for Random Graphs , 2008, 0805.4133.
[2] Cristopher Moore,et al. Accuracy and scaling phenomena in Internet mapping. , 2004, Physical review letters.
[3] T. Petermann,et al. Exploration of scale-free networks , 2004, cond-mat/0401065.
[4] Amin Saberi,et al. On certain connectivity properties of the Internet topology , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[5] Peng Xie,et al. Sampling biases in IP topology measurements , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[6] Walter Willinger,et al. The origin of power laws in Internet topologies revisited , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[7] Christos H. Papadimitriou,et al. Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet , 2002, ICALP.
[8] Anees Shaikh,et al. Issues with inferring Internet topological attributes , 2002, SPIE ITCom.
[9] Azer Bestavros,et al. On the marginal utility of network topology measurements , 2001, IMW '01.
[10] Ramesh Govindan,et al. Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[11] Michalis Faloutsos,et al. On power-law relationships of the Internet topology , 1999, SIGCOMM '99.
[12] Jon M. Kleinberg,et al. The Web as a Graph: Measurements, Models, and Methods , 1999, COCOON.
[13] N. Wormald. Surveys in Combinatorics, 1999: Models of Random Regular Graphs , 1999 .
[14] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[15] Bruce A. Reed,et al. A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.
[16] James B. Seaborn,et al. Hypergeometric Functions and Their Applications , 1991 .
[17] Béla Bollobás,et al. The Diameter of a Cycle Plus a Random Matching , 1988, SIAM J. Discret. Math..
[18] Béla Bollobás,et al. Random Graphs , 1985 .
[19] W. Hoeffding. Probability inequalities for sum of bounded random variables , 1963 .