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

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for random geometry

Study on volumes of random inscribed polytopes in projective geometries.

problem Estimating volumes of random inscribed polytopes in projective geometries.
method Central limit theorems and normal approximation for volumes and dual volumes of random inscribed polytopes.
result Established central limit theorems and normal approximation for volumes and dual volumes of random inscribed polytopes.

Study on connectivity and geometry of random Coxeter groups.

problem Connectivity threshold for square percolation on random graphs.
method Probabilistic combinatorics and techniques from geometric group theory.
result Determines connectivity threshold and cubical coarse median structure for random Coxeter groups.

The paper characterizes the geometry and topology of spin random fields.

problem Understanding the expected geometry and topology of spin random fields.
method Investigating the asymptotic behavior of geometric and topological functionals for spin random fields under scaling assumptions.
result Explicit results for monochromatic fields, showing non-universal asymptotic behavior and new generalized models.

Research proves the semi-classical limit of Liouville conformal field theory, describing deterministic geometry from random fluctuations.

problem Proving the semi-classical limit of Liouville conformal field theory.
method Probabilistic definition of Liouville theory, proving existence of semi-classical limit, defining classical stress-energy tensor.
result Existence and description of the semi-classical limit in terms of a massive Gaussian free field with Robin boundary conditions.

The article studies random infinite ideal hyperbolic polyhedra and their dual graphs, establishing new boundary theories.

problem Uniformization and boundary theory of random infinite ideal hyperbolic polyhedra and their dual graphs.
method Combinatorics, geometry, analysis, and random walks perspectives.
result Characterization of the ICP type of IAG and convergence of simple random walk to the boundary.

Study reveals limits of detecting local geometry in random graphs.

problem Detecting local geometry in random graphs with hidden communities.
method Introduced model and used information-theoretic and computational limits to investigate detection.
result Detection threshold determined at d=Θ~(k2k6/n3)d = \widetildeΘ(k^2 \vee k^6/n^3) for fixed pp.

Researchers study the conformal geometry of bivariate Gaussian manifolds.

problem Exploring the conformal structure of Fisher-Rao metric on statistical manifolds.
method Determined invariants of the conformal structure of the Fisher-Rao metric on the bivariate Gaussian manifold.
result The conformal holonomy group is SO0(1,6)SO^{0}(1,6) for generic random variables, but SO0(1,4)SO^{0}(1,4) for independent ones.

New framework models neural systems with random architecture on manifolds.

problem Complex, uncertain systems with non-Gaussian outputs.
method Latent random field on compact manifold generates neural architecture and weights.
result Synthetic neural systems can produce stochastic outputs for deterministic inputs.

Paper proposes a new method for supervised manifold learning using random forest proximities.

problem Existing supervised manifold learning methods fail to uncover meaningful embeddings due to using class-conditional distances.
method Proposes a data-geometry-preserving variant of random forest proximities as an initialization for manifold learning methods.
result Local and global structure preservation is near universal across manifold learning approaches using diffusion-based algorithms.

Researchers use information geometry to analyze and improve DRWs for node classification.

problem Lack of theoretical foundations for Discriminative Random Walks (DRWs).
method Revisit DRWs through information geometry, treating hitting-time laws as a statistical manifold. Derived closed-form expressions and introduced sensitivity scores.
result Introduced a sensitivity score that bounds maximal first-order change in DRW betweenness under unit Fisher perturbations.

We study Gauss curvature for random Riemannian metrics on a compact surface, lying in a fixed conformal class; our questions are motivated by comparison geometry. Next, analogous questions are considered for the scalar curvature in dimension n>2n>2, and for the QQ-curvature of random Riemannian metrics.

2010-01-29abs ↗pdf ↗

We study random 2-dimensional complexes in the Linial - Meshulam model and find torsion in their fundamental groups at various regimes. We find a simple algorithmically testable criterion for a subcomplex of a random 2-complex to be aspherical; this implies that any aspherical subcomplex of a random 2-complex satisfies…

2013-07-13abs ↗pdf ↗

Proposes a new gauge theory for fuzzy geometries using finite-dimensional algebras.

problem Modeling fuzzy geometries in noncommutative geometry.
method Introduces a Yang-Mills-Higgs matrix model based on gauge matrix spectral triples.
result States Yang-Mills-Higgs theory as an explicit random multimatrix model.

Interesting data often concentrate on low dimensional smooth manifolds inside a high dimensional ambient space. Random projections are a simple, powerful tool for dimensionality reduction of such data. Previous works have studied bounds on how many projections are needed to accurately preserve the geometry of these man…

2016-07-14abs ↗pdf ↗

