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

12.5%25.0%37.5%50.0% · Sep 199319922001200920172026
48 results for maximum volume algorithm

Derives a new maximum principle for Riemannian manifolds with volume growth constraints.

problem Maximum principles for functions on Riemannian manifolds with specific volume growth conditions.
method Derives a new maximum principle using vector fields and divergence conditions.
result Applies the principle to Bernstein-type results and existence of minimal submanifolds.

Proves a conjecture about the maximum tet-volume of triangulations of a 2-sphere.

problem Proving the conjectured maximum tet-volume for all triangulations of a 2-sphere.
method Simplified version of Mathieu and Thurston's combinatorial proof using more general volume notions.
result Proves the full conjecture about the maximum tet-volume for all triangulations of a 2-sphere.

The maximum hyperbolic polyhedron volume is found to be the rectification of its skeleton.

problem Finding the maximum volume of hyperbolic polyhedra with given combinatorics.
method Applying a volume-increasing flow to any hyperbolic polyhedron, handling degeneracies carefully.
result The supremum volume is always the volume of the rectification of the 1-skeleton.

In this paper, we show that Gromov-Thurston's principle works for hyperbolic 3-manifolds of infinite volume and with finitely generated fundamental group. As an application, we have a new proof of Ending Lamination Theorem. Our proof essentially relays only on Maximum Volume Law for hyperbolic 3-simplices.

2019-06-03abs ↗pdf ↗

Weaving knots are alternating knots with the same projection as torus knots, and were conjectured by X.-S. Lin to be among the maximum volume knots for fixed crossing number. We provide the first asymptotically correct volume bounds for weaving knots, and we prove that the infinite weave is their geometric limit.

2015-06-10abs ↗pdf ↗

We propose an approach to find constant curvature metrics on triangulated closed 3-manifolds using a finite dimensional variational method whose energy function is the volume. The concept of an angle structure on a tetrahedron and on a triangulated closed 3-manifold is introduced following the work of Casson, Murakami …

2005-04-04abs ↗pdf ↗

The paper introduces a new price model based on entropy that better fits high-frequency market data.

problem Understanding fair prices in high-frequency markets with bid-ask imbalance.
method A parametrized family of prices derived from the Maximum Entropy Principle, minimizing bias given volume imbalance.
result The model can generate higher kurtosis and heavy-tailed distributions compared to standard models.

Study shows spheres in high dimensions have maximum volume if they are smooth and have a specific reach.

problem Finding the maximum volume of a smooth submanifold in Euclidean space.
method Using the concept of reach and volume, the study proves a volume inequality for submanifolds with a specific reach.
result Smooth submanifolds in Euclidean space have maximum volume if their reach is 1 and they are congruent to a unit sphere.

How large can be the width of Riemannian three-spheres of the same volume in the same conformal class? If a maximum value is attained, how does a maximising metric look like? What happens as the conformal class changes? In this paper, we investigate these and other related questions, focusing on the context of Simon-Sm…

2018-09-10abs ↗pdf ↗

Given a compact Alexadrov nn-space ZZ with curvature curv κ\ge κ, and let f:ZXf: Z\to X be a distance non-increasing onto map to another Alexandrov nn-space with curv κ\ge κ. The relative volume rigidity conjecture says that if XX achieves the relative maximal volume i.e. vol(Z)=vol(X)vol(Z)=vol(X), then XX is isometric to $…

2011-06-23abs ↗pdf ↗

Method identifies regions of maximum dissimilarity in stochastic processes.

problem Comparing local characteristics of two random processes to find periods of maximum dissimilarity.
method Bayesian inference with integrated nested Laplace approximation for stochastic processes.
result Identifies regions of maximum dissimilarity with a certain volume.

Researchers calculate the volume of Seifert representations for graph manifolds and their covers.

problem Computing the volume of Seifert representations for graph manifolds and their finite covers.
method Established an effective formula for computing the volume of Seifert representations of graph manifolds and obtained restrictions analogous to the Milnor–Wood inequality.
result The Seifert volume of any graph manifold is a rational multiple of π², and the supremum ratio of the Seifert volume over the covering degree can be positive or infinite.

The Schwarz--Pick lemma is a fundamental result in complex analysis. It is well-known that Yau generalized it to the higher dimensional manifolds by applying his maximum principle for complete Riemannian manifolds. Jeffres obtained Schwarz lemma for volume forms of conical Kähler metrics, based on a barrier function an…

2016-10-06abs ↗pdf ↗

