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

149298446595 · Jun 202019922001200920172026
48 results for phase space density

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…

2017-11-01abs ↗pdf ↗

New findings confirm parallels to De Giorgi's conjecture for phase transitions in higher dimensions.

problem Understanding phase transitions with bounded index in higher-dimensional spaces.
method Establishing parallels to De Giorgi's conjecture for general solutions of bounded Morse index.
result Finite index solutions to the Allen--Cahn equation in R4\mathbb{R}^4 are one-dimensional, and this holds for all 4n74 \leq n \leq 7.

Study proves existence of a specific type of flow in geometry.

problem Existence of canonical multi-phase free boundary Brakke flows.
method Global-in-time existence established using Brakke flow and uniform density ratio assumption.
result Existence of the flow with no positive mass on the free boundary for some short time.

New study shows low-degree polynomial algorithms struggle at clause densities close to Fix's.

problem Finding satisfying assignments in random k-SAT formulas at high clause densities.
method Analysis of low-degree polynomial algorithms and a new many-way overlap gap property.
result No efficient algorithms can find satisfying assignments at clause densities close to Fix's.

Importance sampling is one of the most widely used variance reduction strategies in Monte Carlo rendering. In this paper, we propose a novel importance sampling technique that uses a neural network to learn how to sample from a desired density represented by a set of samples. Our approach considers an existing Monte Ca…

2018-08-23abs ↗pdf ↗

Study on combustion theory solutions, proving nondegeneracy and stability in limit.

problem One-phase singular perturbation problem in combustion theory.
method Introduce density condition to preserve nondegeneracy, classify stable solutions.
result Global stable solutions have flat level sets in dimensions ≤ 4.

We study optimal estimation for sparse principal component analysis when the number of non-zero elements is small but on the same order as the dimension of the data. We employ approximate message passing (AMP) algorithm and its state evolution to analyze what is the information theoretically minimal mean-squared error …

2015-03-01abs ↗pdf ↗

Study phase transitions in noisy transformer dynamics on spheres.

problem Understanding phase transitions in noisy transformer dynamics on spheres.
method Sharp Beckner--Onofri/logarithmic HLS inequality, Funk--Hecke/Bessel coefficients, degree-two quartic obstruction.
result Sharp global-minimizer dichotomy and phase transitions in noisy transformer dynamics in arbitrary dimension.

We construct a lagrangian geometric formulation for first-order field theories using the canonical structures of first-order jet bundles, which are taken as the phase spaces of the systems in consideration. First of all, we construct all the geometric structures associated with a first-order jet bundle and, using them,…

1995-05-17abs ↗pdf ↗

