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

68136203271 · Jun 202019922001200920172026
48 results for random tessellation

It is shown that the tessellation of a compact, negatively curved surface induced by a typical long geodesic segment, when properly scaled, looks locally like a Poisson line process. This implies that the global statistics of the tessellation -- for instance, the fraction of triangles -- approach those of the limiting …

2017-08-31abs ↗pdf ↗

A Riemannian symmetric space is a Riemannian manifold in which it is possible to reflect all geodesics through a point by an isometry of the space. On such spaces, we introduce the notion of a distributional lattice, generalizing the notion of lattice. Distributional lattices exist in any Riemannian symmetric space: th…

2017-07-02abs ↗pdf ↗

Develops a new non-adversarial framework for better generative models.

problem Inaccurate approximation of target distribution in latent space.
method Tessellated Wasserstein Auto-Encoders (TWAE) using centroidal Voronoi tessellation (CVT) to tessellate latent space.
result Significantly enhances generative performance in terms of FID compared to existing models.

In this work we study the degree distribution, the maximum vertex and edge flow in non-uniform random Delaunay triangulations when geodesic routing is used. We also investigate the vertex and edge flow in Erdös-Renyi random graphs, geometric random graphs, expanders and random kk-regular graphs. Moreover we show that …

2012-03-22abs ↗pdf ↗

Up to isomorphism there are six fixed-point free crystallographic groups in Euclidean Space generated by twists (screw motions). In each case, an orientable 3-manifold is obtained as the quotient of E3 by such a group. The cubic tessellation of E3 induces tessellations on each such manifold. These tessellations of the …

2015-05-01abs ↗pdf ↗

Space partitioning methods such as random forests and the Mondrian process are powerful machine learning methods for multi-dimensional and relational data, and are based on recursively cutting a domain. The flexibility of these methods is often limited by the requirement that the cuts be axis aligned. The Ostomachion p…

2019-06-13abs ↗pdf ↗

By regular tessellation, we mean any hyperbolic 3-manifold tessellated by ideal Platonic solids such that the symmetry group acts transitively on oriented flags. A regular tessellation has an invariant we call the cusp modulus. For small cusp modulus, we classify all regular tessellations. For large cusp modulus, we pr…

2014-06-11abs ↗pdf ↗

We present an explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F(n) embedded in CP3 defined by the equation z0^n + z1^n + z2^n + z3^n = 0 in the standard homogeneous coordinates [z0, z1, z2, z3], where n is any positive integer. Note that F(4) in particular is a K3 surface. Our tessellation…

2008-04-20abs ↗pdf ↗

The article describes how decorations on hyperbolic surfaces lead to unique tessellations and decompositions.

problem Understanding the geometric structure of decorated hyperbolic surfaces.
method Developing a characterisation of canonical tessellations and dual decompositions using hyperbolic geometry.
result Decorations on hyperbolic surfaces induce unique canonical tessellations and dual decompositions.

The Delaunay tessellation of a locally finite subset of hyperbolic space is constructed using convex hulls in Euclidean space of one higher dimension. For finite and lattice-invariant sets it is proven to be a polyhedral decomposition, and versions (necessarily modified from the Euclidean setting) of the empty circumsp…

2013-08-22abs ↗pdf ↗

For every half-translation surface with marked points (M,Σ)(M,Σ), we construct an associated tessellation Π(M,Σ)Π(M,Σ) of the Poincaré upper half plane whose tiles have finitely many sides and area at most ππ. The tessellation Π(M,Σ)Π(M,Σ) is equivariant with respect to the action of PSL(2,R)\mathrm{PSL}(2,\mathbb{R}), and invariant w…

2018-08-28abs ↗pdf ↗

Bayesian model captures mean and variance of response variables.

problem Complex, predictor-dependent relationships and heteroscedastic patterns in data.
method Sum-of-tessellations for mean, product-of-tessellations for variance.
result Model captures nuanced variance structures and provides reliable predictive uncertainty.

New algorithm optimizes tessellated kernels for larger datasets and improved performance.

