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,742 papers · 148 categories

Trend · papers per month

150299449598 · Jun 202019922001200920172026
48 results for locally finite graphs

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 describes the K-theory of CC^*-algebras of locally finite graphs.

problem Computing the K-theory of CC^*-algebras of locally finite graphs.
method Using a directed graph representation and Cuntz-Krieger algebra, the paper computes the K-theory of C(Γ)C^*(Γ).
result The K-theory of C(Γ)C^*(Γ) is determined by the graph's genus, number of ends, and dead-ends.

In this paper we study the gradient estimate for positive solutions of Schrodinger equations on locally finite graph. Then we derive Harnack's inequality for positive solutions of the Schrodinger equations. We also set up some results about Green functions of the Laplacian equation on locally finite graph. Interesting …

2013-10-31abs ↗pdf ↗

In this paper, we consider three typical problems on a locally finite connected graph. The first one is to study the Bochner formula for the Laplacian operator on a locally finite connected graph. We use the Bochner formula to derive the Bernstein type estimate of the heat equation. The second is to derive the Reilly t…

2013-04-01abs ↗pdf ↗

The curve graphs are not locally finite. In this paper, we show that the curve graphs satisfy a property which is equivalent to graphs being uniformly locally finite via Masur--Minsky's subsurface projections. As a direct application of this study, we show that there exist computable bounds for Bowditch's slices on tig…

2013-12-18abs ↗pdf ↗

An inaccessible, vertex transitive, locally finite graph is described. This graph is not quasi-isometric to a Cayley graph.

2010-06-19abs ↗pdf ↗

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 ↗

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.

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.

This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends, assume the role played in finite graphs by paths and cycles. This approach has made …

2009-12-21abs ↗pdf ↗

The paper develops finite knot theory using ropelength-filtered Reidemeister graphs.

problem Understanding knot types in bounded ropelength sublevel spaces.
method Study thick representatives in bounded ropelength sublevel spaces through lifted Reidemeister graphs.
result Define characteristic Reidemeister patterns and finite recognition length.

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.

We describe two locally finite graphs naturally associated to each knot type K, called Reidemeister graphs. We determine several local and global properties of these graphs and prove that in one case the graph-isomorphism type is a complete knot invariant up to mirroring. Lastly, we introduce another object, relating t…

2018-01-10abs ↗pdf ↗

The paper conjectures and proves fixed points for certain group actions on nonpositively curved spaces.

problem Actions by automorphisms of finitely generated groups on nonpositively curved complexes without fixed points.
method Use of Helly graphs and geodesic clique paths to prove ellipticity results.
result Finitely generated torsion groups cannot act without fixed points on nonpositively curved spaces.

Characterizes a specific homology group for certain graphs.

problem Understanding the first uniformly finite homology group with Z\mathbb{Z} coefficients.
method Analyzes uniformly locally finite graphs, characterizes the group for trees and Z2\mathbb{Z}_2 coefficients, and identifies three phenomena for general graphs.
result Necessary conditions for non-vanishing of the group in transitive graphs.

Continuing our previous work (arXiv:1509.07981v1), we derive another global gradient estimate for positive functions, particularly for positive solutions to the heat equation on finite or locally finite graphs. In general, the gradient estimate in the present paper is independent of our previous one. As applications, i…

2015-10-24abs ↗pdf ↗

Croke and Kleiner constructed two homeomorphic locally CAT(0) complexes whose universal covers have visual boundaries that are not homeomorphic. We construct two homeomorphic locally CAT(0) complexes so that the visual boundary of one universal cover contains a nonplanar graph, while the visual boundary of the other do…

2018-07-06abs ↗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.

Quasi-transitive graphs quasi-isometric to planar graphs can be upgraded to Cayley graphs.

problem Quasi-transitive graphs quasi-isometric to planar graphs need to be upgraded to Cayley graphs.
method Upgrading a planar graph to a Cayley graph.
result Quasi-transitive graphs quasi-isometric to planar graphs can be upgraded to Cayley graphs.

In this paper, we establish Buser type inequalities, i.e., upper bounds for eigenvalues in terms of Cheeger constants. We prove the Buser's inequality for an infinite but locally finite connected graph with Ricci curvature lower bounds. Furthermore, we derive that the graph with positive curvature is finite, especially…

2018-10-29abs ↗pdf ↗

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.

Erdős introduced the noncommuting graph, in order to study the number of commuting elements in a finite group. Despite the use of combinatorial ideas, his methods involved several techniques of classical analysis. The interest for this graph is becoming relevant in the last years for various reasons. Here we deal with …

2015-02-04abs ↗pdf ↗

The space C of conservative vertex colorings (over a field F) of a countable, locally finite graph G is introduced. The subspace of based colorings is shown to be isomorphic to the bicycle space of the graph. For graphs G with a free Z^d-action by automorphisms, C is a finitely generated module over the polynomial ring…

2014-08-27abs ↗pdf ↗

We study some equivalent properties of the curvature-dimension conditions CD(n,K)CD(n,K) inequality on infinite, but locally finite graph. These equivalences are gradient estimate, Poincaré type inequalities and reverse Poincaré inequalities. And we also obtain one equivalent property of gradient estimate for a new notion o…

2015-12-06abs ↗pdf ↗

The study introduces Cayley--Abels--Rosendal graphs for Polish groups.

problem Understanding the structure of Polish groups through graph theory.
method Developing Cayley--Abels--Rosendal graphs and applying them to Polish groups.
result Groups with Cayley--Abels--Rosendal graphs are topological analogues of finitely generated groups.

We study the Bakry-Émery curvature function KG,x:(0,]R\mathcal{K}_{G,x}:(0,\infty]\to \mathbb{R} of a vertex xx in a locally finite graph GG systematically. Here KG,x(N)\mathcal{K}_{G,x}(\mathcal{N}) is defined as the optimal curvature lower bound K\mathcal{K} in the Bakry-Émery curvature-dimension inequality $CD(\mathcal{K},\ma…

2016-06-05abs ↗pdf ↗

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 finds incommensurable lattices in complex models of Baumslag-Solitar groups.

problem Locally finite 2-complexes and their automorphism groups contain incommensurable lattices.
method Constructing lattices in combinatorial models of Baumslag-Solitar groups and analyzing their properties.
result The constructed lattices are incommensurable and have specific properties like isomorphic Cayley graphs.

We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic manifold with toric cusps. The various pieces are attached together via affine maps o…

2011-07-11abs ↗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.