Automorphisms of fine 1-curve graph linked to surface homeomorphisms.
problem Understanding automorphisms of fine 1-curve graphs.
method Isomorphic mapping to surface homeomorphisms.
result Automorphism group is isomorphic to homeomorphism group of a surface.
Study on homeomorphisms preserving C1 curves on surfaces.
problem Characterizing homeomorphisms that preserve C1 curves. method Local conditions on induced map on projective tangent bundle.
result Characterization of Homeo1(S) for most closed surfaces. We show that on any Riemannian surface for each 0<c<∞ there exists an immersed C1,1 curve that is smooth and with curvature equal to ±c away from a point. We give examples showing that, in general, the regularity of the curve obtained by our procedure cannot be improved.
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.
It is proved that the suspension of a closed n-dimensional manifold M, n≥1, does not embed in a product of n+1 curves. In fact, the ultimate result will be proved in a much more general setting. This is a far-reaching generalization the Borsuk theorem on non-embeddability of the (n+1)-dimensional sphere in a produc…
Automorphisms of fine graphs for surfaces and tori are studied.
problem Understanding automorphisms of fine graphs for surfaces and tori.
method Extending previous results to tori and discussing smooth versions.
result Automorphism groups of fine graphs for surfaces and tori are naturally isomorphic to homeomorphism groups.
The fine curve graph is hyperbolic and contains all countable graphs as induced subgraphs.
problem Characterizing the structure and properties of fine curve graphs.
method Analyzing the hyperbolicity and induced subgraph properties of fine curve graphs and their direct limits.
result The finitary curve graph has diameter 2, contains every countable graph as an induced subgraph, and has the homeomorphism group of the surface as its automorphism group.
Automorphisms of fine curve graphs match surface homeomorphisms for planar surfaces.
problem Understanding automorphisms of fine curve graphs on surfaces.
method Analyzing vertices and edges of fine curve graphs to match with surface homeomorphisms.
result Automorphism group of fine curve graphs is naturally isomorphic to the homeomorphism group of boundaryless planar surfaces with at least 7 punctures.
Automorphisms of fine curve graph match surface homeomorphisms.
problem Understanding automorphisms of curve graphs for surfaces.
method Building on previous work, proving isomorphism to surface homeomorphisms.
result The group of automorphisms of the fine curve graph is isomorphic to the extended mapping class group of the surface.
The paper studies the connectedness of a graph's boundary for surfaces.
problem Understanding the topology of the Gromov boundary of fine curve graphs for surfaces.
method Proved a bounded geodesic image theorem, used to show linear connectivity of the Gromov boundary.
result The Gromov boundary of fine curve graphs for surfaces is linearly connected.
Automorphism group of nonorientable surface curve graph matches surface homeomorphisms.
problem Identifying automorphisms of nonorientable surface curve graphs.
method Using Bowden, Hensel, and Webb's fine curve graph and Long, Margalit, Pham, Verberne, and Yao's proof as a foundation.
result Automorphism group of nonorientable surface curve graph is isomorphic to the surface's homeomorphism group.
Characterizes geometric actions on graphs with flexible stabilizers.
problem Understanding geometric actions on flexible stabilizers.
method Defining generalized fine actions and proving relative quasi-convexity criteria.
result Characterizes Bowditch boundary points in relatively geometric actions.
The study proves conditions for hyperbolic isometries on fine curve graphs of higher genus surfaces.
problem Conditions for hyperbolic isometries on fine curve graphs of higher genus surfaces.
method Proves equivalence of conditions involving isotopic maps, pseudo-Anosov maps, and ergodic rotation sets.
result Ergodic homological rotation sets have nonempty interior for certain isotopic maps.
Stable cylinders found in hyperbolic groups and curve graphs.
problem Torsionfree hyperbolic groups and curve graphs of surfaces have globally stable cylinders.
method Generalised Sageev's construction to improve fine properties of hyperbolic spaces.
result Proved curve graphs of surfaces admit equivariant quasi-isometric embeddings in finite products of quasitrees.
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.
We establish the splitting lemmas (or generalized Morse lemmas) for the energy functionals of Finsler metrics on the natural Hilbert manifolds of H1-curves around a critical point or a critical R1 orbit of a Finsler isometry invariant closed geodesic. They are the desired generalization on Finsler manifolds of t…
Study the Gromov boundary of fine curve graph for surface homeomorphisms.
problem Understanding the boundary of fine curve graph for surface homeomorphisms.
method Examined the Gromov boundary and local topology near specific foliations and laminations.
result Found elements with positive stable commutator length and proved a Tits alternative.
Classification of torus homeomorphisms on fine curve graph completed.
problem Classifying actions of torus homeomorphisms on fine curve graph.
method Proof involving slow rotation sets for torus homeomorphisms.
result Actions of torus homeomorphisms on fine curve graph classified.
Abstract: Proves generic torus diffeomorphisms act parabolically and non-properly on fine curve graph and have generalized rotation sets.
problem Generic torus diffeomorphisms on fine curve graph.
method Proves generic torus diffeomorphisms act parabolically and non-properly on fine curve graph.
result Generic torus diffeomorphisms have generalized rotation sets of any point-symmetric compact convex homothety type.
Study automorphisms of smooth curve graphs on surfaces.
problem Understanding automorphisms of fine curve graphs.
method Examined automorphisms of continuously differentiable curves on surfaces.
result Automorphisms on surfaces of genus ≥ 2 are induced by homeomorphisms.
We prove that any cyclic quadrilateral can be inscribed in any closed convex C1-curve. The smoothness condition is not required if the quadrilateral is a rectangle.
Fine-tunes GNNs by preserving generative patterns to improve transferability.
problem Vanilla fine-tuning fails due to structural divergence between pre-training and downstream graphs.
method G-Tuning, which reconstructs the generative patterns of the downstream graph using graphon bases.
result G-Tuning achieves an average improvement of 0.5% and 2.6% on in-domain and out-of-domain transfer learning experiments.
New framework learns labels at both bag and graph levels.
problem Learning multi-label classifiers from multi-graph bags.
method Designing scoring functions and rank-loss objective for graph and bag levels; developing sub-gradient descent algorithm.
result Superior performance over state-of-the-art algorithms.
Curves in Lagrange Grassmannians naturally appear when one studies intrinsically "the Jacobi equations for extremals", associated with control systems and geometric structures. In this way one reduces the problem of construction of the curvature-type invariants for these objects to the much more concrete problem of fin…
Learning image representations to capture fine-grained semantics has been a challenging and important task enabling many applications such as image search and clustering. In this paper, we present Graph-Regularized Image Semantic Embedding (Graph-RISE), a large-scale neural graph learning framework that allows us to tr…
New model generates larger molecules more effectively.
problem Previous graph generation techniques struggle with larger molecules.
method Hierarchical graph encoder-decoder using structural motifs.
result Model significantly outperforms previous baselines on molecule generation tasks.
We prove the shifting theorems of the critical groups of critical points and critical orbits for the energy functionals of Finsler metrics on Hilbert manifolds of H1-curves, and two splitting lemmas for the functionals on Banach manifolds of C1-curves. Two results on critical groups of iterated closed geodesics a…
A new neural network model for molecular graphs that learns efficiently and accurately.
problem Learning on molecular graphs with cycles and complex structures.
method Hierarchical inter-message passing using raw graph and junction tree representations.
result The model outperforms classical GNNs in detecting cycles and is efficient to train.
Study homeomorphisms on fine curve graph of surfaces, revealing new types of dynamics.
problem Understanding dynamics of homeomorphisms on fine curve graphs of surfaces.
method Analyzing the action of homeomorphisms on the fine curve graph and relating to classical curve graphs.
result Homeomorphisms induce parabolic isometries, and all positive reals are realized as asymptotic translation lengths.
We prove that, given ∣H∣<1, a generic simple closed curve embedded in the asymptotic boundary of H3 (with respect to the supremum metric) bounds more than one complete surface embedded in H3 which has constant mean curvature H. We remark that this is not true for the space of simple closed $…
The paper proposes DEA to make graph neural networks fairer in link prediction.
problem Graph neural networks can unfairly prioritize certain social groups in link prediction.
method Drop Edges and Adapt (DEA) fine-tuning strategy with covariance constraints.
result DEA improves fairness and accuracy in link prediction tasks.
The dominant graph neural networks (GNNs) over-rely on the graph links, several serious performance problems with which have been witnessed already, e.g., suspended animation problem and over-smoothing problem. What's more, the inherently inter-connected nature precludes parallelization within the graph, which becomes …
Mcduff had proposed in 1997 a way to modify the definition of Taubes' version of Gromov invariant when multiple coverings of -1 curves appear. In this paper we generalize Mcduff's proposal to the family case, as is needed in the discussion of family Seiberg-Witten theory. For simplicity, the discussion has been formula…
PSimGNN partitions graphs into subgraphs for efficient graph similarity computation.
problem Efficiently compute graph similarity scores for large graphs.
method Graph partitioning followed by subgraph-level and node-level comparisons using a graph neural network.
result PSimGNN outperforms state-of-the-art methods in graph similarity computation tasks.
Study on stable translation lengths of surface homeomorphisms and their approximations.
problem Understanding stable translation lengths of homeomorphisms and their finite approximations.
method Comparing stable translation lengths of homeomorphisms and their finite approximations on curve graphs.
result Stable translation length of homeomorphisms with dense periodic points equals the supremum of their approximations.
The ropelength of a knot is the quotient of its length and its thickness, the radius of the largest embedded normal tube around the knot. We prove existence and regularity for ropelength minimizers in any knot or link type; these are C1,1 curves, but need not be smoother. We improve the lower bound for the ropelen…
We give the details of the proof of the equality between the critical groups, with respect the H^1 and C^1 topology, at a non-degenerate critical point of the energy functional of a non-reversible Finsler manifold (M,F), defined on the Hilbert manifold of the H^1 curves connecting two given points on M.
ADSAGE detects anomalies in graph edge sequences for insider threat detection.
problem Detecting insider threats in fine-grained audit logs using graph and text features.
method Anomaly detection at edge level, supporting numeric, categorical, and text attributes.
result ADSAGE detects anomalies in authentications and email communications effectively.
Wikipedia is a huge opportunity for machine learning, being the largest semi-structured base of knowledge available. Because of this, many works examine its contents, and focus on structuring it in order to make it usable in learning tasks, for example by classifying it into an ontology. Beyond its textual contents, Wi…
PanRep learns universal node embeddings for heterogeneous graphs.
problem Learning universal node embeddings for heterogeneous graphs.
method Graph Neural Network (GNN) model with four decoders capturing different properties.
result PanRep outperforms unsupervised and supervised methods in node classification and link prediction.
Heterogeneous GNN improves species distribution modeling.
problem Predicting species occurrences and habitat suitability using environmental factors.
method Graph Neural Networks (GNN) for presence-only species distribution modeling.
result Heterogeneous GNN model outperforms single-species SDMs and baseline models.
Any sequence of properly embedded minimal disks in an open subset U of Euclidean 3-space has a subsequence such that the curvatures blow up on a relatively closed subset K of U and such that the disks converge in the complement of K to a minimal lamination of U\K. Assuming results of Colding-Minicozzi and an extension …
Steinhaus conjectured that every closed oriented C1-curve has a pair of anti-parallel tangents. Porter disproved the conjecture by showing that there exist curves with no anti-parallel tangents. Colin Adams rised the question of whether there exists a nontrivial knot in R3 which has no parallel or antiparallel t…
We construct Colding-Minicozzi limit minimal laminations in open domains in $\rth$ with the singular set of C1-convergence being any properly embedded C1,1-curve. By Meeks' C1,1-regularity theorem, the singular set of convergence of a Colding-Minicozzi limit minimal lamination L is a locally finit…
We first study the degeneration of a sequence of Hermitian-Yang-Mills metrics with respect to a sequence of balanced metrics on a Calabi-Yau threefold X^ that degenerates to the balanced metric constructed by Fu, Li, and Yau on the complement of finitely many (-1,-1)-curves in X^. Then under some assumpti…
A new method generates graphs with hierarchical structures.
problem Generating graphs with natural hierarchical structures.
method Recursively generates community structures at multiple resolutions, parallel generation of all sub-structures.
result Improves generative performance on multiple graph datasets.
SGQuant reduces GNN memory usage without significant accuracy loss.
problem High memory consumption in GNNs limits their applicability on memory-constrained devices.
method Proposes a specialized GNN quantization scheme (SGQuant) with a quantization algorithm, fine-tuning scheme, and multi-granularity strategy.
result SGQuant reduces GNN memory footprint from 4.25x to 31.9x with minimal accuracy loss.
Extends graph similarity theory to improve MPNNs' generalization abilities.
problem Understanding MPNNs' generalization beyond training data.
method Extends graph similarity theory, assesses graph structure, aggregation, and loss functions.
result Improves understanding of MPNNs' generalization properties.