problem Limited accuracy and complexity in machine learning algorithms based on kernel optimization.
method 2-step algorithm for optimizing tessellated kernels, scaling to 10,000 data points and extending to regression.
result Significant improvement in performance over Neural Nets and SimpleMKL with similar computation time.

A new method learns quantization boundaries in continuous space using tessellation.

problem Mapping between discrete and continuous distributions is difficult.
method Constructs normalizing flows on convex polytopes with exact likelihood evaluations.
result Improves likelihood evaluation and quantization learning across various data modalities.

An edge tessellation is a tiling of the plane generated by reflecting a polygon in its edges. We prove that a polygon generating an edge tessellation is one the following eight types: a rectangle; an equilateral, 60-right, isosceles right, or 120-isosceles triangle; a 120-rhombus; a 60-90-120 kite; or a regular hexagon…

2009-08-22abs ↗pdf ↗

The high-order relations between the content in social media sharing platforms are frequently modeled by a hypergraph. Either hypergraph Laplacian matrix or the adjacency matrix is a big matrix. Randomized algorithms are used for low-rank factorizations in order to approximately decompose and eventually invert such big…

2019-08-22abs ↗pdf ↗

The paper proves actions of lattices in higher rank groups have cost one.

problem Fixed price question for higher rank semisimple Lie groups.
method Low intensity Poisson point processes and geometry of Voronoi tessellations.
result Proves all probability measure preserving actions of lattices in higher rank groups have cost one.

Study jigsaw constructions of hyperbolic lattices and answer questions on arithmeticity and pseudomodularity.

problem Constructing and analyzing non-commensurable, non-uniform, non-arithmetic lattices in hyperbolic geometry.
method Hyperbolic jigsaw construction and recursive formulas for tessellations.
result Demonstration of recursive formula for tessellation of hyperbolic plane, generalizing Farey addition.

The analytic torsion is computed on fixed-point free and non fixed-point free factors (tessellations) of the three--sphere. We repeat the standard computation on spherical space forms (Clifford-Klein spaces) by an improved technique. The transformation to a simpler form of the spectral expression of the torsion on sphe…

2009-04-06abs ↗pdf ↗

The study classifies graphs on surfaces with positive curvature properties.

problem Classifying graphs on surfaces with specific curvature properties.
method Using medial graphs and classification techniques.
result Complete classification of graphs on surfaces with positive Forman curvature and corner curvature.

We prove that every complete finite-volume hyperbolic 3-manifold MM that is tessellated into (embedded) right-angled regular polyhedra (dodecahedra or ideal octahedra) embeds geodesically in a complete finite-volume connected orientable hyperbolic 4-manifold WW, which is also tessellated into right-angled regular pol…

2015-10-21abs ↗pdf ↗

The main goal of this paper is to define a 1-1 correspondence between between substitution tilings constructed by inflation and the arithmetic of positional representation in the underlying real vector space. It introduces a generalization of inflationary tessellations to equivalence classes of tiles. Two tiles belong …

2015-05-03abs ↗pdf ↗

New matching estimators correct bias in multivariate settings without smoothing parameters.

problem Bias in nearest-neighbor and matching estimators in multiple dimensions.
method Polynomial least squares fits on Voronoi tessellations.
result Novel estimators converge at n\sqrt{n} rate under mild smoothness assumptions.

A finite subset S of a closed hyperbolic surface F canonically determines a "centered dual decomposition" of F: a cell structure with vertex set S, geodesic edges, and 2-cells that are unions of the corresponding Delaunay polygons. Unlike a Delaunay polygon, a centered dual 2-cell Q is not determined by its collection …

2011-03-23abs ↗pdf ↗

Quantized Variational Inference improves ELBO optimization with fast convergence.

problem Maximizing Evidence Lower Bound (ELBO) for variational inference.
method Optimal Voronoi Tesselation for variance-free gradients, Richardson extrapolation for asymptotic improvement.
result Quantized Variational Inference leads to fast convergence with comparable computational cost.