Proceedings ArticleDOI
Graph isomorphism in quasipolynomial time [extended abstract]
László Babai
- pp 684-697
TLDR
This work builds on Luks’s framework and attack the obstructions to efficient Luks recurrence via an interplay between local and global symmetry, and constructs group theoretic “local certificates” to certify the presence or absence of local symmetry.Abstract:
We show that the Graph Isomorphism (GI) problem and the more general problems of String Isomorphism (SI) andCoset Intersection (CI) can be solved in quasipolynomial(exp((logn)O(1))) time. The best previous bound for GI was exp(O( √n log n)), where n is the number of vertices (Luks, 1983); for the other two problems, the bound was similar, exp(O~(√ n)), where n is the size of the permutation domain (Babai, 1983). Following the approach of Luks’s seminal 1980/82 paper, the problem we actually address is SI. This problem takes two strings of length n and a permutation group G of degree n (the “ambient group”) as input (G is given by a list of generators) and asks whether or not one of the strings can be transformed into the other by some element of G. Luks’s divide-and-conquer algorithm for SI proceeds by recursion on the ambient group. We build on Luks’s framework and attack the obstructions to efficient Luks recurrence via an interplay between local and global symmetry. We construct group theoretic “local certificates” to certify the presence or absence of local symmetry, aggregate the negative certificates to canonical k-ary relations where k = O(log n), and employ combinatorial canonical partitioning techniques to split the k-ary relational structure for efficient divide-and- conquer. We show that in a well–defined sense, Johnson graphs are the only obstructions to effective canonical partitioning. The central element of the algorithm is the “local certificates” routine which is based on a new group theoretic result, the “Unaffected stabilizers lemma,” that allows us to construct global automorphisms out of local information.read more
Citations
More filters
Journal ArticleDOI
Quantification of network structural dissimilarities
Tiago A. Schieber,Laura C. Carpi,Albert Díaz-Guilera,Panos M. Pardalos,Cristina Masoller,Martín Gómez Ravetti,Martín Gómez Ravetti +6 more
TL;DR: The measure proposed here can identify and quantify structural topological differences that have a practical impact on the information flow through the network, such as the presence or absence of critical links that connect or disconnect connected components.
Journal Article
The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes
TL;DR: A weeklong course in quantum complexity theory was held at the Bellairs Research Institute in Barbados, February 21-25, 2016 as discussed by the authors, with a focus on quantum circuit complexity.
Posted Content
A Survey on The Expressive Power of Graph Neural Networks
TL;DR: This survey provides a comprehensive overview of the expressive power of GNNs and provably powerful variants ofGNNs.
Journal ArticleDOI
Persistence homology of networks: methods and applications
TL;DR: A conceptual review of key advancements in this area of using persistent homology on complex network science, focusing on recent approaches that get significant attention in the mathematics and data mining communities working on network data.
Posted Content
Anonymous Walk Embeddings
Sergey Ivanov,Evgeny Burnaev +1 more
TL;DR: This work coherently proposes an approach for embedding entire graphs and shows that the authors' feature representations with SVM classifier increase classification accuracy of CNN algorithms and traditional graph kernels.
References
More filters
Book
The Subgroup Structure of the Finite Classical Groups
TL;DR: In this article, a unified treatment of the theory of geometric subgroups of the classical groups, introduced by Aschbacher, is presented, and the questions of maximality and conjugacy of these groups are answered.
Journal ArticleDOI
Finite permutation groups and finite simple groups
TL;DR: In this paper, the authors consider the theory of finite permutation groups with the assumption that the finite simple groups are known, and examine questions such as: which problems are solved or solvable under this assumption, and what important problems remain?
Proceedings ArticleDOI
Canonical labeling of graphs
László Babai,Eugene M. Luks +1 more
TL;DR: An algebraic approach to the problem of assigning canonical forms to graphs by computing canonical forms and the associated canonical labelings in polynomial time is announced.
Journal ArticleDOI
On the O'Nan-Scott theorem for finite primitive permutation groups
TL;DR: In this paper, a self-contained proof of O'Nan-Scott Theorem for finite primitive permutation groups is given, and the proof is shown to be self-sufficient.