Fractal-small-world dichotomy in real-world networks.
暂无分享,去创建一个
[1] S. Havlin,et al. Scale-free networks are ultrasmall. , 2002, Physical review letters.
[2] C. Sparrow. The Fractal Geometry of Nature , 1984 .
[3] H E Stanley,et al. Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.
[4] 宁北芳,et al. 疟原虫var基因转换速率变化导致抗原变异[英]/Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A , 2005 .
[5] Alessandro Vespignani,et al. Topology and correlations in structured scale-free networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[6] Gábor Csányi,et al. Structure of a large social network. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[7] T. Vicsek. Fractal Growth Phenomena , 1989 .
[8] Albert-László Barabási,et al. Statistical mechanics of complex networks , 2001, ArXiv.
[9] M. A. de Menezes,et al. Shortest paths on systems with power-law distributed long-range connections. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[10] M. Newman,et al. The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.
[11] Reuven Cohen,et al. Scale-free networks on lattices. , 2002, Physical review letters.
[12] P. Gács,et al. Algorithms , 1992 .
[13] Béla Bollobás,et al. The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.
[14] J. Kleinfeld. COULD IT BE A BIG WORLD AFTER ALL? THE "SIX DEGREES OF SEPARATION" MYTH , 2002 .
[15] Gerald W. Neufeld,et al. Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication , 1997, SIGCOMM 1998.
[16] M. Kochen,et al. Contacts and influence , 1978 .
[17] Hongsuda Tangmunarunkit,et al. Scaling of multicast trees: comments on the Chuang-Sirbu scaling law , 1999, SIGCOMM '99.
[18] Béla Bollobás,et al. The Diameter of a Scale-Free Random Graph , 2004, Comb..
[19] F. Chung,et al. The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.
[20] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[21] Paul Erdös,et al. On random graphs, I , 1959 .
[22] Albert-László Barabási,et al. Hierarchical organization in complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[23] M. Newman,et al. Scaling and percolation in the small-world network model. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.
[24] Mark E. J. Newman,et al. The Structure and Function of Complex Networks , 2003, SIAM Rev..
[25] A. Vázquez. Growing network with local rules: preferential attachment, clustering hierarchy, and degree correlations. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[26] Matthieu De Beule,et al. Small Worlds: The Dynamics of Networks between Order and Randomness , 1999 .
[27] A. Klovdahl,et al. Social networks and the spread of infectious diseases: the AIDS example. , 1985, Social science & medicine.
[28] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[29] M E J Newman. Assortative mixing in networks. , 2002, Physical review letters.
[30] D. Watts,et al. Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .
[31] D. Watts,et al. An Experimental Study of Search in Global Social Networks , 2003, Science.
[32] Alessandro Vespignani,et al. Large-scale topological and dynamical properties of the Internet. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.
[33] Albert-László Barabási,et al. Internet: Diameter of the World-Wide Web , 1999, Nature.
[34] Michalis Faloutsos,et al. On power-law relationships of the Internet topology , 1999, SIGCOMM '99.
[35] Sharon L. Milgram,et al. The Small World Problem , 1967 .
[36] Hawoong Jeong,et al. Modeling the Internet's large-scale topology , 2001, Proceedings of the National Academy of Sciences of the United States of America.
[37] 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).
[38] J. Kleinfeld,et al. The small world problem , 2002 .