On the degree sequence of an evolving random graph process and its critical phenomenon
Xian-Yuan Wu, ZHAO DONG, KE LIU, and KAI-YUAN CAI
Source: J. Appl. Probab. Volume 46, Number 4
(2009), 1213-1220.
Abstract
In this paper we focus on the problem of the degree sequence for a random graph process with edge deletion. We prove that, while a specific parameter varies, the limit degree distribution of the model exhibits critical phenomenon.
First Page:
Show
Hide
Full-text: Access denied (no subscription
detected)
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.jap/1261670700
Digital Object Identifier: doi:10.1239/jap/1261670700
Zentralblatt MATH identifier: 05665467
Mathematical Reviews number (MathSciNet): MR2582718
References
Albert, R. and Barabási, A.-L. (2002). Statistical mechanics of complex networks. Rev. Modern Phys. 74, 47--97.
Mathematical Reviews (MathSciNet): MR1895096
Digital Object Identifier: doi:10.1103/RevModPhys.74.47
Albert, R., Barabási, A. and Jeong, H. (1999). Diameter of the World Wide Web. Nature 401, 130--131.
Aiello, W., Chung, F. and Lu, L. (2002). Random evolution in massive graphs. In Handbook of Massive Data Sets, eds J. Abello et al., Kluwer, Dordrecht, pp. 510--519.
Mathematical Reviews (MathSciNet): MR1948740
Zentralblatt MATH: 1024.68073
Amaral, L. A. N., Scala, A., Barthélémy, M. and Stanley, H. E. (2000). Classes of small-world networks. Proc. Nat. Acad. Sci. USA 97, 11149--11152.
Barabási, A.-L. and Albert, R. (1999). Emergence of scaling in random networks. Science 286, 509--512.
Mathematical Reviews (MathSciNet): MR2091634
Digital Object Identifier: doi:10.1126/science.286.5439.509
Bernard, H. R. et al. (1988). Studying social relations cross-culturally. Ethnology 27, 155--179.
Bollobás, B. and Riordan, O. (2002). Mathematical results on scale-free random graphs. In Handbook of Graphs and Networks, John Wiley, Berlin, pp. 1--34.
Mathematical Reviews (MathSciNet): MR2016117
Bollobás, B. and Riordan, O. (2004). The diameter of a scale-free random graph. Combinatorica 4, 5--34.
Mathematical Reviews (MathSciNet): MR2057681
Digital Object Identifier: doi:10.1007/s00493-004-0002-2
Bollobás, B., Riordan, O., Spencer, J. and Tusnády, G. (2001). The degree sequence of a scale-free random graph process. Random Structures Algorithms 18, 279--290.
Mathematical Reviews (MathSciNet): MR1824277
Broder, A. et al. (2000). Graph structure in the Web. In Proc. 9th Internat. World Wide Web Conf. Comput. Networks, North-Holland, Amsterdam, pp. 309--320.
Buckley, P. G. and Osthus, D. (2004). Popularity based random graph models leading to a scale-free degree sequence. Discrete Math. 282, 53--68.
Mathematical Reviews (MathSciNet): MR2059506
Zentralblatt MATH: 1042.05089
Digital Object Identifier: doi:10.1016/j.disc.2003.10.020
Chung, F. and Lu, L. (2004). Coupling online and offline analysis for random power law graphs. Internet Math. 1, 409-461.
Mathematical Reviews (MathSciNet): MR2119993
Zentralblatt MATH: 1089.05021
Project Euclid: euclid.im/1109191030
Cooper, C. and Frieze, A. (2003). A general model of undirected web graphs. Random Structures Algorithms 22, 311--335.
Mathematical Reviews (MathSciNet): MR1966545
Cooper, C., Frieze, A. and Vera, J. (2004). Random deletion in a scale-free random graph process. Internet Math. 1, 463--483.
Mathematical Reviews (MathSciNet): MR2119994
Zentralblatt MATH: 1080.60006
Project Euclid: euclid.im/1109191031
Erdös, P. and Rényi, A. (1959). On random graphs. I. Publ. Math. Debrecen 6, 290--297.
Mathematical Reviews (MathSciNet): MR120167
Zentralblatt MATH: 0092.15705
Gilbert, E. N. (1959). Random graphs. Ann. Math. Statist. 30, 1141--1144.
Mathematical Reviews (MathSciNet): MR108839
Zentralblatt MATH: 0168.40801
Digital Object Identifier: doi:10.1214/aoms/1177706098
Project Euclid: euclid.aoms/1177706098
Jordan, C. (1939). Calculus of Finite Differences. Hungarian Agent Eggenberger Book-Shop, Budapest.
Kumar, R. et al. (2000). Stochastic models for the web graph. In 41st Annual Symp. Foundations Comput. Sci. (Redondo Beach, CA, 2000), IEEE Computer Society, Los Alamitos, CA, pp. 57--65.
Mathematical Reviews (MathSciNet): MR1931804
Lehmann, S., Lautrup, B. and Jackson, A. D. (2003). Citation networks in high energy physics. Phys. Rev. E 68, 026113.
Newman, M. E. J. (2003). The structure and function of the complex networks. SIAM Rev. 45, 167--256.
Mathematical Reviews (MathSciNet): MR2010377
Zentralblatt MATH: 1029.68010
Digital Object Identifier: doi:10.1137/S003614450342480
Scala, A., Amaral, L. A. N. and Barthélémy, M. (2001). Small-world networks and the conformation space of a short lattice polymer chain. Europhys. Lett. 55, 594--600.
Strogatz, S. H. (2001). Exploring complex networks. Nature 410, 268--276.
Stroock, D. W. (1984). An Introduction to the Theory of Large Deviations. Springer, New York.
Mathematical Reviews (MathSciNet): MR755154
Zentralblatt MATH: 0552.60022
Watts, D. J. (1999). Small Worlds. Princeton University Press.
Mathematical Reviews (MathSciNet): MR1716136
Zentralblatt MATH: 1046.00006
Watts, D. J. and Strogatz, S. H. (1998). Collective dynamics of `small-world' networks. Nature 393, 440--442.
Wu, X.-Y., Dong, Z., Liu, K. and Cai, K.-Y. (2008). On the degree sequence and its critical phenomenon of an evolving random graph process. Preprint. Available at http://arxiv.org/abs/0806.4684v1.
Mathematical Reviews (MathSciNet): MR2406987
Digital Object Identifier: doi:10.1016/j.ins.2007.10.024
Journal of Applied Probability
