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

Trend · papers per month

336598130 · May 202619922001200920182026
48 results for coarse ranking

We classify up to coarse equivalence all countable abelian groups of finite torsion free rank. The Q-cohomological dimension and the torsion free rank are the two invariants that give us such classification. We also prove that any countable abelian group of finite torsion free rank is coarsely equivalent to Z^n + H whe…

2008-03-04abs ↗pdf ↗

Paper explores coarse embeddings between symmetric spaces and Euclidean buildings, answering open questions.

problem Understanding coarse embeddings between symmetric spaces and Euclidean buildings.
method Generalization of quasi-isometric embeddings, focusing on coarse embeddings without Euclidean factors.
result Rank is monotonous under coarse embeddings when the domain does not contain a Euclidean factor.

Groups with specific properties have similar cubulations and coarse median structures.

problem Understanding the structure of certain groups through cubical coarsening.
method Analyzing right-angled Artin and Coxeter groups, focusing on automorphisms and cubulations.
result Automorphisms of specific groups preserve coarse median structures and have nice fixed subgroups.

The free factor complex of rank 4+ fails a combinatorial isoperimetric inequality.

problem Failure of combinatorial isoperimetric inequality in the free factor complex.
method Construction of a coarsely Lipschitz function from the upward link of a free factor to integers.
result A loop in the free factor complex requires linearly growing number of 2-simplices to fill.

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.

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.

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.

The paper extends a theorem to number fields without infinite places.

problem Finiteness properties of arithmetic approximate lattices.
method Geometric and homological finiteness properties for countable approximate groups.
result The finiteness length is finite and can be computed explicitly.

The paper characterizes convex co-compact groups with one-dimensional boundary faces.

problem Characterizing convex co-compact groups with specific boundary properties.
method Proving relative hyperbolicity and using coarse Hilbert dimension.
result Convex co-compact groups with one-dimensional boundary faces are relatively hyperbolic.

Temporal coarse-graining of multi-sector default count data generates effective correlation matrices and rank copulas.

problem Explaining the difference in default dependence between monthly and annual aggregation.
method Dynamic low-rank state-space model with AR(1) latent credit-state factors.
result Effective correlation matrices and rank copulas are generated from monthly default count data.

MLP residual networks implement a selective coarse-graining procedure governed by the spectral structure of the input distribution.

problem Understanding the coarse-graining procedure in MLP residual networks
method Analyzing a pure MLP residual stack on synthetic Markov chain sequences
result MLP residual networks implement a selective coarse-graining procedure governed by the spectral structure of the input distribution

We study the geometry and dynamics of discrete infinite covolume subgroups of higher rank semisimple Lie groups. We introduce and prove the equivalence of several conditions, capturing "rank one behavior'' of discrete subgroups of higher rank Lie groups. They are direct generalizations of rank one equivalents to convex…

2014-03-29abs ↗pdf ↗

Let X be quasi-isometric to either the mapping class group equipped with the word metric, or to Teichmuller space equipped with either the Teichmuller metric or the Weil-Petersson metric. We introduce a unified approach to study the coarse geometry of these spaces. We show that the quasi-Lipschitz image in X of a box i…

2013-07-14abs ↗pdf ↗

BoostNE learns multiple network embeddings from coarse to fine.

problem Complex node interactions cannot be fully captured by a single low-rank embedding matrix.
method BoostNE proposes a multi-level network embedding framework using gradient boosting.
result BoostNE outperforms existing network embedding methods on various datasets.

Study infinite subgroups of higher rank Lie groups, focusing on Anosov subgroups.

problem Understanding properties of Anosov subgroups in higher rank semisimple Lie groups.
method Characterize Anosov subgroups through geometric, coarse geometric, and dynamical viewpoints.
result New equivalent characterizations of Anosov subgroups, capturing rank one behavior.

Paper tackles low-rank matrix recovery with KL property and DC reformulation.

problem Low-rank matrix recovery with coarse rank estimation.
method Adds 2,0\ell_{2,0}-norm and balanced terms to factorized loss function; establishes KL property and DC reformulations.
result Establishes KL property of exponent 1/21/2 for the composite function and its global minimizers.

Study on coarse homotopy groups, proving equivalence and matching with usual homotopy groups.

problem Understanding coarse homotopy groups in abstract coarse structures.
method Developed geometric triangulation techniques for cones to prove the equivalence and matching of coarse homotopy groups with usual homotopy groups.
result Coarse homotopy groups of the cone of a compact simplicial complex coincide with the usual homotopy groups of the underlying compact simplicial complex.

Improved image classification using centroids and stochastic sampling.

problem Limited accuracy of nearest-neighbor classification.
method Coarse-graining (replacing images by centroids) and stochastic sampling of centroids.
result Stochastic sampling of centroids improves classification accuracy.

Defines coarse versions of property C and decomposition complexity.

problem Tackles coarse versions of property C and decomposition complexity.
method Uses coarse spaces to define coarse versions of asymptotic property C and decomposition complexity.
result Proves coarse property C implies coarse property A and shares features with metric analogs.

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 ↗

Interprets coarse symbol and index classes for Callias type operators.

problem Understanding coarse geometry and index classes for Callias type operators.
method Interprets coarse symbol and index classes in terms of K-theory classes of coarse corona.
result Local positivity and invertibility conditions are incorporated into support conditions in K-theory.

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.

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 ↗

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.

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

We investigate the coarse homology of leaves in foliations of compact manifolds. This is motivated by the observation that the non-leaves constructed by Schweitzer and by Zeghib all have non-finitely generated coarse homology. This led us to ask whether the coarse homology of leaves in a compact manifold always has to …

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

Quantization-aware phase retrieval algorithm improves signal reconstruction accuracy.

problem Reconstructing signals from quantized phase measurements.
method Developed a rank-1 projection algorithm with consistency criterion using one-sided quadratic cost.
result The algorithm achieves higher reconstruction accuracy and is closer to the Cramér-Rao lower bound.