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

2565137691,025 · Jun 202019922001200920172026
48 results for coarsely bounded sets

We define a generalization of the fixed point set, called the bounded fixed set, for a group acting by isometries on a metric space. An analogue of the P. A. Smith theorem is proved for metric spaces of finite asymptotic dimension, which relates the coarse homology of the bounded fixed set to the coarse homology of the…

2010-07-03abs ↗pdf ↗

Classifies homeomorphism groups of countable Stone spaces up to coarse equivalence.

problem Classifying non-locally compact topological groups using geometric group theory.
method Classification based on coarsely bounded sets and quasi-isometry.
result Groups in the second class are quasi-isometric to the Hamming cube.

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.

The main results of the paper are: \begin{Prop}\label{GenSvarc-Milnor} A group GG acting coarsely on a coarse space $(X,\CC)$ induces a coarse equivalence ggx0g\to g\cdot x_0 from GG to XX for any x0Xx_0\in X. \end{Prop} Theorem: \label{GenGromovThm} Two coarse structures $\CC_1$ and $\CC_2$ on the same set XX are equ…

2006-07-22abs ↗pdf ↗

We define a notion of free product for coarse spaces that generalizes the corresponding notion of a free product for groups. We show that free products preserve coarse properties such as coarse property C, finite coarse decomposition complexity, and coarse property A. We also give an upper bound estimate on the dimensi…

2019-05-16abs ↗pdf ↗

We study the large-scale geometry of mapping class groups of surfaces of infinite type, using the framework of Rosendal for coarse geometry of non locally compact groups. We give a complete classification of those surfaces whose mapping class groups have local coarse boundedness (the analog of local compactness). When …

2019-12-23abs ↗pdf ↗

We consider the problem of active coarse ranking, where the goal is to sort items according to their means into clusters of pre-specified sizes, by adaptively sampling from their reward distributions. This setting is useful in many social science applications involving human raters and the approximate rank of every ite…

2018-02-20abs ↗pdf ↗

Paper relates asymptotic dimension to cofinal dimension using coarse proximities.

problem Relating asymptotic dimension to cofinal dimension in metric spaces.
method Introducing coarse proximities and inverse limit constructions.
result Asymptotic dimension is bounded by coarse cofinal dimension and cofinal dimension of Higson corona.

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.

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.

In this article, we introduce the notion of a functor on coarse spaces being coarsely excisive- a coarse analogue of the notion of a functor on topological spaces being excisive. Further, taking cones, a coarsely excisive functor yields a topologically excisive functor, and for coarse topological spaces there is an ass…

2010-02-24abs ↗pdf ↗

Big mapping class groups of infinite type surfaces have infinite asymptotic dimension.

problem Understanding asymptotic dimension of big mapping class groups of infinite type surfaces.
method Analyzing big mapping class groups with coarsely bounded generating sets and essential shifts.
result Big mapping class groups of infinite type surfaces have infinite asymptotic dimension.

The paper studies properties of group relations induced by compatible coarse structures.

problem Properties of asymptotic resemblance relations on groups.
method Generalization of asymptotic dimension and introduction of set theoretic coupling.
result Groups with compatible coarse structures that admit a set theoretic coupling are asymptotic equivalent.

Study recovers community structure from coarse graph measurements.

problem Community recovery from low-resolution graph measurements.
method Formalized coarsening process of graph measurements, developed conditions for perfect recovery.
result Simple and closed-form asymptotic conditions for perfect recovery of coarse graph communities.

It is well-known that a paracompact space XX is of covering dimension at most nn if and only if any map f ⁣:XKf\colon X\to K from XX to a simplicial complex KK can be pushed into its nn-skeleton K(n)K^{(n)}. We use the same idea to characterize asymptotic dimension in the coarse category of arbitrary coarse spaces. Cont…

2015-08-06abs ↗pdf ↗

The study explores ends in coarse homotopy of proper geodesic spaces.

problem Understanding ends in coarse homotopy of proper geodesic spaces.
method Recontextualizing ends as a functor and proving properties of coarse path components.
result Existence of a natural surjection from coarse path components to ends, not always an injection.

The study confirms Gromov's speculation and provides bounds for taming symplectic structures.

problem Understanding the relationship between taming symplectic structures and the area of pseudoholomorphic curves.
method Analyzes the numerical cone of taming symplectic structures and characterizes coarsely holomorphic curves.
result An almost complex manifold with an area bound admits a taming symplectic structure, confirming Gromov's speculation.

Coarse homotopy theory connects Euclidean cones to shape theory of compact spaces.

problem Establishing connections between coarse homotopy theory and shape theory.
method Using pointed shape invariants and inverse mapping telescopes.
result Proving two compact spaces are strong shape equivalent if their Euclidean cones are coarsely homotopy equivalent.

