Abstract
A class of growing networks is introduced in which new nodes are given a spatial position and are connected to existing nodes with a probability mechanism favouring short distances and high degrees. The competition of preferential attachment and spatial clustering gives this model a range of interesting properties. Most notably, empirical degree distributions converge to a limit law, which can be a power law with any exponent τ > 2, and the average clustering coefficient converges to a positive limit. Our main tool to show these and other results is a weak law of large numbers in the spirit of Penrose and Yukich, which can be applied thanks to a novel rescaling idea. We also conjecture that the networks have a robust giant component if τ is sufficiently small.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aiello, W., Bonato, A., Cooper, C., Janssen, J., Prałat, P.: A spatial web graph model with local influence regions. Internet Mathematics 5, 175–196 (2009)
Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Rev. Modern Phys. 74, 47–97 (2002)
Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Berger, N., Borgs, C., Chayes, J., Saberi, A.: Asymptotic behavior and distributional limits of preferential attachment graphs. Ann. Prob. (to appear, 2013)
Bloznelis, M.: Degree and clustering coefficient in sparse random intersection graphs. Ann. Appl. Prob. 23, 1254–1289 (2013)
Bollobás, B., Riordan, O.M.: Mathematical results on scale-free random graphs. In: Handbook of Graphs and Networks, pp. 1–34. Wiley-VCH, Weinheim (2003)
Bonato, A., Janssen, J., Pralat, P.: Geometric protean graphs. Internet Mathematics 8, 2–28 (2012)
Cooper, C., Frieze, A., Prałat, P.: Some typical properties of the spatial preferred attachment model. In: Bonato, A., Janssen, J. (eds.) WAW 2012. LNCS, vol. 7323, pp. 29–40. Springer, Heidelberg (2012)
Dereich, S., Mörters, P.: Random networks with sublinear preferential attachment: degree evolutions. Electron. J. Probab. 14(43), 1222–1267 (2009)
Dereich, S., Mörters, P.: Random networks with concave preferential attachment rule. Jahresber. Dtsch. Math.-Ver. 113, 21–40 (2011)
Dereich, S., Mörters, P.: Random networks with sublinear preferential attachment: the giant component. Ann. Prob. 41, 329–384 (2013)
Flaxman, A.D., Frieze, A.M., Vera, J.: A geometric preferential attachment model of networks. Internet Math. 3, 187–205 (2006)
Flaxman, A.D., Frieze, A.M., Vera, J.: A geometric preferential attachment model of networks II. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 41–55. Springer, Heidelberg (2007)
Jacob, E., Mörters, P.: Spatial preferential attachment networks: Power laws and clustering coefficients. arXiv:1210.3830 (2012)
Janssen, J., Pralat, P., Wilson, R.: Geometric graph properties of the spatial preferred attachment model. Adv. Appl. Math. 50, 243–267 (2013)
Jordan, J.: Degree sequences of geometric preferential attachment graphs. Adv. in Appl. Probab. 42, 319–330 (2010)
Meester, R., Roy, R.: Continuum percolation. Cambridge Tracts in Mathematics, vol. 119. Cambridge University Press, Cambridge (1996)
Penrose, M.: Random geometric graphs. Oxford Studies in Probability, vol. 5. Oxford University Press, Oxford (2003)
Penrose, M.D., Yukich, J.E.: Weak laws of large numbers in geometric probability. Ann. Appl. Probab. 13, 277–303 (2003)
Rudas, A., Tóth, B., Valkó, B.: Random trees and general branching processes. Random Structures Algorithms 31, 186–202 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Jacob, E., Mörters, P. (2013). A Spatial Preferential Attachment Model with Local Clustering. In: Bonato, A., Mitzenmacher, M., Prałat, P. (eds) Algorithms and Models for the Web Graph. WAW 2013. Lecture Notes in Computer Science, vol 8305. Springer, Cham. https://doi.org/10.1007/978-3-319-03536-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-03536-9_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03535-2
Online ISBN: 978-3-319-03536-9
eBook Packages: Computer ScienceComputer Science (R0)