We consider the volume-normalized Ricci flow close to compact shrinking Ricci solitons. We show that if a compact Ricci soliton (M,g)(M,g) is a local maximum of Perelman's shrinker entropy, any normalized Ricci flow starting close to it exists for all time and converges towards a Ricci soliton. If gg is not a local maxim…

2014-03-14abs ↗pdf ↗

It is our purpose to study complete self-shrinkers in Euclidean space. First of all, we show some examples of complete self-shrinkers without polynomial volume growth. By making use of the generalized maximum principle for L\mathcal{L}-operator, we give a complete classification for 2-dimensional complete self-shrinke…

2015-04-09abs ↗pdf ↗

Graphs with nonnegative Bakry-Émery curvature have volume doubling and Poincaré inequalities.

problem Proving properties of graphs with specific curvature conditions.
method Graph-theoretic modified nonlinear heat-flow method, including point-mass consequences and diffusive exit-time control.
result Volume doubling and Poincaré inequalities for graphs with nonnegative Bakry-Émery curvature.

Proves necessity of at least log2(n) layers to compute maximum of n numbers.

problem Computing the maximum of n numbers with ReLU neural networks.
method Uses lattice polytopes and duality with Newton polytopes to prove depth lower bounds.
result Proves that log2(n) hidden layers are necessary and sufficient.

A new algorithm learns diverse policies in reinforcement learning.

problem Learning diverse behaviors in reinforcement learning.
method Proposes Maximum Entropy Diverse Exploration (MEDE) algorithm.
result The set of policies learned by MEDE capture the same modalities as the optimal maximum entropy policy.

It is our purpose to study complete self-shrinkers in Euclidean space. By introducing a generalized maximum principle for L\mathcal{L}-operator, we give estimates on supremum and infimum of the squared norm of the second fundamental form of self-shrinkers without assumption on \emph{polynomial volume growth}, which is…

2012-02-06abs ↗pdf ↗

We study some basic problems of translating solitons: the volume growth, generalized maximum principle, Gauss maps and certain functions related to the Gauss maps, finally we carry out point-wise estimates and integral estimates for the squared norm of the second fundamental form. Those estimates give rigidity theorems…

2014-10-19abs ↗pdf ↗

Using an idea of Voronoi in the geometric theory of positive definite quadratic forms, we give a transparent proof of John's characterization of the unique ellipsoid of maximum volume contained in a convex body. The same idea applies to the 'hard part' of a generalization of John's theorem and shows the difficulties of…

2012-07-31abs ↗pdf ↗

Consider vector valued harmonic maps of at most linear growth, defined on a complete non-compact Riemannian manifold with non-negative Ricci curvature. For the norm square of the pull-back of the target volume form by such maps, we report a strong maximum principle, and equalities among its supremum, its asymptotic ave…

2018-01-08abs ↗pdf ↗

The paper investigates topic models, ensuring their statistical identifiability and accuracy.

problem Lack of formal theoretical investigation of topic model identifiability and estimation accuracy.
method Proposes a maximum likelihood estimator (MLE) based on integrated likelihood, introducing new geometric identifiability conditions.
result Introduces weaker conditions for topic model identifiability, allowing a broader investigation.

Time and Sales of corn futures traded electronically on the CME Group Globex are studied. Theories of continuous prices turn upside down reality of intra-day trading. Prices and their increments are discrete and obey lattice probability distributions. A function for systematic evolution of futures trading volume is pro…

2017-04-03abs ↗pdf ↗

Geodesic balls in a simply connected space forms Sn\mathbb{S}^n, Rn\mathbb{R}^{n} or Hn\mathbb{H}^{n} are distinguished manifolds for comparison in bounded Riemannian geometry. In this paper we show that they have the maximum possible boundary volume among Miao-Tam critical metrics with connected boundary provided that…

2017-06-22abs ↗pdf ↗

For massive data, the family of subsampling algorithms is popular to downsize the data volume and reduce computational burden. Existing studies focus on approximating the ordinary least squares estimate in linear regression, where statistical leverage scores are often used to define subsampling probabilities. In this p…

2017-02-03abs ↗pdf ↗

Improved text summarization using belief propagation on weighted bipartite graphs.

problem Text summarization from a graph theory perspective.
method Generalized belief propagation algorithm for weighted bipartite graphs.
result Our algorithm outperforms greedy methods in text summarization tasks.

This paper optimizes subsampling for large datasets using Poisson distribution.

problem Efficiently subsample large datasets for quasi-likelihood estimation.
method Derives optimal Poisson subsampling probabilities and develops a distributed subsampling framework.
result Consistent and asymptotically normal estimators are obtained.