Following Roe and others (see, e.g., [MR1451755]), we (re)develop coarse geometry from the foundations, taking a categorical point of view. In this paper, we concentrate on the discrete case in which topology plays no role. Our theory is particularly suited to the development of the_Roe (C*-)algebras_ C*(X) and their K…

2007-08-29abs ↗pdf ↗

We consider several natural sets of curves associated to a given Teichmüller disc, such as the systole set or cylinder set, and study their coarse geometry inside the curve graph. We prove that these sets are quasiconvex and agree up to uniformly bounded Hausdorff distance. Furthermore, we describe two operations on cu…

2015-10-14abs ↗pdf ↗

In this paper, we consider spaces whose Higson coronae are indecomposable continua. We show that for a non-compact proper metric space XX which is coarsely geodesic and has coarse bounded geometry, the Higson corona of XX is an indecomposable continuum if and only if XX is coarsely equivalent to the space of natural…

2019-09-08abs ↗pdf ↗

Study on estimating Gaussian mean from coarse data, resolving identifiability and computational efficiency questions.

problem Estimating the mean of a Gaussian distribution from coarse data (sets containing true samples rather than exact values).
method Analyzes the conditions for mean identifiability and computable estimation under convex partitions.
result Resolves the identifiability and computational efficiency questions for Gaussian mean estimation from coarse data.

Between the category of exact metric spaces with bounded geometry (about which much is known) and the larger category of arbitrary exact metric spaces (about which little is known) lies the intermediate category of asymptotically exact metric spaces. We show that the coarse Baum-Connes assembly map is naturally split s…

2012-06-13abs ↗pdf ↗

We prove that each coarsely homogenous separable metric space XX is coarsely equivalent to one of the spaces: the sigleton, the Cantor macro-cube or the Baire macro-space. This classification is derived from coarse characterizations of the Cantor macro-cube and of the Baire macro-space given in this paper. Namely, we …

2011-03-26abs ↗pdf ↗

Topological normal generation proved for mapping class groups of certain surfaces.

problem Proving topological normal generation for mapping class groups of surfaces.
method Analyzing the end space of surfaces and using topological normal closure properties.
result Topological normal generation is equivalent to uniquely self-similar for surfaces with countable end space.

We introduce the notion of asymptotic cohomology based on the bounded cohomology and define cohomological asymptotic dimension $\as_{\Z} X$ of metric spaces. We show that it agrees with the asymptotic dimension $\as X$ when the later is finite. Then we use this fact to construct an example of a metric space XX of boun…

2006-08-09abs ↗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.

For a discrete metric space (or more generally a large scale space) XX and an action of a group GG on XX by coarse equivalences, we define a type of coarse quotient space XGX_G, which agrees up to coarse equivalence with the orbit space X/GX/G when GG is finite. We then restrict our attention to what we call coarsel…

2017-08-03abs ↗pdf ↗

Machine learning generates coarse-grained force fields for molecular dynamics.

problem Creating thermodynamically consistent coarse-grained models for larger systems.
method Hybrid architecture using graph neural networks to learn molecular features.
result Framework reproduces thermodynamics for small biomolecular systems.

The paper develops glueing theory for topological spaces and applies it to compactifications.

problem Developing a theory for gluing topological spaces and its applications.
method Developed the theory of Artin-Wraith glueings for topological spaces and applied it to compactifications.
result The space of ends of coarse equivalent metric spaces are the same.

We study discrete group actions on coarse Poincare duality spaces, e.g. acyclic simplicial complexes which admit free cocompact group actions by Poincare duality groups. When G is an (n-1) dimensional duality group and X is a coarse Poincare duality space of formal dimension n, then a free simplicial action of G on X d…

1999-11-02abs ↗pdf ↗

We prove that two homogeneous ultra-metric spaces X,YX,Y are coarsely equivalent if and only if Ent(X)=Ent(Y)\mathrm{Ent}^\sharp(X)=\mathrm{Ent}^\sharp(Y) where Ent(X)\mathrm{Ent}^\sharp(X) is the so-called sharp entropy of XX. This classification implies that each homogeneous proper ultra-metric space is coarsely equivalent to the a…

2008-01-14abs ↗pdf ↗

We introduce a novel definition of curvature for hypergraphs, a natural generalization of graphs, by introducing a multi-marginal optimal transport problem for a naturally defined random walk on the hypergraph. This curvature, termed \emph{coarse scalar curvature}, generalizes a recent definition of Ricci curvature for…

2018-03-22abs ↗pdf ↗

New method optimizes complex models with minimal data, proving global optimality.

problem Optimizing complex models with unknown cost functions and prior distributions.
method Introduces 'coarse learnability' and an iterative MBO algorithm with sample correction.
result Achieves global optimality with polynomial sample complexity.