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.

168,695 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for graphing map

Embeddings of mapping tori for end-periodic graph maps are proven.

problem Embedding mapping tori of end-periodic graph maps into finite complexes.
method Flowline-preserving homotopy equivalence and π1π_1-injective map.
result Every mapping class of Γ arising from an end-periodic homotopy equivalence contains a representative whose mapping torus realizes such an embedding.

The paper defines and proves the existence of train track maps on graphs of groups.

problem Understanding homotopy equivalences in graphs of groups.
method Developed the theory of train track maps on graphs of groups, defining maps and homotopy equivalences.
result Any homotopy equivalence of a graph of groups may be represented by a relative train track map under certain conditions.

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.

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.

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.

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.

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 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.

The paper characterizes graph manifolds using fold maps and embeddability of polyhedra.

problem Understanding the global topologies of graph manifolds.
method Using fold maps into the plane and embeddability of polyhedra in 3-manifolds.
result Characterizes graph manifolds via fold maps and polyhedra embeddability.

We show that an Anosov map has a geodesic axis on the curve graph of a torus. The direct corollary of our result is the stable translation length of an Anosov map on the curve graph is always a positive integer. As the proof is constructive, we also provide an algorithm to calculate the exact translation length for any…

2019-08-01abs ↗pdf ↗

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.

In this paper, we first introduce higher order Dirichlet-to-Neumann maps on graphs which can be viewed as a discrete analogue of the corresponding Dirichlet-to-Neumann maps on compact Riemannian manifolds with boundary and a higher order generalization of the Dirichlet-to-Neumann map on graphs introduced by Hua-Huang-W…

2019-04-08abs ↗pdf ↗

Optimal Euclidean structure minimizes energy in weighted toroidal graphs.

problem Finding the optimal Euclidean structure for weighted toroidal graphs.
method Minimizing Dirichlet energy over all possible Euclidean structures and realizations within a fixed homotopy class.
result The optimal Euclidean structure induces a weighted Delaunay decomposition.

Study uniformly differentiable graphs in Carnot groups, proving area formulas.

problem Characterize uniformly differentiable intrinsic graphs in Carnot groups.
method Characterize uniform intrinsic differentiability via Hölder properties of projections of vector fields.
result Explicit area formula for uniformly intrinsically differentiable maps in Carnot groups.

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.

Study of endperiodic maps on infinite graphs, proving homotopy and eigenvalue properties.

problem Understanding endperiodic maps on infinite graphs with finitely many ends.
method Adapting relative train track maps and combinatorial techniques to infinite type setting.
result Any generalized endperiodic map is homotopic to a relative train track map.

Let RR be a compact, connected, orientable surface of genus gg with nn boundary components with g2g \geq 2, n0n \geq 0. Let N(R)\mathcal{N}(R) be the nonseparating curve graph, C(R)\mathcal{C}(R) be the curve graph and HT(R)\mathcal{HT}(R) be the Hatcher-Thurston graph of RR. We prove that if $λ: \mathcal{N}(R) \rightarro…

2017-08-15abs ↗pdf ↗

Groups of homotopy equivalences of graphs help realize compact subgroups.

problem Realizing compact subgroups of homotopy equivalences of graphs.
method Introduced a Polish group topology on the group of proper homotopy equivalences and proved the Nielsen Realization theorem.
result Compact subgroups of homotopy equivalences can be realized by simplicial isomorphisms of graphs.

Godin introduced the categories of open closed fat graphs FatocFat^{oc} and admissible fat graphs FatadFat^{ad} 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 FatadFat^{ad} is a model of the mapping class group of open-close…

2015-08-14abs ↗pdf ↗

We consider the mean curvature flow of the graph of a smooth map f:R2R2f:\mathbb{R}^2\to\mathbb{R}^2 between two-dimensional Euclidean spaces. If ff satisfies an area-decreasing property, the solution exists for all times and the evolving submanifold stays the graph of an area-decreasing map ftf_t. Further, we prove unifo…

2016-08-18abs ↗pdf ↗

We construct maps on hat Heegaard Floer homology for cobordisms decorated with graphs. The graph TQFT allows for cobordisms with disconnected ends. Our construction uses Juhász's sutured Floer TQFT. We compute the maps for several elementary graph cobordisms. As an application, we compute the action of the fundamental …

2015-03-19abs ↗pdf ↗

The period mapping assigns to each rank n, marked metric graph Gamma a positive definite quadratic form on H_1(Gamma). This defines maps Phi* and Phi on Culler--Vogtmann's outer space CV_n, and its Torelli space quotient T_n, respectively. The map Phi is a free group analog of the classical period mapping that sends a …

2016-09-12abs ↗pdf ↗

Researchers prove the automorphism group of a sphere complex matches the mapping group of a graph.

problem Understanding the automorphisms of sphere complexes associated with graphs.
method Analyzing the group of proper homotopy equivalences and constructing an exhaustion of the sphere complex.
result The automorphism group of the sphere complex is isomorphic to the mapping group of the graph.

Theta graph diffeomorphism shows nontrivial mapping class of 4-sphere.

problem Identifying nontrivial elements in the smooth mapping class group of 4-sphere.
method Diagrammatic calculus for smooth mapping class group of 4-sphere, Watanabe's clasper surgery construction.
result Theta graph diffeomorphism is isotopic to a nontrivial element of (1,2)-subgroup.

Paper estimates Gaussian curvature of minimal graphs in a specific manifold.

problem Estimating Gaussian curvature of minimal graphs in MimesRM imes\mathbb{R}.
method Using Weierstrass representation via \wp-harmonic mappings and Schwarz lemma type results.
result Proves Schwarz lemma type and Heinz type results for harmonic mappings.

Study measures complexity of surfaces using a new graph to prove group properties.

problem Understanding the complexity and structure of mapping class groups.
method Introduces a non-peripheral curve graph and uses it to analyze the structure of mapping class groups.
result Proves properties of the mapping class group based on the complexity measure.

Random projections help in representing sparse graphs efficiently.

problem Efficiently representing sparse graphs of varying sizes and vertex sets.
method Random projection of adjacency matrices to retain graph functionality and properties.
result Random projections can accurately represent graphs of different sizes and vertex sets in the same space.

The paper studies mapping class groups of locally finite graphs and their associated sphere complexes.

problem Understanding mapping class groups of locally finite graphs and their geometric representations.
method Generalizes results from 3-manifolds to locally finite graphs, proving surjections and splitting properties.
result A sphere complex S(MΓ)\mathcal{S}(M_Γ) associated with a graph Γ, with a faithful action of the mapping class group.

In this paper we study some consequences of the author's classification of graph manifolds by their profinite fundamental groups. In particular we study commensurability, the behaviour of knots, and relation to mapping classes. We prove that the exteriors of graph knots are distinguished among all 3-manifold groups by …

2018-01-19abs ↗pdf ↗

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 study explores normal generators for mapping class groups and their properties.

problem Understanding normal generators for mapping class groups of surfaces.
method Examined the relation between normal generation and asymptotic translation lengths on Teichmüller space and curve graph.
result Discussed several open questions related to normal generators.