Advances in Applied Probability

Phase transitions for random geometric preferential attachment graphs

Jonathan Jordan and Andrew R. Wade

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

Abstract

Vertices arrive sequentially in space and are joined to existing vertices at random according to a preferential rule combining degree and spatial proximity. We investigate phase transitions in the resulting graph as the relative strengths of these two components of the attachment rule are varied. Previous work of one of the authors showed that when the geometric component is weak, the limiting degree sequence mimics the standard Barabási-Albert preferential attachment model. We show that at the other extreme, in the case of a sufficiently strong geometric component, the limiting degree sequence mimics a purely geometric model, the on-line nearest-neighbour graph, for which we prove some extensions of known results. We also show the presence of an intermediate regime, with behaviour distinct from both the on-line nearest-neighbour graph and the Barabási-Albert model; in this regime, we obtain a stretched exponential upper bound on the degree sequence.

Article information

Source
Adv. in Appl. Probab., Volume 47, Number 2 (2015), 565-588.

Dates
First available in Project Euclid: 25 June 2015

Permanent link to this document
https://projecteuclid.org/euclid.aap/1435236988

Digital Object Identifier
doi:10.1239/aap/1435236988

Mathematical Reviews number (MathSciNet)
MR3360390

Zentralblatt MATH identifier
1364.60019

Subjects
Primary: 60D05: Geometric probability and stochastic geometry [See also 52A22, 53C65]
Secondary: 05C80: Random graphs [See also 60B20] 90B15: Network models, stochastic

Keywords
Random spatial network preferential attachment on-line nearest-neighbour graph degree sequence

Citation

Jordan, Jonathan; Wade, Andrew R. Phase transitions for random geometric preferential attachment graphs. Adv. in Appl. Probab. 47 (2015), no. 2, 565--588. doi:10.1239/aap/1435236988. https://projecteuclid.org/euclid.aap/1435236988


Export citation

References

  • Berger, N. \et (2007). Degree distribution of the FKP network model. Theoret. Comput. Sci. 379, 306–316.
  • 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.
  • Brockwell P. J. and Brown, B. M. (1981). High-efficiency estimation for the positive stable laws. J. Amer. Statist. Assoc. 76, 626–631.
  • Chalker, T. K. \et (1999). On the size of a random sphere of influence graph, Adv. Appl. Prob. 31, 596–609.
  • Fabrikant, A., Koutsoupias, E. and Papadimitriou, C. H. (2002). Heuristically optimized trade-offs: a new paradigm for power laws in the internet. In Automata, Languages and Programming (Lecture Notes Comput. Sci. 2380), Springer, Berlin, pp. 110–122.
  • Ferretti, L. and Cortelezzi, M. (2011). Preferential attachment in growing spatial networks. Phys. Rev. E 84, 016103.
  • Flaxman, A. D., Frieze, A. M. and Vera, J. (2006). A geometric preferential attachment model of networks. Internet Math. 3, 187–205.
  • Flaxman, A. D., Frieze, A. M. and Vera, J. (2007). A geometric preferential attachment model of networks. II. Internet Math. 4, 87–111.
  • Jacob, E. and Mörters, P. (2015). Spatial preferential attachment networks: power laws and clustering coefficients. Ann. Appl. Prob. 25, 632–662.
  • Jordan, J. (2006). The degree sequences and spectra of scale-free random graphs. Random Structures Algorithms 29, 226–242.
  • Jordan, J. (2010). Degree sequences of geometric preferential attachment graphs. Adv. Appl. Prob. 42, 319–330.
  • Manna, S. S. and Sen, P. (2002). Modulated scale-free network in Euclidean space. Phys. Rev. E 66, 066114.
  • McDiarmid, C. (1998). Concentration. In Probabilistic Methods for Algorithmic Discrete Mathematics, Springer, Berlin, pp. 195–248.
  • Molloy, M. and Reed, B. (2002). Graph Colouring and the Probabilistic Method. Springer, Berlin.
  • Pemantle, R. (2007). A survey of random processes with reinforcement. Prob. Surv. 4, 1–79.
  • Penrose, M. D. (2005). Multivariate spatial central limit theorems with applications to percolation and spatial graphs. Ann. Prob. 33, 1945–1991.
  • Penrose, M. D. (2007). Laws of large numbers in stochastic geometry with statistical applications. Bernoulli 13, 1124–1150.
  • Penrose, M. D. and Wade, A. R. (2010). Random directed and on-line networks. In New Perspectives in Stochastic Geometry, Oxford University Press, pp. 248–274.
  • Penrose, M. D. and Yukich, J. E. (2003). Weak laws of large numbers in geometric probability. Ann. Appl. Prob. 13, 277–303.