Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,181 papers · 148 categories

Trend · papers per month

74149223297 · Jun 202019922001200920182026
48 results for splitting graph

New hyperbolic graph constructed from projections of free splitting graph.

problem Constructing a new hyperbolic graph from projections of free splitting graph.
method Using submanifold projections and geometric realization of free splitting graph.
result A new hyperbolic graph constructed for n3n\geq 3.

We show that the arc graph of Sg1S_g^1 is a coarse Lipschitz retract of the free splitting complex of F2gF_{2g}. We also show that the arc and curve graph of Sg1S_g^1 is a coarse Lipschitz retract of both the cyclic splitting graph of F2gF_{2g} and the maximally cyclic splitting graph of F2gF_{2g}.

2015-11-30abs ↗pdf ↗

We prove that any isometry of the graph of cyclic splittings of a finitely generated free group FNF_N of rank N3N\ge 3 is induced by an outer automorphism of FNF_N. The same statement also applies to the graphs of maximally-cyclic splittings, and of very small splittings.

2014-06-25abs ↗pdf ↗

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 …

2012-11-07abs ↗pdf ↗

We show that after one stabilization, a strongly irreducible Heegaard splitting of suitably large genus of a graph manifold is isotopic to an amalgamation along a modified version of the system of canonical tori in the JSJ decomposition. As a corollary, two strongly irreducible Heegaard splittings of a graph manifold o…

2006-04-05abs ↗pdf ↗

IMPaCT improves node classification in chronological split temporal graphs.

problem Domain adaptation challenges in graph data due to chronological splits.
method IMPaCT proposes a method to impose invariant properties based on realistic assumptions derived from temporal graph structures.
result IMPaCT achieves a 3.8% performance improvement over current SOTA method on the ogbn-mag graph dataset.

ES-MLP combines Graph-MLP with edge splitting for node classification on both homophilic and heterophilic graphs.

problem Node classification on graphs with mixed homophilic and heterophilic properties.
method Combines Graph-MLP with edge splitting mechanism from ES-GNN to learn two adjacency matrices based on relevant and irrelevant feature pairs.
result ES-MLP achieves performance comparable to homophilic and heterophilic models without using edges during inference.

The intersection pattern of the translates of the limit set of a quasi-convex subgroup of a hyperbolic group can be coded in a natural incidence graph, which suggests connections with the splittings of the ambient group. A similar incidence graph exists for any subgroup of a group. We show that the disconnectedness of …

2009-06-05abs ↗pdf ↗

Let M be a totally orientable graph manifold with characteristic submanifold T and let M = V cup_S W be a Heegaard splitting. We prove that S is standard. In particular, S is the amalgamation of strongly irreducible Heegaard splittings. The splitting surfaces S_i of these strongly irreducible Heegaard splittings have t…

2004-06-09abs ↗pdf ↗

Diagrammatic method characterizes non-split surfaces in 3-sphere.

problem Characterizing non-split compact surfaces in the 3-sphere.
method Using diagrams of spatial trivalent graphs with signs and Reidemeister moves.
result Two diagrams of embedded surfaces are related by Reidemeister moves if and only if the surfaces are ambient isotopic.

In geometric group theory one uses group actions on spaces to gain information about groups. One natural space to use is the Cayley graph of a group. The Cayley graph arguments that one encounters tend to require local finiteness, and hence finite generation of the group. In this paper, I take the theory of intersectio…

2011-05-27abs ↗pdf ↗

In this paper we study CAT(0) groups and their splittings as graphs of groups. For one-ended CAT(0) groups with isolated flats we prove a theorem characterizing exactly when the visual boundary is locally connected. This characterization depends on whether the group has a certain type of splitting over a virtually abel…

2017-05-02abs ↗pdf ↗

In this thesis we describe how to estimate the distance spanned in the pants graph by a train track splitting sequence on a surface, up to multiplicative and additive constants. If some moderate assumptions on a splitting sequence are satisfied, each vertex set of a train track in it will represent a vertex of a graph …

2016-09-30abs ↗pdf ↗

