The paper examines geometric curvatures in generalized Riemannian spaces.
problem Understanding the physical meaning of scalar curvatures in generalized Riemannian spaces.
method Developed Madsen's formulae for pressures and energy-densities, analyzed with different concepts of generalized Riemannian spaces.
result Linearities of energy-momentum tensor, pressure, energy-density, and state-parameter are examined.
The paper studies geometric properties of hydrodynamical density manifolds.
problem Understanding the geometry of hydrodynamical density manifolds.
method Formulating connections, gradients, Hessians, parallel transports, and curvatures on these manifolds.
result Closed-form formulas for sectional curvatures in one-dimensional density manifolds.
Researchers calculate the Laplace transform of a geometric Brownian motion integral.
problem Calculating the Laplace transform of a specific integral functional of geometric Brownian motion.
method Analytical calculation of the Laplace transform of the cumulative distribution and probability density functions.
result The Laplace transform of the integral functional of geometric Brownian motion is derived.
The density conjecture of Bers, Sullivan and Thurston predicts that each complete hyperbolic 3-manifold M with finitely generated fundamental group is an algebraic limit of geometrically finite hyperbolic 3-manifolds. We prove that the conjecture obtains for each complete hyperbolic 3-manifold with no cusps and incompr…
The paper analyzes geometric densities and compression radii for knot types.
problem Optimizing geometric quantities associated with knot types.
method Develops a factorization framework for scale-covariant size functionals.
result Different minimizing sequences for density, compression, packing, and ropelength problems.
We recently discovered a relationship between the volume density spectrum and the determinant density spectrum for infinite sequences of hyperbolic knots. Here, we extend this study to new quantum density spectra associated to quantum invariants, such as Jones polynomials, Kashaev invariants and knot homology. We also …
Study on packing links with geometric constraints.
problem Maximizing link density in space with geometric restrictions.
method Investigates packing essential links within Euclidean space.
result Upper bounds on maximal density are found, but are large.
Normal-bundle bootstrap generates new data preserving geometric structure.
problem Probabilistic models often exhibit salient geometric structure.
method NBB method decomposes probability measure into manifold and normal spaces, estimates manifold as density ridge, and generates new data by bootstrapping projection vectors.
result NBB generates new data that preserves the geometric structure of a given data set.
Method flattens complex surfaces with consistent density and shape.
problem Shape deformations and local geometric distortions in density-equalizing maps for multiply-connected surfaces.
method Formulates density diffusion as a quasiconformal flow, solving an energy minimization problem involving the Beltrami coefficient to ensure bijectivity and control distortion.
result Achieves optimal parameterization of multiply-connected surfaces with bijective and controlled geometric distortions.
MCBP detects boundaries in high-dimensional data using curvature.
problem Boundary detection in high-dimensional data.
method MCBP uses mean curvature to model data manifold curvature.
result MCBP improves clustering performance in complex scenarios.
New method uses geometric properties for better density estimation.
problem Uncertainty quantification in ambiguous tasks.
method Winner-takes-all training with centroidal Voronoi tessellations.
result Improved quantization and density estimation.
Study recovers Riemannian quantities from noisy data densities.
problem Recovering geometric structure from noisy data on submanifolds.
method Derive uniform small-noise expansions of noisy density and its derivatives; construct estimators for tangent spaces, intrinsic dimension, and second fundamental form.
result Fundamental Riemannian quantities identifiable from density derivatives.
Using the notion of vacuum pairs we show how the (square of the) mass matrix of the fermions can be considered geometrically as curvature. This curvature together with the curvature of space-time, defines the total curvature of the Clifford module bundle representing a ``free'' fermion within the geometrical setup of s…
The paper proposes methods for volumetric parameterization of 3D solid manifolds.
problem Complex structure of solid manifolds makes conventional approaches ineffective.
method Incorporates models to preserve geometric structure, achieve density equalization, and balance distortions.
result Various 3D manifold parameterizations with different properties can be achieved.
We prove a generalization of the fundamental inequality of Guivarc'h relating entropy, drift and critical exponent to Gibbs measures on geometrically finite quotients of CAT(-1) metric spaces. For random walks with finite superexponential moment, we show that the equality is achieved if and only if the Gibbs density is…
Estimating dimension from sparse random geometric graphs.
problem Estimating the dimension of the underlying space from a random geometric graph.
method An estimator of dimension is derived using the adjacency matrix of the graph, under specific conditions on the density and threshold.
result An estimator converges to the true dimension with high probability under certain conditions.
New Crofton formulae derived from existing ones.
problem Generalizing Crofton formulae for products.
method Calculations in the ring of normal densities.
result Generalizations of Crofton formulae in terms of mixed Riemannian volume.
In this paper we extend Thurston's hyperbolic Dehn surgery theorem to a class of geometrically infinite hyperbolic 3-manifolds. As an application we prove a modest density theorem for Kleinian groups. We also discuss hyperbolic Dehn surgery on geometrically finite hypebolic cone-manifolds.
We extend the geometric Hamilton-Jacobi formalism for hamiltonian mechanics to higher order field theories with regular lagrangian density. We also investigate the dependence of the formalism on the lagrangian density in the class of those yelding the same Euler-Lagrange equations.
The algebra of densities $\Den(M)$ is a commutative algebra canonically associated with a given manifold or supermanifold M. We introduced this algebra earlier in connection with our studies of Batalin--Vilkovisky geometry. The algebra $\Den(M)$ is graded by real numbers and possesses a natural invariant scalar produ…
Properties of steady compressible flow for which geometric constraints have been placed on the potential function are derived, under hypotheses on the flow density and the singular set. Some related unconstrained problems are also considered, including the estimation of a class of fields having nonzero vorticity.
The paper defines and studies discrete p-density and compression-radius profiles of lattice knots.
problem Understanding geometric properties of lattice knots.
method Develops a framework for discrete p-density and compression-radius profiles of lattice knots, studying them on length-filtered sets and finite move-graph exploration.
result Density and compression-radius values are not monotone, illustrating distinct optimization problems.
We introduce a geometric framework to study Newton's equations on infinite-dimensional configuration spaces of diffeomorphisms and smooth probability densities. It turns out that several important PDEs of hydrodynamical origin can be described in this framework in a natural way. In particular, the Madelung transform be…
Skeleton clustering detects clusters in high-dimensional data without needing prototypes.
problem Detecting clusters in high-dimensional data with irregular shapes.
method Skeleton clustering combines prototype methods, density-based clustering, and hierarchical clustering using surrogate density measures.
result Skeleton clustering reliably detects clusters in multivariate and high-dimensional data.
We suggest an algorithm allowing to obtain some new integral-geometric formulae from the existing formulae of Crofton type. These new formulae are applied to get smooth versions of BKK theorem. The algorithm is based on the calculations in the ring of normal densities on a manifold.
Introduces q-paths for generalizing geometric annealing paths in machine learning.
problem Limited applicability of existing path methods in machine learning.
method Develops a family of paths derived from a generalized mean, including geometric and arithmetic mixtures.
result Empirical gains in Bayesian inference and generative model evaluation.
A graph clustering method that moves nodes to highest-degree neighbors.
problem Graph clustering for data with Morse regularity.
method Max-degree hill-climbing on graph nodes.
result Asymptotically consistent for random geometric graphs.
New geometric analysis of PWSPDs balances density and geometry in high-dimensional data.
problem Balancing density and geometry in high-dimensional data.
method Power-weighted shortest-path distances (PWSPDs) and their geometric and computational analyses.
result High probability guarantees on the equivalence of PWSPDs on complete and nearest neighbor graphs.
The geometric approach to optimal transport and information theory has triggered the interpretation of probability densities as an infinite-dimensional Riemannian manifold. The most studied Riemannian structures are Otto's metric, yielding the L2-Wasserstein distance of optimal mass transport, and the Fisher--Rao me…
This paper proposes a geometric estimator of dependency between a pair of multivariate samples. The proposed estimator of dependency is based on a randomly permuted geometric graph (the minimal spanning tree) over the two multivariate samples. This estimator converges to a quantity that we call the geometric mutual inf…
A novel method compares 3D point clouds using information geometry.
problem Comparing 3D point clouds in machine learning applications.
method Interprets point clouds as probability density functions on a statistical manifold, using GMM and Modified Symmetric KL divergence.
result Demonstrates effectiveness through various case studies.
Estimates mixing coefficients of geometrically ergodic Markov processes from a single sample path.
problem Estimating mixing coefficients of geometrically ergodic Markov processes.
method Proposes methods to estimate β-mixing coefficients from a single sample path under standard smoothness conditions. result Obtains a rate of convergence of order \(\mathcal{O}(\log(n) n^{-[s]/(2[s]+2)})\) for the expected error of the estimator.
In this paper we investigate the geometry of the likelihood of the unknown parameters in a simple class of Bayesian directed graphs with hidden variables. This enables us, before any numerical algorithms are employed, to obtain certain insights in the nature of the unidentifiability inherent in such models, the way pos…
Modes and ridges of the probability density function behind observed data are useful geometric features. Mode-seeking clustering assigns cluster labels by associating data samples with the nearest modes, and estimation of density ridges enables us to find lower-dimensional structures hidden in data. A key technical cha…
We derive and analyze a generic, recursive algorithm for estimating all splits in a finite cluster tree as well as the corresponding clusters. We further investigate statistical properties of this generic clustering algorithm when it receives level set estimates from a kernel density estimator. In particular, we derive…
We prove that monotonicity of density and energy inequality imply the rectifiability of the singular sets for Yang-Mills flow.
Solves a general class of free boundary Monge-Ampère equations.
problem Optimal transport with degenerate densities and geometric problems.
method Analyzes a specific class of Monge-Ampère equations and their applications.
result Solves the equations for a general class, including applications to optimal transport and geometric problems.
Introduces new info-geometric structure for dynamics on graphs and hypergraphs.
problem Modeling dynamics on discrete structures like graphs and hypergraphs.
method Introduces two dually flat structures: one on vertex space and another on edge space.
result Extends gradient flows to include nonequilibrium dynamics.
Stable solutions to a specific equation are one-dimensional.
problem Stability and dimensionality of solutions to the Allen-Cahn equation.
method Analysis of stable solutions with bounded energy density.
result Stable solutions to the Allen-Cahn equation are one-dimensional.
SLS optimizes minimum-volume regions for conditional quantiles, bypassing density estimation.
problem Constructing minimum-volume prediction regions that satisfy conditional coverage.
method Super-level-set regression (SLS) directly optimizes geometric boundaries of conditional level sets.
result SLS optimizes regions directly, capturing complex conditional structures end-to-end.
G-GLN extends GLNs to multiple regression and density modeling.
problem Learning features in deep neural networks.
method G-GLN uses a distributed and local credit assignment mechanism based on optimizing a convex objective.
result G-GLN achieves competitive or state-of-the-art performance on regression benchmarks.
New method clusters large datasets using geometric properties.
problem Clustering large datasets using DBSCAN* and HDBSCAN* is infeasible.
method Exploiting Euclidean space geometry, systematically construct clusters from subsets of data.
result Clusters of large datasets are possible with controlled subset sizes.
New method uses SoS densities and α-divergences for efficient sequential transport maps.
problem Efficiently generating samples from approximated densities.
method Sequential transport maps using Sum-of-Squares (SoS) densities and α-divergences.
result Convex optimization problems with efficient semidefinite programming solutions.
Study classifies mappings of bivariate normal densities, revealing three types with distinct geometric and statistical properties.
problem Understanding the properties of two-component bivariate normal mixtures.
method Classification via A-equivalence and statistical analysis. result Three distinct types of mappings with specific geometric and statistical properties, and upper bounds for the number of modes.
Markov Chain Monte Carlo methods become increasingly popular in applied mathematics as a tool for numerical integration with respect to complex and high-dimensional distributions. However, application of MCMC methods to heavy tailed distributions and distributions with analytically intractable densities turns out to be…
Paper proves stronger Penrose inequality with matter density.
problem Proves Penrose inequality with nonnegative matter density.
method Uses conformal flow and harmonic level set techniques.
result Total mass is at least black hole mass plus matter density contribution.
New geometric interpretation of Amari-Cencov α-connections on probability densities.
problem Geometric interpretation of Amari-Cencov α-connections on probability densities.
method Riemannian metrics and Levi-Civita connections.
result Geodesics of α-connections are energy-minimizing curves.
A 3D space of hyperbolic manifolds is connected but not path-connected.
problem Proving connectivity and non-path-connectedness of framed hyperbolic 3-manifolds.
method Two proofs using density theorems for Kleinian groups, constructing dense sets of framings, and discussing paths.
result The space of framed infinite volume hyperbolic 3-manifolds is not path-connected.