New Wintgen inequality for statistical surfaces discovered.
problem Extending Wintgen inequality to statistical surfaces.
method Applied Wintgen inequality framework to statistical surfaces.
result Established Wintgen inequality for statistical surfaces.
GOE statistics emerge from surface moduli space averages.
problem Understanding spectral statistics on hyperbolic surfaces.
method Defined a smooth linear statistic, averaged over moduli space, and analyzed variance.
result GOE statistics are recovered in the large genus and high energy limits.
Study geodesic paths on flat surfaces, comparing length and singularity counts.
problem Comparing geometric length and singularity counts on geodesic paths.
method Apply counting limit laws to infinite graphs and then to flat surfaces.
result Statistical comparison of geometric length and singularity counts on geodesic paths.
Study smooth linear statistics on random covers of hyperbolic surfaces, showing central limit and variance results.
problem Analyzing fluctuations and energy variance of random covers of compact hyperbolic surfaces.
method Examining fluctuations in a small energy window around a fixed energy level, considering the variance of a typical surface, using a double limit where n and L go to infinity. result Distribution of fluctuations tends to a Gaussian with variance of GOE/GUE, and energy variance of a typical random n-cover is that of GOE/GUE. Polynomial decay of correlations shown for curved surfaces.
problem Analyzing geodesic flows on curved surfaces.
method Proving polynomial decay of correlations for geodesic flows on nonpositively curved surfaces.
result Polynomial decay of correlations for geodesic flows on nonpositively curved surfaces.
Study on length distribution of random multicurves on large genus surfaces converging to Poisson-Dirichlet distribution.
problem Length statistics of random multicurves on large genus hyperbolic surfaces.
method Analytical proof of convergence to Poisson-Dirichlet distribution as genus tends to infinity.
result Mean lengths of the three longest components converge to specific percentages of total length as genus increases.
Study shows energy levels on hyperbolic surfaces follow GOE fluctuations.
problem Understanding energy level fluctuations on hyperbolic surfaces.
method Analysis of Laplace eigenvalues on hyperbolic surfaces, using GOE random matrix theory.
result Energy variance on typical hyperbolic surfaces closely matches GOE fluctuations.
The paper shows Gaussian fluctuations in eigenvalue statistics of random hyperbolic surfaces.
problem Understanding fluctuations in Laplace eigenvalues of random hyperbolic surfaces.
method Analyzing fluctuations of linear statistics of Laplace eigenvalues over moduli space of surfaces of large genus.
result The distribution of linear statistics tends to a Gaussian as the genus of surfaces increases.
CNNs generalize well despite learning surface statistical regularities.
problem CNNs' extreme sensitivity to adversarial examples raises doubts about learning high-level abstractions.
method Fourier filtering to construct datasets with same high-level abstractions but different surface statistics.
result CNNs exhibit a tendency to learn surface statistical regularities, leading to a 28% generalization gap.
New statistical convex-cocompactness found for non-orientable surfaces.
problem Understanding the dynamics of mapping class groups on non-orientable surfaces.
method Using Teichmüller space and complexity length, showing geodesics leave compact regions with exponentially low probabilities.
result Statistical convex-cocompactness of mapping class groups on non-orientable surfaces.
Experimental evidence for curve ratios on genus two surfaces.
problem Determining the ratio of topological curve types on surfaces.
method Experimental statistics applied to Mirzakhani's genus two surface results.
result Separating and non-separating curves occur in the ratio 1:48.
A method for reconstructing surfaces from sparse 3D points using statistical shape models.
problem Reconstructing surfaces from sparse 3D point clouds, especially in medical applications.
method Formulate surface reconstruction as a probabilistic problem using Gaussian Mixture Models (GMM) with anisotropic covariances oriented by surface normals.
result Superior accuracy and robustness on sparse data compared to Iterative Closest Points method.
Study on random hyperbolic surfaces with many cusps, focusing on tight geodesics.
problem Understanding length statistics of geodesics on random hyperbolic surfaces with cusps.
method Recursion formula for tight Weil-Petersson volumes and generalization of Mirzakhani's integration formula.
result Recovery of Poisson point process in large genus limit for length statistics of tight geodesics.
Novel algorithm PSO improves density estimation for multimodal data.
problem Data log-density estimation for multimodal distributions.
method Probabilistic Surface Optimization (PSO) using virtual stochastic forces.
result PSO-LDE achieves superior log-density estimation accuracy.
Study shows twist tori equidistribute in moduli space, with other families having singular distributions.
problem Statistical behavior of twist tori in moduli space of hyperbolic surfaces.
method Analyzing expanding families of twist tori and their limiting distributions.
result Equidistribution of twist tori to a Lebesgue measure, with other families having singular distributions.
Paper proposes a method to compare vector fields across surfaces, useful for analyzing brain folding patterns.
problem Comparing vector fields across surfaces of different geometries is challenging.
method The paper introduces a framework to transport vector fields onto a common space using differential geometry.
result The proposed framework enables the computation of statistics on vector fields, demonstrating its effectiveness in analyzing brain folding patterns.
Random Matrix Theory explains loss surface Hessians in neural networks.
problem Understanding the loss surfaces of neural networks.
method Investigation of local spectral statistics of neural network Hessians.
result Excellent agreement with Gaussian Orthogonal Ensemble statistics.
The paper studies counting problems on square-tiled surfaces.
problem Understanding the frequency of properties in square-tiled surfaces.
method Examining properties of the square torus and their implications in translation surfaces.
result Implications between properties and their frequency in translation surfaces.
Study characterizes bladder motion using dynamic MRI and statistical analysis.
problem Limited volume coverage in dynamic MRI sequences hinders 3D shape reconstruction.
method 3D dense velocity measurements, LDDMM framework, statistical characterization, mean curvature changes, surface deformation analysis.
result Stable shape descriptor for characterizing bladder surface dynamics.
Random geodesics on curved surfaces form a pattern similar to random lines.
problem Understanding the geometry of random paths on curved surfaces.
method Scaling and analysis of tessellations induced by long geodesics.
result The global statistics of tessellations approach those of a Poisson line process.
Method controls extrapolation in prediction profiles for statistical and machine learning models.
problem Avoiding invalid predictions due to extrapolation in prediction profiles.
method Genetic algorithm optimization over constrained factor regions.
result Optimal factor settings without constraint are often invalid and extrapolated.
The paper analyzes LETF option markets using moneyness scaling to find statistical arbitrage opportunities.
problem Statistical discrepancies between levered and unlevered ETF option implied volatility smiles.
method Bootstrap uniform confidence bands, dynamic semiparametric factor model, moneyness scaling, Heston stochastic volatility.
result Trading opportunities exist on LETF market, and a statistical arbitrage strategy generates positive returns.
Study classifies submanifolds in probability simplex.
problem Classifying submanifolds in the probability simplex.
method Complete classification through geometric analysis.
result Doubly totally-umbilical submanifolds identified and classified.
Geomstats introduces shape module for analyzing shapes of objects.
problem Analyzing shapes of objects represented as landmarks, curves, and surfaces.
method Implementing shape spaces, group actions, fiber bundles, quotient spaces, and Riemannian metrics.
result Users can compare, average, and interpolate shapes inside shape spaces.
Improved agnostic learning time via Gaussian surface area analysis.
problem Learning polynomial threshold functions under Gaussian marginals.
method Improvement of polynomial degree required for approximation.
result Near optimal bounds on agnostic learning complexity.
This review assesses statistical and machine learning methods for coral bleaching.
problem Coral bleaching due to rising sea temperatures and environmental factors.
method Statistical and machine learning models for predicting and analyzing coral bleaching.
result Statistical and machine learning methods are crucial for effective reef management.
New method calculates winding of geodesics on surfaces.
problem Understanding the distribution of geodesics on surfaces.
method Introducing a new construction of winding numbers for geodesics on cusped hyperbolic orbifolds.
result Winding numbers can be expressed by Rademacher symbols for various arithmetic families of surfaces.
Sig-PCA integrates model outputs and observations to correct model biases.
problem Improving model accuracy and reliability by correcting biases and numerical approximations.
method Sig-PCA framework that combines summary statistics from model outputs with localized observations via a neural network.
result Corrects model outputs to align closely with observational data, preserving essential statistical information.
Improved bounds on a function linking geodesics to moduli spaces.
problem Understanding geodesics on hyperbolic surfaces.
method Analyzing the Mirzakhani function and its behavior near cusps.
result The function is square-integrable with respect to the Weil-Petersson volume form.
Algorithm estimates Gaussian parameters under unknown truncation sets.
problem Estimating Gaussian parameters when samples are truncated to unknown sets.
method Efficient algorithm for arbitrary unknown truncation sets, using Gaussian surface area as complexity measure.
result Algorithm works for large families of sets including intersections of halfspaces and general convex sets.
Develops radiant structures for statistical manifolds.
problem Statistical manifolds with radiant vector fields.
method Formulates Einstein equations for special statistical structures.
result Conelike radiant structures exist and have canonical normalizations.
The paper reviews statistical models for high-dimensional normalized vectors.
problem Handling directional data in machine learning.
method Review of mathematical models for normalized vectors on hypersphere and real projective plane.
result Common models and technical aspects are discussed.
Asymptotics for equidistribution of circles on hyperbolic surfaces.
problem Equidistribution of circles on hyperbolic surfaces.
method Spectral method and statistical limit theorems.
result Precise asymptotics for the rate of equidistribution of circles.
Random translation surfaces converge to a Poisson plane as genus grows.
problem Understanding the geometric behavior of high genus translation surfaces.
method Proving convergence of random translation surfaces to a Poisson plane using statistical local geometric properties.
result The radius-r neighborhood of a random point in an MSV-distributed random translation surface converges in distribution to the radius r neighborhood of the root in a Poisson translation plane. Study on liquidity dynamics in Uniswap v3 pools using statistical methods.
problem Characterize liquidity in Uniswap v3 pools.
method Functional principal component analysis (FPCA) and dynamic factor methods.
result Liquidity dynamics in Uniswap v3 pools are well-captured by a low-order Legendre polynomial basis.
Paper extends tree bijection for hyperbolic surfaces without requiring cusps.
problem Computing volumes and distances on hyperbolic surfaces without cusps.
method Extend tree bijection to half-tight cylinders, using Busemann function.
result Tree bijection can now be applied to surfaces without cusps.
Study on lengths of random multicurves on hyperbolic surfaces.
problem Distribution of lengths of random multicurves on closed hyperbolic surfaces.
method Using Margulis' thesis and Mirzakhani's equidistribution theorem for horospheres.
result Distribution of lengths admits a polynomial density, with coefficients expressible in terms of intersection numbers of psi-classes.
We introduce a polynomial invariant of graphs on surfaces, PG, generalizing the classical Tutte polynomial. Topological duality on surfaces gives rise to a natural duality result for PG, analogous to the duality for the Tutte polynomial of planar graphs. This property is important from the perspective of statisti…
Dynamic functional time-series methods improve forecast accuracy for foreign exchange implied volatility surfaces.
problem Forecasting implied volatility surfaces in foreign exchange markets.
method Dynamic functional principal component analysis and multivariate functional time-series methods.
result Dynamic univariate functional time-series method shows the greatest improvement in forecast accuracy.
New study shows deep networks generalize well due to loss surface geometry.
problem Why deep networks generalize well despite many parameters.
method Analyzed local geometry of loss surface and its effect on SGD.
result SGD stays close to low-dimensional subspace, leading to better generalization bounds.
New change surfaces for multidimensional changes and counterfactuals.
problem Limited expressiveness of standard changepoint models in multidimensional settings.
method Model-agnostic formalization of change surfaces, using Gaussian Process Change Surfaces (GPCS).
result Discovery of complex, heterogeneous changes in measles incidence and lead testing kit requests.
Dual-stage sEMG classification improves gesture recognition accuracy.
problem Improving accuracy in hand gesture recognition from sEMG signals.
method Dual-stage classification approach: first stage groups similar activities, second stage classifies within groups.
result Dual-stage classification yields significantly higher accuracy than single-stage approach.
Lower bound shows super-polynomial gap for estimating truncated Gaussian means.
problem Estimating mean of truncated Gaussian distribution with limited samples.
method Statistical Query (SQ) lower bounds for learning.
result Super-polynomial information-computation gap for the task.
We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive because any network can be embedded on a surface with sufficiently high genus. The…
Discovering topological quantum field theories in 2+1 and 3+1 dimensions.
problem Exploring topological orders in condensed matter lattice models.
method Calculating braiding statistics and link invariants of anyon excitations.
result Identifying new spin topological quantum field theories with specific knot/link invariants.
A bijection proves a polynomial volume for genus-0 hyperbolic surfaces with boundaries.
problem Proving the Weil-Petersson volume polynomial in boundary lengths for genus-0 surfaces.
method Generalizing a tree bijection to handle geodesic boundaries, extending spine construction.
result Explicit formula for three-point function in Weil-Petersson random surfaces.
Paper shows ergodicity and irreducibility of mapping class group boundary representation.
problem Ergodicity and irreducibility of mapping class group boundary representation.
method Statistical hyperbolicity and classical result of Masur generalization.
result Boundary representation of mapping class group is ergodic and irreducible.
Paper shows SBMs are like surface tension problems, aiding network clustering.
problem Cluster network nodes into communities with dense internal connections.
method Used maximum likelihood estimation and network analogs of surface-tension algorithms.
result Successfully recovered planted community structure in synthetic networks.