Abstract
In the study of random structures we often face a trade-off between realism and tractability, the latter typically enabled by independence assumptions. In this work we initiate an effort to bridge this gap by developing tools that allow us to work with independence without assuming it. Let \(\mathcal {G}_{n}\) be the set of all graphs on n vertices and let S be an arbitrary subset of \(\mathcal {G}_{n}\), e.g., the set of all graphs with m edges. The study of random networks can be seen as the study of properties that are true for most elements of S, i.e., that are true with high probability for a uniformly random element of S. With this in mind, we pursue the following question: What are general sufficient conditions for the uniform measure on a set of graphs \(S \subseteq \mathcal {G}_{n}\) to be well-approximable by a product measure on the set of all possible edges?
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.
D. Achlioptas—Research supported by ERC Starting Grant StG-210743 and an Alfred P. Sloan Fellowship. Research co-financed by the European Union (European Social Fund ESF) and Greek national funds through the Operational Program “Education and Lifelong Learning” of the National Strategic Reference Framework (NSRF) - Research Funding Program: ARISTEIA II.
P. Siminelakis—Supported in part by an Onassis Foundation Scholarship.
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
Achlioptas, D., Siminelakis, P.: Navigability is a robust property. CoRR, abs/1501.04931 (2015)
Bollobás, B.: Random graphs, vol. 73. Cambridge Studies in Advanced Mathematics, 2nd edn. Cambridge University Press, Cambridge (2001)
Borgs, C., Chayes, J.T., Cohn, H., Zhao, Y.: An \({\$} {\rm L} \hat{\,} {\rm p}\) \({\$}\) theory of sparse graph convergence I: limits, sparse random graph models, and power law distributions. ArXiv e-prints, January 2014
Chung, F.R.K., Lu, L.: Complex graphs and networks, vol. 107. American mathematical society Providence (2006)
Durrett, R.: Random graph dynamics, vol. 20. Cambridge University Press (2007)
Erdős, P., Rényi, A.: On random graphs. Publicationes Mathematicae Debrecen 6, 290–297 (1959)
Frieze, A., Kannan, R.: Quick approximation to matrices and applications. Combinatorica 19(2), 175–220 (1999)
Gilbert, E.N.: Random graphs. The Annals of Mathematical Statistics, 1141–1144 (1959)
Goldenberg, A., Zheng, A.X., Fienberg, S.E., Airoldi, E.M.: A survey of statistical network models. Found. Trends Mach. Learn. 2(2), 129–233 (2010)
Janson, S., Łuczak, T., Rucinski, A.: Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York (2000)
Kleinberg, J.M.: Navigation in a small world. Nature 406(6798), 845 (2000)
Kleinberg, J.M.: Small-world phenomena and the dynamics of information. In: Dietterich, T.G., Becker, S., Ghahramani, Z. (eds.) NIPS, pp. 431–438. MIT Press (2001)
Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: An approach to modeling networks. The Journal of Machine Learning Research 11, 985–1042 (2010)
Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica 15(2), 215–245 (1995)
Lovász, L.: Large networks and graph limits, vol. 60. American Mathematical Soc. (2012)
Mode, C.J.: Multitype branching processes: theory and applications. Modern analytic and computational methods in science and mathematics. American Elsevier Pub. Co. (1971)
Newman, M.: Networks: an introduction. Oxford University Press (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Achlioptas, D., Siminelakis, P. (2015). Symmetric Graph Properties Have Independent Edges. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science(), vol 9135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47666-6_37
Download citation
DOI: https://doi.org/10.1007/978-3-662-47666-6_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47665-9
Online ISBN: 978-3-662-47666-6
eBook Packages: Computer ScienceComputer Science (R0)