A statistical construction of power-law networks

International Journal of Parallel, Emergent and Distributed Systems

Volumn 25, Issue 3, 2010, Pages 223-235

  Ghadge, Shilpa ^a   Killingback, Timothy ^a   Sundaram, Bala ^a   Tran, Duc A ^a  

^a UNIVERSITY OF MASSACHUSETTS BOSTON   (United States)

Author keywords

Growing random networks; Lognormal distribution; Peer to peer networks; Power law networks

Indexed keywords

BASE PROTOCOLS; COMPLEX NETWORKS; DEGREE DISTRIBUTIONS; IN-BUILDINGS; LOG-NORMAL DISTRIBUTION; NEW MECHANISMS; NEW PROTOCOL; P2P NETWORK; POWER-LAW; POWER-LAW DEGREE DISTRIBUTION; POWER-LAW NETWORKS; PREFERENTIAL ATTACHMENTS; RANDOM NETWORK; REAL-WORLD; REAL-WORLD NETWORKS; SEARCH ALGORITHMS; SEARCH PROCEDURES; STATISTICAL FEATURES;

AD HOC NETWORKS; CLIENT SERVER COMPUTER SYSTEMS; LEARNING ALGORITHMS; NETWORK PROTOCOLS;

PEER TO PEER NETWORKS;

EID: 77951478774     PISSN: 17445760     EISSN: 17445779     Source Type: Journal    
DOI: 10.1080/17445760903429963     Document Type: Article

References (34)

1. L. Adamic, R. Lukose, A. Puniyani, and B. Huberman, Search in power-law networks, Phys. Rev. E 64 (2001), p. 046135.
2. R. Albert, H. Jeong, and A.L. Barabási, Diameter of the world-wide-web, Nature 400 (1999), pp. 107-110.
3. L.A.N. Amaral, A. Scala, M. Barthelemy, and H.E. Stanley, Classes of small-world networks, Proc. Natl Acad. Sci. USA 97 (2000), pp. 11149-111520.
4. A. Barabási, The physics of the web, Phys. World 14(7) (2001), pp. 33-38.
5. A.L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286 (1999), pp. 509-512.
6. C. Bedogne and G.J. Rodgers, Complex growing networks with intrinsic vertex fitness, Phys. Rev. E 74 (2006), p. 046115.
7. G. Caldarelli, A. Capocci, P.D.L. Rios, and M. Munoz, Scale-free networks from varying vertex intrinsic fitness, Phys. Rev. Lett. 89(25) (2002), p. 258702.
8. A. Chaintreau, P. Fraigniaud, and E. Lebhar, Networks become navigable as nodes move and forget, in ICALP '08: Proceedings of the 35th International Colloquium on Automata, Languages and Programming, Part I, Reykjavik, Iceland Berlin, Springer-Verlag, 2008, pp. 133-144.
9. P. Erdós and A. Rényi, On random graphs, Publ. Math. 6 (1959), pp. 290-297.
10. P. Erdós and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hungarian Acad. Sci. 5 (1960), pp. 17-61.
11. P. Erdós and A. Rényi, On the strength of connectedness of a random graph, Acta Mathematia Scientia Hungary 12 (1961), pp. 261-267.
12. M. Faloutros, P. Faloutros, and C. Faloutros, On power-law relationship of the internet topology, ACM SIGCOM 99, Comp. Comm. Rev. 29 (1999), pp. 251-260.
13. H. Jeong, S. Mason, R. Oltvai, and A. Barabási, Lethality and centrality in protein networks, Nature 411 (2001), p. 41. (Pubitemid 32428180)
14. H. Jeong, B. Tombor, R. Albert, N. Oltvai, and A. Barabási, The large-scale organization of metabolic networks, Nature 607 (2000), p. 651. (Pubitemid 32423171)
15. J. Kleinberg, The small-world phenomenon: An algorithmic perspective, Tech. Rep., Ithaca, NY, USA (1999).
16. J. Kleinberg, The convergence of social and technological networks, Commun. ACM 51 (2008), pp. 66-72.
17. T. Klingberg and R. Manfredi, Gnutella protocol development (2002). Available at http:// rfc-gnutella.sourceforge.net/src/rfc-06-draft.html.
18. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal, Stochastic models for the web graph, in FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, 2000, p. 57.
19. F. Liljeros, C.R. Edling, L.A.N. Amaral, H.E. Stanley, and Y. Aberg, The web of human sexual contacts, Nature 411 (2001), p. 907.
20. E. Limpert, W.A. Stahel, and M. Abbt, Log-normal distribution across the sciences: Keys and clues, BioScience 51(5) (2001), pp. 341-352. (Pubitemid 32550418)
21. S. Merugu, S. Srinivasan, and E. Zegura, Adding structure to unstructured peer-to-peer networks: The use of small-world graphs, J. Parallel Distrib. Comput. 65 (2005), pp. 142-153. (Pubitemid 40079491)
22. M. Neuman, The structure of scientific collaboration networks, Proc. Natl Acad. Sci. USA 98 (2001), pp. 404-409.
23. M.E.J. Newman, S.H. Strogatz, and D.J. Watts, Random graphs with arbitrary degree distributions and their applications, Phys. Rev. E 64 (2001), p. 026118.
24. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable content addressable network, in ACM SIGCOMM, San Diego, CA, August, 2001, pp. 161-172.
25. M. Ripeanu, I. Foster, and A. Iamnitchi, Mapping the gnutella network: Properties of largescale peer-to-peer systems and implications for system design, IEEE Inter. Comp. J. 6 (2002), p. 2002.
26. C. Rohrs, Limewire design. Available at http://www.limewire.org/project/ www/design.html.
27. S. Saroin, P.K. Gummadi, and S.D. Gribble, A measurement study of peer-to-peer file sharing systems, Proceedings of Multimedia Computing and Networking (MMCN) (2002).
28. N. Sarshar and V. Roychowdhury, Scale-free and stable structures in complex ad hoc networks, Phys. Rev. E 69(2) (2004), p. 026101.
29. N. Sarshar, P.O. Boykin, and V.P. Roychowdhury, Percolation search in power law networks: Making unstructured peer-to-peer networks scalable, Proceedings of the 4th International Conference on Peer-to-Peer Computing (2004), pp. 2-9. (Pubitemid 40184530)
30. S. Schmid and R. Wattenhofer, Structuring unstructured peer-to-peer networks, in 14th Annual IEEE International Conference on High Performance Computing (HiPC), Goa, India, LNCS 4873, Springer, Berlin, December, 2007.
31. I. Stoica, R. Morris, D. Karger, M. Kaashock, and H. Balakrishman, Chord: A scalable peer-topeer lookup protocol for internet applications, in ACM SIGCOMM, San Diego, CA, August, 2001, pp. 149-160.
32. D. Vito, G. Caldarelli, and P. Butta, Vertex intrinsic fitness: How to produce arbitrary scale-free networks, Phys. Rev. E 70 (2004), p. 056126.
33. D. Watts and S. Strogatz, Collective dynamics of 'small-world' networks, Nature 393 (1998), pp. 440-442.
34. B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph, and J. Kubiatowicz, Tapestry: A resilient global-scale overlay for service deployment, IEEE J. Selected Areas Commun. 22(1) (2004), pp. 41-53.