Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees
Article No.: 50, Pages 1 - 14
Abstract
The Weisfeiler-Leman (WL) dimension is an established measure for the inherent descriptive complexity of graphs and relational structures. It corresponds to the number of variables that are needed and sufficient to define the object of interest in a counting version of first-order logic (FO). These bounded-variable counting logics were even candidates to capture graph isomorphism, until a celebrated construction due to Cai, Fürer, and Immerman [Combinatorica 1992] showed that Ω(n) variables are required to distinguish all non-isomorphic n-vertex graphs.
Still, very little is known about the precise number of variables required and sufficient to define every n-vertex graph. For the bounded-variable (non-counting) FO fragments, Pikhurko, Veith, and Verbitsky [Discret. Appl. Math. 2006] provided an upper bound of [EQUATION] and showed that it is essentially tight. Our main result yields that, in the presence of counting quantifiers, [EQUATION] variables suffice. This shows that counting does allow us to save variables when defining graphs. As an application of our techniques, we also show new bounds in terms of the vertex cover number of the graph.
To obtain the results, we introduce a new concept called the WL depth of a graph. We use it to analyze branching trees within the Individualization/Refinement (I/R) paradigm from the domain of isomorphism algorithms. We extend the recursive procedure from the I/R paradigm by the possibility of splitting the graphs into independent parts. Then we bound the depth of the obtained branching trees, which translates into bounds on the WL dimension and thereby on the number of variables that suffice to define the graphs.
References
[1]
Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, and Peter Zeman. 2022. Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract). In Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers (Lecture Notes in Computer Science, Vol. 13453), Michael A. Bekos and Michael Kaufmann (Eds.). Springer, 29--42.
[2]
László Babai. 1980. On the Complexity of Canonical Labeling of Strongly Regular Graphs. SIAM J. Comput. 9, 1 (1980), 212--216.
[3]
László Babai. 1981. On the order of uniprimitive permutation groups. Ann. of Math. (2) 113, 3 (1981), 553--568.
[4]
László Babai. 2016. Graph isomorphism in quasipolynomial time [extended abstract]. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, Daniel Wichs and Yishay Mansour (Eds.). ACM, 684--697.
[5]
László Babai, Xi Chen, Xiaorui Sun, Shang-Hua Teng, and John Wilmes. 2013. Faster Canonical Forms for Strongly Regular Graphs. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA. IEEE Computer Society, 157--166.
[6]
László Babai, Paul Erdős, and Stanley M. Selkow. 1980. Random Graph Isomorphism. SIAM J. Comput. 9, 3 (1980), 628--635.
[7]
Jin-yi Cai, Martin Fürer, and Neil Immerman. 1992. An optimal lower bound on the number of variables for graph identification. Comb. 12, 4 (1992), 389--410.
[8]
Anuj Dawar and David Richerby. 2007. The Power of Counting Logics on Restricted Classes of Finite Structures. In Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings (Lecture Notes in Computer Science, Vol. 4646), Jacques Duparc and Thomas A. Henzinger (Eds.). Springer, 84--98.
[9]
Reinhard Diestel. 2012. Graph Theory, 4th Edition. Graduate texts in mathematics, Vol. 173. Springer.
[10]
Zdenek Dvorák and Sergey Norin. 2016. Strongly Sublinear Separators and Polynomial Expansion. SIAM J. Discret. Math. 30, 2 (2016), 1095--1101.
[11]
Martin Grohe. 2017. Descriptive Complexity, Canonisation, and Definable Graph Structure Theory. Lecture Notes in Logic, Vol. 47. Cambridge University Press.
[12]
Martin Grohe and Sandra Kiefer. 2019. A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus. In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece (LIPIcs, Vol. 132), Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 117:1--117:15.
[13]
Martin Grohe and Daniel Neuen. 2023. Canonisation and Definability for Graphs of Bounded Rank Width. ACM Trans. Comput. Log. 24, 1 (2023), 6:1--6:31.
[14]
Neil Immerman and Eric Lander. 1990. Describing Graphs: A First-Order Approach to Graph Canonization. In Complexity Theory Retrospective: In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, July 5, 1988, Alan L. Selman (Ed.). Springer New York, New York, NY, 59--81.
[15]
Tommi A. Junttila and Petteri Kaski. 2007. Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs. In Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007. SIAM.
[16]
Tommi A. Junttila and Petteri Kaski. 2011. Conflict Propagation and Component Recursion for Canonical Labeling. In Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011. Proceedings (Lecture Notes in Computer Science, Vol. 6595), Alberto Marchetti-Spaccamela and Michael Segal (Eds.). Springer, 151--162.
[17]
Sandra Kiefer. 2020. The Weisfeiler-Leman algorithm: an exploration of its power. ACM SIGLOG News 7, 3 (2020), 5--27.
[18]
Sandra Kiefer and Daniel Neuen. 2022. The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. SIAM J. Discret. Math. 36, 1 (2022), 252--298.
[19]
Sandra Kiefer and Daniel Neuen. 2024. Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees. CoRR abs/2402.03274 (2024). arXiv:2402.03274
[20]
Sandra Kiefer, Ilia Ponomarenko, and Pascal Schweitzer. 2019. The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3. J. ACM 66, 6 (2019), 44:1--44:31.
[21]
Brendan D. McKay. 1981. Practical graph isomorphism. Congr. Numer. 30 (1981), 45--87.
[22]
Brendan D. McKay and Adolfo Piperno. 2014. Practical graph isomorphism, II. J. Symb. Comput. 60 (2014), 94--112.
[23]
Christopher Morris, Yaron Lipman, Haggai Maron, Bastian Rieck, Nils M. Kriege, Martin Grohe, Matthias Fey, and Karsten Borgwardt. 2023. Weisfeiler and Leman go machine learning: the story so far. J. Mach. Learn. Res. 24, 333 (2023), 1--59. http://jmlr.org/papers/v24/22-0240.html
[24]
Daniel Neuen. 2022. Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, Joseph (Seffi) Naor and Niv Buchbinder (Eds.). SIAM, 1411--1434.
[25]
Daniel Neuen. 2024. Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width. In 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (LIPIcs, Vol. 289), Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, and Daniel Lokshtanov (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 53:1--53:12.
[26]
Daniel Neuen. 2024. Isomorphism Testing Parameterized by Genus and Beyond. SIAM J. Discret. Math. 38, 1 (2024), 453--484.
[27]
Martin Otto. 2017. Bounded Variable Logics and Counting: A Study in Finite Models. Lecture Notes in Logic, Vol. 9. Cambridge University Press.
[28]
Oleg Pikhurko, Helmut Veith, and Oleg Verbitsky. 2006. The first order definability of graphs: Upper bounds for quantifier depth. Discret. Appl. Math. 154, 17 (2006), 2511--2529.
[29]
David E. Roberson. 2022. Oddomorphisms and homomorphism indistinguishability over graphs of bounded degree. CoRR abs/2206.10321 (2022). arXiv:2206.10321
[30]
Thomas Schneider and Pascal Schweitzer. 2024. An Upper Bound on the Weisfeiler-Leman Dimension. CoRR abs/2403.12581 (2024). arXiv:2403.12581
[31]
Daniel A. Spielman. 1996. Faster Isomorphism Testing of Strongly Regular Graphs. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996, Gary L. Miller (Ed.). ACM, 576--584.
[32]
Boris Weisfeiler and Andrei Leman. 1968. The reduction of a graph to canonical form and the algebra which appears therein. NTI, Series 2 (1968). English translation by Grigory Ryabov available at https://www.iti.zcu.cz/wl2018/pdf/wl_paper_translation.pdf.
Index Terms
- Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees
Recommendations
The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs
The Weisfeiler--Leman procedure is a widely used technique for graph isomorphism testing that works by iteratively computing an isomorphism-invariant coloring of vertex tuples. Meanwhile, a fundamental tool in structural graph theory, which is often ...
The Weisfeiler–Leman Dimension of Distance-Hereditary Graphs
AbstractA graph is said to be distance-hereditary if the distance function in every connected induced subgraph is the same as in the graph itself. We prove that the ordinary Weisfeiler–Leman algorithm tests the isomorphism of any two graphs if one of them ...
Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler–Leman Refinement Steps
We prove near-optimal tradeoffs for quantifier depth (also called quantifier rank) versus number of variables in first-order logic by exhibiting pairs of n-element structures that can be distinguished by a k-variable first-order sentence but where every ...
Comments
Information & Contributors
Information
Published In
July 2024
988 pages
ISBN:9798400706608
DOI:10.1145/3661814
- Conference Chair:
- Pawel Sobocinski,
- Program Chairs:
- Ugo Dal Lago,
- Javier Esparza
This work is licensed under a Creative Commons Attribution International 4.0 License.
Sponsors
- SIGLOG: ACM Special Interest Group on Logic and Computation
- IEEE Computer Society
In-Cooperation
- EACSL
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 July 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Glasstone Benefaction, University of Oxford
Conference
LICS '24
Sponsor:
LICS '24: 39th Annual ACM/IEEE Symposium on Logic in Computer Science
July 8 - 11, 2024
Tallinn, Estonia
Acceptance Rates
LICS '24 Paper Acceptance Rate 72 of 236 submissions, 31%;
Overall Acceptance Rate 215 of 622 submissions, 35%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 36Total Downloads
- Downloads (Last 12 months)36
- Downloads (Last 6 weeks)11
Reflects downloads up to 26 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in