Abstract
We consider graphs obtained by placing n points at random on a unit sphere in ℝd, and connecting two points by an edge if they are close to each other (e.g., the angle at the origin that their corresponding unit vectors make is at most π/3). We refer to these graphs as geometric graphs. We also consider a complement family of graphs in which two points are connected by an edge if they are far away from each other (e.g., the angle is at least 2π/3). We refer to these graphs as anti-geometric graphs. The families of graphs that we consider come up naturally in the context of semidefinite relaxations of graph optimization problems such as graph coloring.
For both distributions, we show that the largest dimension for which a random graph is likely to be connected is the same (up to an additive constant) as the largest dimension for which a random graph is likely not to have isolated vertices. The phenomenon that connectivity of random graphs is tightly related to nonexistence of isolated vertices is not new, and appeared in earlier work both on nongeometric models and on other geometric models. The fact that in our model the dimension d is allowed to grow as a function of n distinguishes our results from earlier results on connectivity of random geometric graphs.
This is a preview of subscription content, log in via an institution to check access.
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
Alon, N., Benjamini, I., Stacey, A.: Percolation on finite graphs and isoperimetric inequalities. Annals of Probability, 1727–1745 (2004)
Appel, M.J.B., Russo, R.P.: The connectivity of a graph on uniform points on [0, 1]d. Statistics & Probability Letters 60(4), 351–357 (2002)
Ben-Shimon, S., Krivelevich, M.: Vertex percolation on expander graphs. European Journal of Combinatorics 30(2), 339–350 (2009)
David, R.: Finding planted k-coloring in vector k-colorable graphs. MSC Thesis, Weizmann Institute (2013), http://www.wisdom.weizmann.ac.il/~feige/TechnicalReports/RoeeDavidThesis.pdf
Erdos, P., Renyi, A.: On random graphs I. Publ. Math. Debrecen 6, 290–297 (1959)
Feige, Langberg, Schechtman: Graphs with tiny vector chromatic numbers and huge chromatic numbers. SICOMP: SIAM Journal on Computing 33 (2004)
Feige, U., Schechtman, G.: On the optimality of the random hyperplane rounding technique for max cut. Random Structures & Algorithms 20(3), 403–440 (2002)
Godehardt, E., Jaworski, J.: On the connectivity of a random interval graph. Random Structures & Algorithms 9(1-2), 137–161 (1996)
Goel, A., Rai, S., Krishnamachari, B.: Sharp thresholds for monotone properties in random geometric graphs. In: Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, pp. 580–586. ACM (2004)
Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM (JACM) 42(6), 1115–1145 (1995)
Grimmett, G.: What is Percolation? Springer (1999)
Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. In: Stochastic Analysis, Control, Optimization and Applications, pp. 547–566. Springer (1998)
Karger, D., Motwani, R., Sudan, M.: Approximate graph coloring by semidefinite programming. Journal of the ACM (JACM) 45(2), 246–265 (1998)
Li, S.: Concise formulas for the area and volume of a hyperspherical cap. Asian Journal of Mathematics and Statistics 4(1), 66–70 (2011)
Meester, R., Roy, R.: Continuum percolation. Cambridge tracts in mathematics, vol. 119 (1996)
Penrose, M.D.: Random geometric graphs (2003)
Penrose, M.D.: Continuum percolation and euclidean minimal spanning trees in high dimensions. The Annals of Applied Probability 6(2), 528–544 (1996)
Penrose, M.D.: The random minimal spanning tree in high dimensions. The Annals of Probability 24(4), 1903–1925 (1996)
Penrose, M.D.: The longest edge of the random minimal spanning tree. Ann. Appl. Probab. 7(2), 340–361 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
David, R., Feige, U. (2013). Connectivity of Random High Dimensional Geometric Graphs. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2013 2013. Lecture Notes in Computer Science, vol 8096. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40328-6_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-40328-6_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40327-9
Online ISBN: 978-3-642-40328-6
eBook Packages: Computer ScienceComputer Science (R0)