We study the phase transition of dynamical herd behaviors for the yen-dollar exchange rate in the Japanese financial market. It is obtained that the probability distribution of returns satisfies the power-law behavior with three different values of the scaling exponent 3.11 (one time lag ττ = 1 minute), 2.81 (30 minut…

2004-08-28abs ↗pdf ↗

The Sinkhorn-Knopp algorithm converges quickly but the number of iterations is poorly understood.

problem Understanding the number of iterations required for the Sinkhorn-Knopp algorithm to converge.
method Analyzing the Sinkhorn-Knopp algorithm for matrices with a specific density threshold.
result The Sinkhorn-Knopp algorithm requires Ω(n1/2/ε)Ω(n^{1/2}/\varepsilon) iterations for matrices with density γ<1/2γ<1/2.

Machine learning predicts critical points for directed percolation models.

problem Determining critical points for directed percolation models.
method Supervised and unsupervised machine learning algorithms (CNN and DBSCAN) were used.
result Machine learning accurately predicts critical points for both models.

New method uses transport maps for efficient Bayesian inference.

problem Efficiently perform sequential Bayesian inference of static model parameters.
method Estimation of structured transport maps to extract conditional distributions.
result Gradient-based characterization of posterior density for online parameter estimation.

The article applies Occam's Razor to non-parametric model building, minimizing the number of bits for data encoding.

problem Overlooking the role of model parameters in data encoding leads to inefficient probability density estimators.
method Extends bit counting to model parameters, providing a true measure of complexity for parametric models.
result Minimizing total bit requirement leads to smoother, more efficient probability density estimates and fewer relevant parameters.

New proof confirms De Giorgi's conjecture about phase-field approximation of Willmore functional.

problem Proving a conjecture about the phase-field approximation of the Willmore functional.
method Using Γ-convergence and properties of the Allen-Cahn energy and its variations.
result The original De Giorgi conjecture holds with k=0.

PolarBM models complex-valued audio signals in polar coordinates, improving over conventional methods.

problem Discarding structural information in complex-valued problems simplifies models but loses important amplitude-phase relationships.
method Proposes PolarBM, a novel Boltzmann machine for complex-valued variables in polar coordinates, and LogPolarBM for logarithmic amplitude.
result PolarBM and LogPolarBM achieve superior modeling accuracy compared to conventional models, including deep neural networks.

New insights into binary perceptron reveal phase transitions and algorithmic thresholds.

problem Understanding the statistical-computational gap in binary perceptron models.
method Application of fully lifted random duality theory (fl RDT) to uncover structural changes.
result Numerical estimates of constraint density thresholds align with theoretical predictions.

The big phase space, the geometric setting for the study of quantum cohomology with gravitational descendents, is a complex manifold and consists of an infinite number of copies of the small phase space. The aim of this paper is to define a Hermitian geometry on the big phase space. Using the approach of Dijkgraaf and …

2012-11-23abs ↗pdf ↗

In this paper we propose new algorithm to reduce autocorrelation in Markov chain Monte-Carlo algorithms for euclidean field theories on the lattice. Our proposing algorithm is the Hybrid Monte-Carlo algorithm (HMC) with restricted Boltzmann machine. We examine the validity of the algorithm by employing the phi-fourth t…

2017-12-11abs ↗pdf ↗

Given an odd vector field QQ on a supermanifold MM and a QQ-invariant density μμ on MM, under certain compactness conditions on QQ, the value of the integral Mμ\int_{M}μ is determined by the value of μμ on any neighborhood of the vanishing locus NN of QQ. We present a formula for the integral in the case where…

2017-01-05abs ↗pdf ↗

Study shows zero level sets of solutions to Allen-Cahn equation are minimal surfaces with zero mean curvature.

problem Understanding phase transitions through entire solutions of the Allen-Cahn equation.
method Proving minimality of the zero level set with respect to a perimeter functional with density and showing zero mean curvature.
result The zero level set of entire solutions of the Allen-Cahn equation has zero mean curvature and is minimal.

A probing scheme is considered with an accessible and controllable qubit, used to probe an out-of equilibrium system consisting of a second qubit interacting with an environment. Quantum spontaneous synchronization between the probe and the system emerges in this model and, by tuning the probe frequency, can occur both…

2019-01-16abs ↗pdf ↗

DenSNet learns electron densities for molecular dynamics, enabling accurate spectroscopic predictions.

problem Lack of accurate electronic observables in MLIPs for molecular dynamics.
method DenSNet uses SE(3)-equivariant neural networks to predict electron densities and total energy.
result DenSNet predicts infrared spectra with excellent agreement to experimental data.

Introduces a new phase space for 2D supersymmetric sigma models.

problem Developing a new Hamiltonian formulation for 2D supersymmetric sigma models.
method Introduces a phase space with spinorial momenta and derives a covariant Hamiltonian formulation.
result Shows the existence of additional supersymmetries in the new formulation.

This paper is concerned with basic geometric properties of the phase space of a classical general relativistic particle, regarded as the 1st jet space of motions, i.e. as the 1st jet space of timelike 1--dimensional submanifolds of spacetime. This setting allows us to skip constraints. Our main goal is to determine the…

2008-01-11abs ↗pdf ↗

Method reconstructs financial networks from aggregate data, revealing critical link density.

problem Reconstructing financial networks from aggregate data is challenging due to unreconstructability phases.
method Random graph generation with desired link density and replicated constraints.
result There is a critical link density below which networks become unreconstructable.

The covariant phase space of a Lagrangian field theory is the solution space of the associated Euler-Lagrange equations. It is, in principle, a nice environment for covariant quantization of a Lagrangian field theory. Indeed, it is manifestly covariant and possesses a canonical (functional) "presymplectic structure" w …

2008-09-24abs ↗pdf ↗

Proposes using continuum percolation to analyze data manifolds and improve generative models.

problem Disentangling geometric support from probability distributions in high-dimensional data.
method Establishes a correspondence between topological phase transitions of random geometric graphs and data manifolds, using Percolation Shift metric.
result Demonstrates that Percolation Shift metric captures structural pathologies like mode collapse and guides training to prevent manifold shrinkage and improve fidelity.

A neural network learns phase space properties for time series analysis.

problem Lack of consistency and robustness in estimating embedding parameters.
method Forgetting mechanism neural network to learn phase space properties.
result Neural network approach is competitive or superior to state-of-the-art strategies.

Manifold Markov chain Monte Carlo algorithms have been introduced to sample more effectively from challenging target densities exhibiting multiple modes or strong correlations. Such algorithms exploit the local geometry of the parameter space, thus enabling chains to achieve a faster convergence rate when measured in n…

2016-08-29abs ↗pdf ↗