On a conditionally Poissonian graph process

Advances in Applied Probability

Volumn 38, Issue 1, 2006, Pages 59-75

  Norros, Ilkka ^a   Reittu, Hannu ^a  

^a VTT TECHNICAL RESEARCH CENTRE OF FINLAND   (Finland)

Author keywords

Branching process; Giant component; Power law; Random graph

Indexed keywords

COMPUTATIONAL GEOMETRY; GRAPH THEORY; PROBABILITY; RANDOM PROCESSES;

BRANCHING PROCESS; GIANT COMPONENT; POWER LAW; RANDOM GRAPH;

POISSON DISTRIBUTION;

EID: 33646150930     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1143936140     Document Type: Article

References (20)

1. Aiello, W., Chung, F. and Lu, L. (2000). A random graph model for massive graphs. In Proc. 32nd Annual ACM Symp. Theory Comput., ACM, New York, pp. 171-180.
2. Barabási, A.-L. and Albert, R. (1999). Emergence of scaling in random networks. Science 286, 509-512.
3. Barabási A.-L. and Albert, R. (2002). Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47-97.
4. Bingham, N. H., Goldie, C. M. and Teugels, J. L. (1987). Regular Variation. Cambridge University Press.
5. Bollobás, B. and riordan, O. (2003). Coupling scale-free and classical random graphs. Internet Math. 1, 215-225.
6. Bollobás, B. and riordan, O. (2004). The diameter of a scale-free random graph. Combinatorica 4, 5-34.
7. Chung, F. and Lu, L. (2003). The average distance in a random graph with given expected degrees (full version). Internet Math. 1, 91-114.
8. Erdös, P. and Rényi, A. (1960). On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci. 5, 17-61.
9. Hooghiemstra, G. and van Mieghem, P. (2005). On the mean distance in scale-free graphs. Method. Comput. Appl. Prob. 7, 285-306.
10. Janson, S., Łuczak, T. and Ruciński, A. (2000). Random Graphs. John Wiley, New York.
11. Kallenberg, O. (1997). Foundations of Modern Probability. Springer, New York.
12. Molloy, M. and Reed, B. (1995). A critical point for random graphs with a given degree sequence. Random Structures Algorithms 6, 161-179.
13. Molloy, M. and Reed, B. (1998). The size of the giant component of a random graph with a given degree sequence. Combin. Prob. Comput. 7, 295-305.
14. Newman, M. E. J. (2003). The size of the giant component of a random graph with a given degree sequence. SIAM Rev. 45, 167-256.
15. Newman, M. E. J., Strogatz, S. H. and Watts, D. J. (2001). Random graphs with arbitrary degree distribution and their applications. Phys. Rev. E 64, 026118, 17pp.
16. Reittu, H. and Norros, I. (2002). On the effect of very large nodes in Internet graphs. In Globecom'02, Vol. III (Proc. Global Telecommunications Conf., Taipei, 2002), IEEE, pp. 2624-2628.
17. Reittu, H. and Norros, I. (2004). On the power law random graph model of massive data networks. Performance Evaluation 55, 3-23.
18. Van der Esker, H., van der Hofstad, R., Hooghiemstra, G. and Znamenski, D. (2004). Distances in random graphs with infinite mean degrees. To appear in Extremes.
19. Van der Hofstad, R., Hooghiemstra, G. and van Mieghem, P. (2005). Random graphs with finite variante degrees. Random Structures Algorithms 27, 76-123.
20. Van der Hofstad, R., Hoooghiemstra, G. and Znamenski, D. (2005). Distances in random graphs with finite mean and infinite variance degrees. Submitted.