The paper classifies dense conjugacy classes in mapping class groups of locally finite graphs.
problem Identifying which mapping class groups have dense conjugacy classes.
method Developed flux homomorphisms and combinatorial criteria for stability.
result A complete classification for self-similar locally finite graphs and a criterion for stability.
Few-shot graph classification on graphs with limited labeled examples.
problem Limited labeled data for graph classification.
method Graph spectral measures to cluster graphs into super-classes, then use GNNs.
result Improved classification performance on few-shot graph classification tasks.
The paper explores non-amenability in infinite-type surfaces and graphs.
problem Determining non-amenability in mapping class groups of infinite-type surfaces and graphs.
method Analyzes mapping class groups of infinite-type surfaces and graphs, provides examples and exhibits classes of groups.
result Completely determines non-amenability of mapping class groups of infinite-type surfaces and graphs.
Proposes OCGNN for detecting anomalies in graph data.
problem Detecting anomalies in graph-structured data.
method One Class Graph Neural Network (OCGNN) combining Graph Neural Networks and one-class classification.
result Significant improvements in anomaly detection compared to baselines.
Adaptive-Step Graph Meta-Learner tackles few-shot graph classification with limited labeled data.
problem Few labeled graph data in bioinformatics and other applications.
method A novel framework combining a graph meta-learner and a step controller for robust and generalization.
result State-of-the-art results on several few-shot graph classification tasks.
Study of mapping class groups of infinite graphs, focusing on their finiteness and commensurability.
problem Understanding the finiteness properties and commensurability of mapping class groups of infinite graphs.
method Investigation of asymptotically rigid mapping class groups, construction of explicit presentations, and analysis of algebraic and geometric properties.
result Graph Houghton groups are not commensurable with other known Houghton-type groups, defining a new class of groups.
The paper shows that relaxing assumptions about causal graphs can lead to exponentially large equivalence classes.
problem The size of Markov equivalence classes under relaxed assumptions.
method Analytical proofs for three settings: sparse random directed acyclic graphs, uniformly random acyclic directed mixed graphs, and uniformly random directed cyclic graphs.
result Exponentially large lower bounds for the expected size of Markov equivalence classes.
Graphs on surfaces have a 2-dimensional large scale structure.
problem Understanding the large scale structure of graphs on surfaces.
method Proving asymptotic dimension for specific graph classes and surfaces.
result Graphs on surfaces have an asymptotic dimension of 2.
The sizes of Markov equivalence classes of directed acyclic graphs play important roles in measuring the uncertainty and complexity in causal learning. A Markov equivalence class can be represented by an essential graph and its undirected subgraphs determine the size of the class. In this paper, we develop a method to …
ZSL-KG learns class representations from common sense knowledge graphs.
problem Predicting classes without labeled examples using semantic class representations.
method TrGCN, a novel transformer graph convolutional network, embeds nodes from common sense knowledge graphs in a vector space.
result ZSL-KG improves over existing methods on five out of six zero-shot benchmark datasets.
In the present paper we construct a one-to-one correspondence between the set of graph-knots and the set of homotopy classes of looped graphs. Moreover, the graph-knot and the homotopy class constructed from a given knot are related with this correspondence. This correspondence is given by a simple formula.
Study of mapping class groups on infinite graphs, focusing on their large-scale geometry.
problem Understanding the large-scale geometry of mapping class groups on infinite graphs.
method Using coarse geometry techniques, classify coarsely bounded groups and compute asymptotic dimension.
result Identify conditions for global and local coarsely bounded pure mapping class groups of infinite rank graphs.
Parabolic mapping class acts on curve graphs of infinite type surfaces.
problem Understanding parabolic isometries on curve graphs of infinite type surfaces.
method Fine curve graph tools to prove existence of parabolic isometries.
result Existence of parabolic isometries on graphs of curves of infinite type surfaces.
Spatial graphs study tangle replacement with equivalence classes.
problem Differentiating spatial graphs and their properties.
method Tangle replacement on spatial graphs, focusing on handcuff graphs.
result One-to-one correspondence between neighborhood equivalence classes and tangles.
Study shows pants graph automorphisms match mapping class groups of nonorientable surfaces.
problem Understanding automorphisms of pants graphs on nonorientable surfaces.
method Analyzing mapping class groups and proving isomorphism.
result Automorphism group of pants graphs isomorphic to mapping class groups.
Study proves hyperfiniteness of mapping class group actions on surface graphs.
problem Hyperfiniteness of mapping class group actions on surface graphs.
method Infinite unicorn paths and Gromov boundaries of arc and curve graphs.
result Proves hyperfiniteness of orbit equivalence relations induced by mapping class group actions.
On one hand, we study the class of graphs on surfaces, satisfying tessellation properties, with positive Forman curvature on each edge. Via medial graphs, we provide a new proof for the finiteness of the class, and give a complete classification. On the other hand, we classify the class of graphs on surfaces with posit…
Study shows surfaces without certain curves have infinite orbit graph.
problem Characterizing surfaces with specific curve properties.
method Utilized tools from mapping class group geometry.
result Infinite-invariance index 1 surfaces lack good curve graphs.
New findings on hyperbolicity of fine curve graphs and their subgraphs.
problem Investigating hyperbolicity of fine curve graphs and their subgraphs.
method Analyzing large subgraphs of fine curve graphs and computing distances in specific cases.
result Large subgraphs of fine curve graphs contain flats of every finite dimension, indicating they are not hyperbolic.
Study of flip graphs and their automorphism groups for infinite-type surfaces.
problem Understanding automorphism groups of flip graphs for infinite-type surfaces.
method Examined the relationship between mapping class groups and flip graphs for infinite-type surfaces.
result Extended mapping class groups are isomorphic to proper subgroups of automorphism groups of flip graphs.
Study of graphs from hexagon decompositions of surfaces.
problem Understanding geometric properties of hexagon decompositions.
method Define and analyze graphs associated with hexagon decompositions of surfaces.
result Quasi-isometric relationships between studied graphs and known groups.
Paper tackles graph class-incremental learning with task profiling and prompting.
problem Challenges in separating classes from different tasks in graph CIL.
method Laplacian smoothing-based task profiling and graph prompting approach.
result 100% task ID prediction accuracy and significant performance improvement.
In this paper, we study classes of graphs with three types of edges that capture the modified independence structure of a directed acyclic graph (DAG) after marginalisation over unobserved variables and conditioning on selection variables using the m-separation criterion. These include MC, summary, and ancestral grap…
New method uses graph generative models for graph classification.
problem Graph classification for non-relational i.i.d. data.
method Derive classification formulas from GGM, train generative graph auto-encoder model.
result New conditional ELBO for training graph auto-encoder model.
New invariant links graph structure to tropical curve properties.
problem Understanding graph and curve minor structures.
method Defined Ceresa-Zharkov class for graphs, related to tropical curves.
result Ceresa-Zharkov class is zero for hyperelliptic graphs.
Paper explores non-uniqueness and uniqueness class for wave equations on graphs.
problem Non-uniqueness of solutions to wave equations on infinite graphs.
method Analyticity of solutions in the uniqueness class, extension to a wide class of linear evolution equations.
result Sharp uniqueness class for solutions of wave equations on graphs.
Study of pure mapping class groups on infinite graphs.
problem Classifying graphs with specific mapping class groups.
method Completely classified graphs with pure mapping class groups.
result Established semidirect product decomposition and computed first integral cohomology.
Generalized zero-shot learning (GZSL) tackles the problem of learning to classify instances involving both seen classes and unseen ones. The key issue is how to effectively transfer the model learned from seen classes to unseen classes. Existing works in GZSL usually assume that some prior information about unseen clas…
The curve graph and related graphs are hyperbolic and have quasi-tree fibers.
problem Understanding the structure of the curve graph and related graphs.
method Analyzing a sequence of graphs with Lipschitz maps and proving hyperbolicity and quasi-tree properties.
result The graphs in the sequence are hyperbolic and have quasi-tree fibers, leading to bounds on asymptotic dimension and acylindrical actions.
New graph types help identify complex relationships.
problem Understanding complex relationships in data.
method Introducing separable and essentially separable graphs to characterize and identify graphical models.
result Developed algorithms to identify equivalence classes of essentially separable graphs.
Complex equivalence classes found in graph homotopy.
problem Complexity of proper homotopy equivalence in graphs.
method Demonstrated Borel completeness and comeager equivalence classes.
result Complex equivalence classes exist in infinite graphs.
In this paper, we deal with the problem of marginalization over and conditioning on two disjoint subsets of the node set of chain graphs (CGs) with the LWF Markov property. For this purpose, we define the class of chain mixed graphs (CMGs) with three types of edges and, for this class, provide a separation criterion un…
The ellipticity graph of a free group F was defined by I. Kapovich and M. Lustig in order to study the outer automorphism group of F, which acts on this graph. The graph was constructed to be analogous to the curve complex of a surface. It is a bipartite graph, whose vertices are conjugacy classes of nontrivial ele…
Graph attention improves node classification by distinguishing important edges.
problem Node classification in graph-based learning models.
method Theoretical analysis of graph attention networks for node classification.
result Graph attention can perfectly classify nodes in an 'easy' regime but fails in a 'hard' regime.
Bott and Taubes used integrals over configuration spaces to produce finite-type a.k.a. Vassiliev knot invariants. Cattaneo, Cotta-Ramusino and Longoni then used these methods together with graph cohomology to construct "Vassiliev classes" in the real cohomology of spaces of knots in higher-dimensional Euclidean spaces,…
Graph filtering reduces intra-class noise for improved classification accuracy.
problem Noise in training data affects classifier performance.
method Graph filtering to connect similar samples within a class.
result Asymptotic reduction of intra-class variance while maintaining mean.
Godin introduced the categories of open closed fat graphs Fatoc and admissible fat graphs Fatad as models of the mapping class group of open closed cobordism. We use the contractibility of the arc complex to give a new proof of Godin's result that Fatad is a model of the mapping class group of open-close…
The paper defines when surfaces are homotopy equivalent to graphs and explores their mapping class groups.
problem Understanding when surfaces are homotopy equivalent to graphs.
method Analyzes second-countable orientable surfaces with noncompact boundary.
result Defines a necessary and sufficient condition for surfaces to be homotopy equivalent to graphs.
We give a necessary and sufficient condition for the mapping class group of the pair of the 3-sphere and a graph embedded in it to be isomorphic to the topological symmetry group of the embedded graph.
Graph data augmentation improves GNN performance in node classification.
problem Improving generalizability of graph neural networks (GNNs) in semi-supervised node classification.
method Introduces GAug framework for graph data augmentation using neural edge predictors.
result GAug framework improves GNN-based node classification performance across various architectures and datasets.
We study signal recovery on graphs based on two sampling strategies: random sampling and experimentally designed sampling. We propose a new class of smooth graph signals, called approximately bandlimited, which generalizes the bandlimited class and is similar to the globally smooth class. We then propose two recovery s…
The study examines groups acting loxodromically on hyperbolic graph products.
problem Understanding groups acting loxodromically on hyperbolic graph products.
method Examined groups acting on finite products of hyperbolic graphs, focusing on loxodromic elements.
result Strong structure theorems for groups in this subclass, excluding mapping class groups of genus at least 3 and certain automorphism groups.
AdaCAD improves semi-supervised classification by focusing on intra-class nodes.
problem Improving semi-supervised classification by addressing inter-class connections in graphs.
method AdaCAD uses a class-attentive diffusion process to adaptively aggregate nodes based on their class similarity.
result AdaCAD significantly outperforms state-of-the-art methods in semi-supervised classification.
New simplicial complex for infinite-type surfaces shows graph properties.
problem Characterizing infinite-type surfaces using graph theory.
method Constructing grand arc graph and analyzing its properties.
result Grand arc graph is infinite-diameter and δ-hyperbolic under certain conditions.
We show that the Gromov boundary of the free factor graph for the free group Fn with n>2 generators is the space of equivalence classes of minimal very small indecomposable projective Fn-trees without point stabilizer containing a free factor equipped with a quotient topology. Here two such trees are equivalent if the …
Contradiction graphs reveal VC dimension threshold.
problem Determining VC dimension of concept classes.
method Study contradiction graphs of binary concept classes.
result Single contradiction graph Gm(H) determines VC dimension. The study examines when mapping class groups are quasi-isometric to graphs of curves.
problem When is the mapping class group of an infinite-type surface quasi-isometric to a graph of curves?
method Using the work of Rosendal, Mann, and Rafi, the study defines a necessary and sufficient condition called translatability for a mapping class group to be quasi-isometric to a graph of curves.
result The mapping class group of the plane minus a Cantor set is quasi-isometric to the loop graph defined by Bavard.
We investigate Legendrian graphs in (R3,ξstd). We extend the classical invariants, Thurston-Bennequin number and rotation number to Legendrian graphs. We prove that a graph can be Legendrian realized with all its cycles Legendrian unknots with tb=−1 and rot=0 if and only if it does not contain K4 as a mi…