This is supplementary material for the main Geodesics article by the authors. In Appendix A, we present some general results on the construction of Gaussian random fields. In Appendix B, we restate our Shape Theorem, specialized to the setting of this article. In Appendix C, we state some straightforward consequences o…

2012-06-21abs ↗pdf ↗

In this paper a new connection between the discrete conformal geometry problem of disk pattern construction and the continuous conformal geometry problem of metric uniformization is presented. In a nutshell, we discuss how to construct disk patterns by optimizing an objective function, which turns out to be intimately …

2000-10-31abs ↗pdf ↗

Study of random multicurves and square-tiled surfaces on large genus surfaces.

problem Understanding the geometry and combinatorial properties of random multicurves and square-tiled surfaces on surfaces of large genus.
method Combination of combinatorial and geometric analysis, including large genus asymptotic analysis of moduli space volumes and intersection numbers.
result Random multicurves and square-tiled surfaces have well-approximated properties by random permutations, with specific expected values.

This work uses stochastic geometry to improve STIT processes in machine learning.

problem Improving STIT processes for efficient and consistent machine learning applications.
method Utilizing tools from stochastic geometry to characterize kernels and obtain consistency results.
result Generalization of STIT processes and their kernels, leading to improved machine learning methods.

Muons and random optimizers perform similarly, challenging geometric optimization theory.

problem Empirical success of Muon optimizer challenges geometric optimization theory.
method Introducing Freon and Kaon optimizers, demonstrating performance without precise geometric structure.
result Performance of optimizers is controlled by alignment and descent potential, not geometric structure.

The study explores generalized divergences and exponential families with a focus on sufficient conditions and laws of large numbers.

problem Generalization of Kullback-Leibler divergence and exponential families.
method Investigation of (h,τ)(h,τ)-divergence and (h,τ)(h,τ)-exponential families, definition of (h,τ)(h,τ)-dependence, proof of law of large numbers.
result Sufficient condition for (h,τ)(h,τ)-divergence to induce Hessian structure on (h,τ)(h,τ)-exponential family, proof of law of large numbers.

Riemannian stochastic gradient descent approximates a diffusion process called Riemannian stochastic modified flow.

problem Improving convergence rate of Riemannian stochastic gradient descent.
method Using stochastic differential geometry, the paper shows RSGD can be approximated by the Riemannian stochastic modified flow (RSMF).
result RSGD can be approximated by the solution to the RSMF driven by an infinite-dimensional Wiener process, increasing the order of approximation.

We study random Morse functions on a Riemann manifold (Mm,g)(M^m,g) defined as a random Gaussian weighted superpositions of eigenfunctions of the Laplacian of the metric gg. The randomness is determined by a fixed Schwartz function ww and a small parameter ε>0\varepsilon>0. We first prove that as ε0\varepsilon\to 0 the ex…

2012-09-04abs ↗pdf ↗

A random forest is a popular tool for estimating probabilities in machine learning classification tasks. However, the means by which this is accomplished is unprincipled: one simply counts the fraction of trees in a forest that vote for a certain class. In this paper, we forge a connection between random forests and ke…

2018-12-14abs ↗pdf ↗

A simple geometrical proof shows that any target function can be found in a random network's neighborhood.

problem Finding any target function in a random network's neighborhood.
method Geometrical proof using a simple model of a high-dimensional sphere projected onto a low-dimensional subspace.
result High-dimensional geometry ensures that a uniform distribution over a sphere reduces to a Gaussian distribution with negligible covariances, enabling the presence of any target function in a random network's neighborhood.

Formula found for probability of random triangles on flat tori being homotopically trivial.

problem Calculating the probability of random triangles on flat tori being homotopically trivial.
method Reduced problem to new invariant of measurable sets in the plane unchanged by area-preserving affine transformations.
result Probability is minimized on rectangular tori and maximized on regular hexagonal tori.

The study finds effective lower bounds for spectra of random surfaces and bundles.

problem Determining the spectrum of Laplacian on random surfaces and bundles.
method Analysis of random covering surfaces and unitary bundles over finite-area non-compact hyperbolic surfaces.
result With high probability, the spectrum of random surfaces and bundles has no eigenvalues below a certain threshold.

Study on geodesics and eigenvalues on random hyperbolic surfaces with cusps.

problem Counting short geodesics and small eigenvalues on random hyperbolic surfaces.
method Rescaling and convergence to a Poisson point process.
result The probability of having at least k=o(n)k=o(n) arbitrarily small eigenvalues tends to 1 as non o\infty.

Generative model for joint discrete distributions using randomized assignment flows.

problem Efficiently representing and sampling from complex joint distributions of discrete variables.
method Randomized assignment flows on the statistical submanifold of factorizing distributions.
result Our model can efficiently represent and sample from any target distribution and assess likelihood of unseen data points.