IsoNN learns graph representations without node order constraints.
problem Lack of interpretability and erratic performance in graph classification due to node-orderless property.
method IsoNN uses graph matching with subgraph templates to learn isomorphic features and break node-order.
result IsoNN achieves superior performance on graph classification tasks compared to existing methods.
Graph Laplacian spectrum serves as a robust feature representation.
problem Difficulties in analyzing and comparing graphs due to their structure.
method Proposes using the graph Laplacian spectrum (GLS) as a feature representation.
result Graph Laplacian spectrum (GLS) preserves structural information and is consistent under deformation and invariance under isomorphism.
Adding random features to GNNs improves their performance.
problem Limitations of GNNs in distinguishing graphs and learning efficient algorithms.
method Adding random features to each node in GNNs.
result Random features enable GNNs to learn optimal algorithms for graph problems.
GRNF embeds graphs into vectors preserving distances.
problem Representing graph data in a vector space while preserving distances.
method Graph Random Neural Features (GRNF) using graph neural networks.
result GRNF preserves graph metric structure and distances.
Graph data sets often contain isomorphism bias, artificially inflating model performance.
problem Isomorphism bias in graph data sets causing inflated model performance.
method Analysis of 54 graph data sets, recommendations for model setup, open sourcing new data sets.
result Graph data sets commonly contain isomorphism bias, artificially inflating model performance.
An algorithm preserves topological features in dimensionality reduction.
problem Preserving topological features in dimensionality reduction.
method Simulated annealing for finding a linear projection preserving persistent homology.
result Measures of topological equivalence between filtrations.
We study positive definite quaternionic contact (4n+3)-manifolds (qc-manifold for short). Just like the CR-structure contains the class of Sasaki manifolds, the qc-structure admits a class of 3-Sasaki manifolds with integrable distribution isomorphic to su(2). A big difference concerning the inte…
Graph neural networks struggle to distinguish certain graph structures.
problem Difficulty in distinguishing graphs with graph neural networks.
method Analysis of communication capacity in message-passing model of graph neural networks.
result Capacity of MPNN needs to grow linearly for trees and quadratically for general connected graphs.
This paper explores different graph neural network functions to improve graph isomorphism.
problem Lack of robust implementation for graph neural networks due to limited analysis of underlying functions.
method Examines various alternative functions for different modules in GNNs using benchmark datasets.
result Generally used underlying techniques do not always capture the overall graph structure.
A faster graph kernel using optical random features.
problem High computation cost of graphlet kernel due to isomorphism test.
method Kernel random features, optical random features, mean kernel metric.
result The proposed method is orders of magnitude faster with similar or better accuracy.
QSAR models struggle to predict activity cliffs, but graph isomorphism features improve AC-sensitivity.
problem QSAR models struggle to predict activity cliffs (ACs).
method Nine distinct QSAR models combining molecular representation methods and regression techniques.
result Graph isomorphism features improve AC-sensitivity.
GNNs with random node initialization are shown to be universally expressive.
problem Limitations of standard GNNs in distinguishing graphs.
method Random node initialization (RNI) to enhance GNNs' expressive power.
result GNNs with RNI are proven to be universally expressive.
A hierarchy of GNNs based on learnable local features is proposed.
problem Limited understanding of GNN architectures and their systematic construction.
method A hierarchy of GNNs based on aggregation regions is derived, and theoretical results are provided.
result Simple GNN architecture exceeds Weisfeiler-Lehman graph isomorphism test.
This study compares GNNs and GA-MLPs, finding GA-MLPs can distinguish graphs but not count walks.
problem Comparing expressive power and graph isomorphism testing capabilities of GNNs and GA-MLPs.
method GA-MLPs augment node features with multi-hop operators and apply MLPs node-wise; GNNs are compared as a baseline.
result GA-MLPs can distinguish almost all non-isomorphic graphs but cannot count attributed walks, unlike GNNs.
This study shows how social insects and machine learning methods share a common mathematical framework.
problem Understanding how decentralized systems achieve optimal decision-making.
method Developed a rigorous mathematical framework to show isomorphism between ant colonies and ensemble machine learning.
result Demonstrated that ant colony decision-making and random forest learning implement identical variance reduction strategies through decorrelation of identical units.
Can neural networks learn to compare graphs without feature engineering? In this paper, we show that it is possible to learn representations for graph similarity with neither domain knowledge nor supervision (i.e.\ feature engineering or labeled graphs). We propose Deep Divergence Graph Kernels, an unsupervised method …
Isomorphic cosymplectomorphism groups imply diffeomorphic manifolds.
problem Determining when cosymplectic manifolds are diffeomorphic based on their cosymplectomorphism groups.
method Characterized Reeb flow, used to descend isomorphism to symplectic base manifolds, preserved monodromy class ensuring bundle equivalence.
result Isomorphic cosymplectomorphism groups imply diffeomorphic manifolds.
Proves a Thom isomorphism for foliated differential forms.
problem Transverse Lie algebra actions on foliated manifolds and vector bundles.
method Thom isomorphism theorem for differential forms in foliated settings.
result Established a new Thom isomorphism theorem.
The study explores rigidity in groups and their products, finding uncountable families of non-isomorphic subgroups.
problem Rigidity in groups and their direct products.
method Constructing Grothendieck pairs and exploiting relative hyperbolicity.
result Uncountable families of non-isomorphic subgroups Pλ in GimesG. New knot quandles distinguish ribbon knots with isomorphic groups.
problem Distinguishing knots with isomorphic fundamental groups.
method Examined knot quandles of Suciu's ribbon knots and computed their types.
result Knot quandles of Suciu's ribbon knots are mutually non-isomorphic.
Geometric duality connects graph isomorphism and knot equivalence.
problem Understanding the equivalence of graph isomorphism and knot equivalence.
method Observation of geometric duality in planar graphs and links.
result The equivalence relation defined by isomorphisms of checkerboard graphs is the same as 2-isomorphisms of checkerboard graphs.
A new GNN model SPIN achieves state-of-the-art performance on diverse real-world datasets.
problem Graph classification efficiency and accuracy.
method Parallel neighborhood aggregations (PA-GNNs) and SPIN model.
result SPIN model achieves state-of-the-art performance on diverse real-world datasets.
In this paper, we introduce the notion of Reidemeister torsion for quasi-isomorphisms of based chain complexes over a field. We call a chain map a quasi-isomorphism if its induced homomorphism between homology is an isomorphism. Our notion of torsion generalizes the torsion of acyclic based chain complexes, and is a ch…
The paper explores isomorphisms on isoparametric hypersurfaces in spheres, leading to new geometric structures.
problem Investigating isomorphisms between principal distributions on isoparametric hypersurfaces.
method Constructing vector bundle isomorphisms and nearly Kähler structures.
result Explicit construction of a global vector bundle isomorphism for all odd multiplicities.
We construct examples of knots that have isomorphic nth-order Alexander modules, but non-isomorphic nth-order linking forms, showing that the linking forms provide more information than the modules alone. This generalizes work of Trotter, who found examples of knots that have isomorphic classical Alexander modules, but…
Proves regularity of isomorphisms between hyperbolic 3-manifolds.
problem Understanding the regularity of isomorphisms between hyperbolic 3-manifolds.
method Strengthened a previous result by proving regularity in the sense of Boileau and Friedl.
result Profinite isomorphisms of hyperbolic 3-manifolds are regular.
We classify connected Lie groups which are locally isomorphic to generalized Heisenberg groups. For a given generalized Heisenberg group N, there is a one-to-one correspondence between the set of isomorphism classes of connected Lie groups which are locally isomorphic to N and a union of certain quotients of noncom…
Non-isomorphic groups with similar profinite completions found.
problem Finding non-isomorphic groups with similar profinite completions.
method Exhibited infinitely many pairs of non-isomorphic groups with specific properties.
result Groups with Property FA and non-trivial actions on trees have isomorphic profinite completions.
Paper tackles NP-complete subgraph isomorphism counting problem.
problem Counting subgraph isomorphisms in large graphs.
method Learning framework that augments representation learning architectures and iteratively attends pattern and target graphs.
result Scalable learning approach counts subgraph isomorphisms in linear time.
Paper solves isomorphism problem for specific Baumslag-Solitar groups.
problem Isomorphism problem for small rose non-ascending generalized Baumslag-Solitar groups.
method Analyzed group actions on trees with specific stabilizers.
result Isomorphism problem solvable for the specified groups.
We consider the notion of stable isomorphism of bundle gerbes. It has the consequence that the stable isomorphism classes of bundle gerbes over a manifold M are in bijective correspondence with H^3(M, Z). Stable isomorphism sheds light on the local theory of bundle gerbes and enables us to develop a classifying theory …
New benchmarks improve model performance by accounting for isomorphism classes in multi-relational datasets.
problem Synthetic multi-relational datasets lack isomorphism class awareness, leading to overestimation of model performance.
method Proposed isomorphism-aware synthetic benchmarks and a prioritisation scheme to improve model performance and stability.
result Isomorphism classes can be utilised to improve model performance, stability during training, and reduce training time.
This is the fourth of five papers that construct an isomorphism between the Seiberg-Witten Floer homology and the Heegaard Floer homology of a given compact, oriented 3-manifold. The isomorphism is given as a composition of three isomorphisms; the first of these relates a version of embedded contact homology on an an a…
Efficiently matches subgraphs in noisy data without node labels.
problem Subgraph isomorphism in noisy, real-valued graphs.
method Two-step approach: extract topology, then expand matches.
result Realistically sub-linear computational efficiency, robustness to noise.
Undecidability proved for DG algebras problems.
problem Stable isomorphism, quasi-isomorphism, and Morita equivalence problems for semifree DG algebras.
method Essentially autonomous solutions by Gemini Deep Think and Aletheia.
result Proved undecidability of problems for semifree DG algebras.
The twistor construction for Riemannian manifolds is extended to the case of manifolds endowed with generalized metrics (in the sense of generalized geometry à la Hitchin). The generalized twistor space associated to such a manifold is defined as the bundle of generalized complex structures on the tangent spaces of the…
A subgroup of a Kac-Moody group is called bounded if it is contained in the intersection of two finite type parabolic subgroups of opposite signs. In this paper, we study the isomorphisms between Kac-Moody groups over arbitrary fields of cardinality at least 4, which preserve the set of bounded subgroups. We show that …
DHGAK aligns substructures for better graph kernel performance.
problem Limited performance of traditional graph kernels due to missing substructure similarities.
method Hierarchically aligns relational substructures in deep embedding space, assigning same feature maps in RKHS.
result DHGAK outperforms state-of-the-art graph kernels on various benchmarks.
The paper disproves a conjecture about isomorphic subgroups in finite groups.
problem The existence of non-isomorphic subgroups that are isomorphic in extensions of finite groups.
method Constructing extensions of finite groups to show non-isomorphic pre-images of subgroups.
result Subgroups of finite groups that are isomorphic in extensions are not conjugate.
Jet isomorphism theorems for conformal geometry are discussed. A new proof of the jet isomorphism theorem for odd-dimensional conformal geometry is outlined, using an ambient realization of the conformal deformation complex. An infinite order ambient lift for conformal densities in the case in which harmonic extension …
Unique vertical isomorphisms between Fedosov dg manifolds are proven for Lie pairs.
problem Vertical isomorphisms of Fedosov dg manifolds associated with Lie pairs.
method Construction of Fedosov dg manifolds via splitting and connection, proving unique isomorphisms using iteration formula.
result Existence and uniqueness of vertical isomorphisms between Fedosov dg manifolds.
Proves regularity of isomorphisms between hyperbolic 3-manifolds.
problem Regularity of isomorphisms between cusped hyperbolic 3-manifolds.
method Proves regularity of profinite completions of fundamental groups.
result Proves A-polynomial is a profinite invariant. If M is a riemannian manifold, then the inclusion of the complex of coclosed harmonic forms into the de Rham complex induces a linear isomorphism in cohomology. If M has at most countably many connected components, this linear isomorphism is a Frechet isomorphism.
Projective manifolds with specific bundles are isomorphic to simpler spaces.
problem Characterizing projective manifolds with tangent bundles containing strictly nef subsheaves.
method Analyzing the structure of the tangent bundle and using properties of strictly nef subsheaves.
result Projective manifolds with the described bundles are isomorphic to projective bundles over hyperbolic manifolds or projective spaces.
We show that totally real elliptic Lefschetz fibrations that admit a real section are classified by their "real loci" which is nothing but an S1-valued Morse function on the real part of the total space. We assign to each such real locus a certain combinatorial object that we call a \emph{necklace diagram}. On the o…
The paper characterizes generalized Alexander quandles and counts them up to 127.
problem Classifying isomorphism classes of generalized Alexander quandles.
method Characterization through underlying groups and automorphisms, computation of counts.
result Computed the number of generalized Alexander quandles up to 127.
Survey on proof of homology isomorphism between two complex theories.
problem Proof of isomorphism between Heegaard Floer homology and embedded contact homology.
method Survey of proof methods from multiple papers.
result Established isomorphism between Heegaard Floer homology and embedded contact homology.
Homologies of Jones and partition algebras match cyclic and symmetric groups.
problem Matching homologies of specific algebras to cyclic and symmetric groups.
method Proving isomorphisms between algebras' homologies and group homologies.
result Homologies of Jones and partition algebras are isomorphic to cyclic and symmetric groups.