Abstract
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large as possible. This game is in the spirit of recent papers on avoiding a giant component, but here we embrace it.
We analyze this game in the offline and online setting, for arbitrary and random instances, which provides for interesting comparisons. For arbitrary instances, we find a large lower bound on the competitive ratio. For some random instances we find a similar lower bound holds with high probability (whp). If the instance has \(\frac{1}{4}(1+\epsilon)n\) random edge pairs, when 0<ε≤ 0.003 then any online algorithm generates a component of size O((logn)3/2)whp, while the optimal offline solution contains a component of size Ω(n) whp. For other random instances we find the average-case competitive ratio is much better than the worst-case bound. If the instance has \(\frac{1}{2}(1-\epsilon)n\) random edge pairs, with 0<ε≤ 0.015, we give an online algorithm which finds a component of size Ω(n) whp.
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., Spencer, J.H.: The probabilistic method, 2nd edn. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, John Wiley & Sons, New York (2000); With an appendix on the life and work of Paul Erdös. MR 2003f:60003
Bohman, T., Frieze, A.: Avoiding a giant component. Random Structures Algorithms 19(1), 75–85 (2001); MR 2002g:05169
Bohman, T., Frieze, A., Wormald, N.C.: Avoiding a giant component II (2002) (manuscript)
Bohman, T., Kravitz, D.: Creating a giant component (2003) (manuscript )
Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634–652 (1998); MR 2000f:68049
Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58, 13–30 (1963); MR 26 #1908
Janson, S., Łuczak, T., Rucinski, A.: Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York (2000); MR 2001k:05180
McDiarmid, C.: On the method of bounded differences. In: Surveys in combinatorics, Norwich. London Math. Soc. Lecture Note Ser, vol. 141, pp. 148–188. Cambridge Univ. Press, Cambridge (1989); MR 91e:05077
Pittel, B.: On tree census and the giant component in sparse random graphs. Random Structures Algorithms 1(3), 311–342 (1990); MR 92f:05087
Scharbrodt, M., Schickinger, T., Steger, A.: A new average case analysis for completion time scheduling. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 170–178 (2002)
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., Gamarnik, D., Sorkin, G.B. (2004). Embracing the Giant Component. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-24698-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21258-4
Online ISBN: 978-3-540-24698-5
eBook Packages: Springer Book Archive