Abstract
We study a random graph G n that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of G n are n sequentially generated points x 1,x 2,...,x n chosen uniformly at random from the unit sphere in R 3. After generating x t , we randomly connect it to m points from those points in x 1,x 2,...,x t − 1 which are within distance r. Neighbours are chosen with probability proportional to their current degree. We show that if m is sufficiently large and if r ≥ log n / n 1/2 − β for some constant β then whp at time n the number of vertices of degree k follows a power law with exponent 3. Unlike the preferential attachment graph, this geometric preferential attachment graph has small separators, similar to experimental observations of [7]. We further show that if m ≥ K log n, K sufficiently large, then G n is connected and has diameter O (m/r) whp .
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aiello, W., Chung, F.R.K., Lu, L.: A random graph model for massive graphs. In: Proc. of the 32nd Annual ACM Symposium on the Theory of Computing, pp. 171–180 (2000)
Aiello, W., Chung, F.R.K., Lu, L.: Random Evolution in Massive Graphs. In: Proc. of IEEE Symposium on Foundations of Computer Science, pp. 510–519 (2001)
Albert, R., Barabási, A., Jeong, H.: Diameter of the world wide web. Nature 401, 103–131 (1999)
Barabasi, A., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Berger, N., Bollobas, B., Borgs, C., Chayes, J., Riordan, O.: Degree distribution of the FKP network model. In: Proc. of the 30th International Colloquium of Automata, Languages and Programming, pp. 725–738 (2003)
Berger, N., Borgs, C., Chayes, J., D’Souza, R., Kleinberg, R.D.: Competition-induced preferential attachment (preprint)
Blandford, D., Blelloch, G.E., Kash, I.: Compact Representations of Separable Graphs. In: Proc. of ACM/SIAM Symposium on Discrete Algorithms, pp. 679–688 (2003)
Bollobás, B., Riordan, O.: Mathematical Results on Scale-free Random Graphs. In: Handbook of Graphs and Networks. Wiley-VCH, Berlin (2002)
Bollobás, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica 4, 5–34 (2004)
Bollobás, B., Riordan, O.: Coupling scale free and classical random graphs (preprint)
Bollobás, B., Riordan, O., Spencer, J., Tusanády, G.: The degree sequence of a scale-free random graph process. Random Structures and Algorithms 18, 279–290 (2001)
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the web. In: Proc. of the 9th Intl. World Wide Web Conference, pp. 309–320 (2002)
Buckley, G., Osthus, D.: Popularity based random graph models leading to a scale-free degree distribution. Discrete Mathematics 282, 53–68 (2004)
Chung, F.R.K., Lu, L., Vu, V.: Eigenvalues of random power law graphs. Annals of Combinatorics 7, 21–33 (2003)
Chung, F.R.K., Lu, L., Vu, V.: The spectra of random graphs with expected degrees. In: Proceedings of national Academy of Sciences, vol. 100, pp. 6313–6318 (2003)
Cooper, C., Frieze, A.M.: A General Model of Undirected Web Graphs. Random Structures and Algorithms 22, 311–335 (2003)
Drinea, E., Enachescu, M., Mitzenmacher, M.: Variations on Random Graph Models for the Web, Harvard Technical Report TR-06-01 (2001)
Erdős, P., Rényi, A.: On random graphs I. Publicationes Mathematicae Debrecen 6, 290–297 (1959)
Fabrikant, A., Koutsoupias, E., Papadimitriou, C.H.: Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet. In: Proc. of 29th International Colloquium of Automata, Languages and Programming (2002)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-law Relationships of the Internet Topology. ACM SIGCOMM Computer Communication Review 29, 251–262 (1999)
Hayes, B.: Graph theory in practice: Part II. American Scientist 88, 104–109 (2000)
Kleinberg, J.M., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.S.: The Web as a Graph: Measurements, Models, and Methods. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, p. 1. Springer, Heidelberg (1999)
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic Models for the Web Graph. In: Proc. IEEE Symposium on Foundations of Computer Science, vol. 57 (2000)
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: The Web as a Graph. In: Proc. 19th ACM SIGACT-SIGMOD-AIGART Symp. Principles of Database Systems (PODS), pp. 1–10 (2000)
Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the Web for emerging cyber-communities. Computer Networks 31, 1481–1493 (1999)
McDiarmid, C.J.H.: Concentration. In: Probabilistic methods in algorithmic discrete mathematics, pp. 195–248 (1998)
Mihail, M., Papadimitriou, C.H.: On the Eigenvalue Power Law. In: Proc. of the 6th International Workshop on Randomization and Approximation Techniques, pp. 254–262 (2002)
Mihail, M., Papadimitriou, C.H., Saberi, A.: On Certain Connectivity Properties of the Internet Topology. In: Proc. IEEE Symposium on Foundations of Computer Science, p. 28 (2003)
Mitzenmacher, M.: A brief history of generative models for power law and lognormal distributions (preprint)
Penrose, M.D.: Random Geometric Graphs. Oxford University Press, Oxford (2003)
Simon, H.A.: On a class of skew distribution functions. Biometrika 42, 425–440 (1955)
Watts, D.J.: Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton University Press, Princeton (1999)
Yule, G.: A mathematical theory of evolution based on the conclusions of Dr. J.C. Willis. Philosophical Transactions of the Royal Society of London (Series B) 213, 21–87 (1925)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flaxman, A.D., Frieze, A.M., Vera, J. (2004). A Geometric Preferential Attachment Model of Networks. In: Leonardi, S. (eds) Algorithms and Models for the Web-Graph. WAW 2004. Lecture Notes in Computer Science, vol 3243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30216-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-30216-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23427-2
Online ISBN: 978-3-540-30216-2
eBook Packages: Springer Book Archive