We show that under reasonable conditions, the spines of the handlebodies of a strongly irreducible Heegaard splitting will intersect a closed ball in a graph which is isotopic into the boundary of the ball. This is in some sense a generalization of the results by Scharlemann on how a strongly irreducible Heegaard split…

2004-11-03abs ↗pdf ↗

We study intrinsically linked graphs where we require that every embedding of the graph contains not just a non-split link, but a link that satisfies some additional property. Examples of properties we address in this paper are: a two component link with lk(A,L) = k2^r, k not 0, a non-split n-component link where all l…

2005-11-05abs ↗pdf ↗

Study on hyperbolic groups, focusing on separability and splittings.

problem Coarse separability and splittings in hyperbolic groups.
method Quantitative analysis of volume growth and cut-sets, focusing on thickened spheres.
result One-ended hyperbolic groups that are not virtually surface groups are coarsely separable by a subset of subexponential growth if and only if they split over a virtually cyclic subgroup.

We explore the combination theorem for a group G splitting as a graph of relatively hyperbolic groups. Using the fine graph approach to relative hyperbolicity, we find short proofs of the relative hyperbolicity of G under certain conditions. We then provide a criterion for the relative quasiconvexity of a subgroup H de…

2012-11-08abs ↗pdf ↗

We show that the subsurface projection of a train track splitting sequence is an unparameterized quasi-geodesic in the curve complex of the subsurface. For the proof we introduce induced tracks, efficient position, and wide curves. This result is an important step in the proof that the disk complex is Gromov hyperbolic…

2010-04-26abs ↗pdf ↗

We define integral measures of complexity for Heegaard splittings based on the graph dual to the curve complex and on the pants complex defined by Hatcher and Thurston. As the Heegaard splitting is stabilized, the sequence of complexities turns out to converge to a non-trivial limit depending only on the manifold. We t…

2005-09-28abs ↗pdf ↗

We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of the graph contains a non-splittable 2-component link. We also show that there exis…

2008-04-26abs ↗pdf ↗

We prove that every embedding of K2n+1,2n+1K_{2n+1,2n+1} into R3\R^3 contains a non-split link of nn-components. Further, given an embedding of K2n+1,2n+1K_{2n+1,2n+1} in R3\R^3, every edge of K2n+1,2n+1K_{2n+1,2n+1} is contained in a non-split nn-component link in K2n+1,2n+1K_{2n+1,2n+1}.

2005-12-09abs ↗pdf ↗

Edge-homotopy and vertex-homotopy are equivalence relations on spatial graphs which are generalizations of Milnor's link-homotopy. We introduce some edge (resp. vertex)-homotopy invariants of spatial graphs by applying the Sato-Levine invariant for the 2-component constituent algebraically split links and show examples…

2005-09-01abs ↗pdf ↗

The study embeds infinite-dimensional geometric structures in Cayley graphs.

problem Embedding infinite-dimensional structures in finite Cayley graphs.
method Examples of groups and generating sets, quasi-isometric embeddings, subsurface projections.
result Cayley graphs contain quasi-isometric copies of Zm\mathbb{Z}^m for all m1m\geq 1.

New algebraic structures for Lie 2-algebroids and their connections.

problem Characterizing and understanding Lie 2-algebroids and their structures.
method Construction of homotopy Poisson algebra and introduction of Dirac structures.
result One-to-one correspondence between Manin triples and Lie 2-bialgebroids.

New methods for delta-moves on algebraically split links identified.

problem Understanding delta-moves on algebraically split links.
method Introducing self and mixed delta-moves, proving equivalence, and calculating delta-splitting numbers.
result Two links are mixed delta-equivalent if they have the same pairwise linking number and components.

The paper explains practical insights for sparse network modeling.

problem Resolving pathologies in traditional network modeling, focusing on sparsity.
method Sparse exchangeable graphs, network subsampling, test-train dataset splitting, mean field variational inference.
result Practical insights and methods for sparse network modeling.

Edge-homotopy and vertex-homotopy are equivalence relations on spatial graphs which are generalizations of Milnor's link-homotopy. Fleming and the author introduced some edge (resp. vertex)-homotopy invariants of spatial graphs by applying the Sato-Levine invariant for the constituent 2-component algebraically split li…

2007-10-19abs ↗pdf ↗