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,695 papers · 148 categories

Trend · papers per month

295886115 · May 202619922001200920172026
48 results for heat diffusion

Study shows how heat leaks from material sets in low diffusivity scenarios.

problem Understanding heat leakage from material sets in low diffusivity limits.
method Generalized leading-order asymptotics for time-dependent diffusion processes.
result Diffusive transport out of a material set is proportional to the surface area of the set boundary.

A new method uses heat diffusion to efficiently solve combinatorial optimization problems.

problem Challenges in combinatorial optimization due to discrete nature and limited search scope.
method Transforming the target function through heat diffusion to enable information flow and more efficient navigation.
result Superior performance across various combinatorial optimization problems.

Paper develops novel privacy mechanism for Riemannian manifold data using geometric analysis and heat diffusion.

problem Privacy-preserving estimation of generalized Frechet mean on Riemannian manifolds.
method Characterizes Renyi divergence via Harnack inequalities, introduces mechanisms based on heat diffusion and Langevin process.
result Proposes mechanisms for nonnegative and general Riemannian manifolds with detailed utility analyses.

We consider Lagrangian coherent structures (LCSs) as the boundaries of material subsets whose advective evolution is metastable under weak diffusion. For their detection, we first transform the Eulerian advection-diffusion equation to Lagrangian coordinates, in which it takes the form of a time-dependent diffusion or h…

2016-08-19abs ↗pdf ↗

Establishes a link between heat diffusion and manifold distances in data.

problem No theoretical link between diffusion-based manifold learning and geodesic distances.
method Formulates heat geodesic embeddings based on Riemannian geometry.
result Method outperforms state-of-the-art in preserving manifold distances and cluster structure.

A new graph generator uses heat diffusion on graph Laplacians to create new graph structures.

problem Creating realistic and diverse graph structures for various applications.
method Adapting the Generator Matching paradigm to graph data, using graph Laplacian and heat kernel for diffusion.
result The method effectively generates graphs with structural properties of real and synthetic graphs.

Study on uniquely determining thermal properties from boundary temperature and heat flux measurements.

problem Determine thermal conductivity and volumetric heat capacity from boundary measurements.
method Uniqueness proof for isotropic and anisotropic media under thermal diffusivity assumption.
result Uniqueness of thermal properties in all dimensions and up to a gauge in two dimensions.

Let M be a complete Riemannian manifold with a free cocompact Z^k-action. Let k(t,x,y) be the heat kernel on M. We compute the asymptotics of k(t,x,y) in the limit in which t goes to infinity and d(x,y) is comparable to sqrt{t}. We show that in this limit, the heat diffusion is governed by an effective Euclidean metric…

1997-07-18abs ↗pdf ↗

Uniform heat kernel and diffusion bridge asymptotics for sub-Riemannian geometry.

problem Analyzing sub-Riemannian heat kernels and their derivatives on incomplete manifolds.
method Localized asymptotic analysis, focusing on minimizing geodesics and the non-abnormal cut locus.
result Uniform bounds and expansions for heat kernels and their derivatives on compacts, including the diffusion bridge measure.

Generative model on manifolds reduces divergence computation and improves scalability.

problem Difficulties in modeling data on non-Euclidean spaces due to expensive divergence computation and approximations of heat kernel.
method Riemannian Diffusion Mixture, a principled framework using a mixture of bridge processes.
result Achieves superior performance on diverse manifolds with reduced simulation steps.

A new clustering algorithm fuses heat diffusion and turning angle for robustness.

problem Cluster similar elements in various fields.
method Combines heat diffusion and maximal turning angle for robust fission clustering.
result The SARFC algorithm outperforms other methods in clustering performance.

Researchers calculate entropy of heat kernel on manifolds for very small times.

problem Estimating entropy of heat kernel on compact Riemannian manifolds for small times.
method Asymptotic expansion, polynomial expressions in curvature tensor components.
result First three coefficients of entropy expansion computed and expressed as polynomials.

Efficient diffusion model for symmetric manifolds reduces training and computation costs.

problem Heat kernel computations for manifold diffusion models are computationally expensive and infeasible.
method Spatially-varying covariance diffusion model, efficient objective derived via Ito's Lemma.
result Our model reduces training time and arithmetic operations by orders of magnitude.

Graph diffusion processes approximate manifold heat semigroups using graph transition matrices.

problem Approximating manifold heat semigroups from graph data under low regularity conditions.
method Iterating graph transition matrix PP to approximate Qt=etΔQ_t = e^{tΔ}, bounding error in \infty-norm.
result Convergence rates O(N2/(d+6))O(N^{-2/(d+6)}) for manifold heat semigroup approximation, valid for in-sample and out-of-sample.

We use tools from nn-dimensional Brownian motion in conjunction with the Feynman-Kac formulation of heat diffusion to study nodal geometry on a compact Riemannian manifold MM. On one hand we extend a theorem of Lieb and prove that any nodal domain ΩλΩ_λ almost fully contains a ball of radius 1λ\sim \frac{1}{\sqrtλ}. …

2016-02-23abs ↗pdf ↗

We introduce {\em vector diffusion maps} (VDM), a new mathematical framework for organizing and analyzing massive high dimensional data sets, images and shapes. VDM is a mathematical and algorithmic generalization of diffusion maps and other non-linear dimensionality reduction methods, such as LLE, ISOMAP and Laplacian…

2011-02-01abs ↗pdf ↗

For incomplete sub-Riemannian manifolds, and for an associated second-order hypoelliptic operator, which need not be symmetric, we identify two alternative conditions for the validity of Gaussian-type upper bounds on heat kernels and transition probabilities, with optimal constant in the exponent. Under similar conditi…

2018-10-15abs ↗pdf ↗

New method uses entropy dissipation to prove isoperimetric inequalities.

problem Proving isoperimetric inequalities in geometric settings.
method Information-theoretic approach based on entropy dissipation under heat flow.
result New proof of Euclidean isoperimetric inequality with sharp constant.

The paper studies harmonic map heat flow stability and decay rates.

problem Analyzing stability and decay rates of harmonic map heat flow solutions.
method Use of homogeneous Besov space B˙p,dp(Rd)\dot{B}^{\frac{d}{p}}_{p,\infty}(\mathbb{R}^d) for small initial data and self-similar decay assumption.
result Decay rates for solutions of the harmonic map flow of the form ablau(t)L(Rd)Ct12\| abla u(t) \|_{L^\infty(\mathbb{R}^d)}\leq Ct^{-\frac12} and self-similar decay under stronger initial conditions.

We provide a short proof for the theorem that two compact Riemannian manifolds are isomorphic if and only there exists an order isomorphism which intertwines between the heat semigroups on the manifolds.

2011-04-06abs ↗pdf ↗

Study mass transport in low-diffusivity using Lagrangian coordinates.

problem Mass preserving transport of passive tracers in low-diffusivity limit.
method Lagrangian coordinates, time-averaged diffusion equation, weighted manifold structure.
result Leading order asymptotics extend to dominant nontrivial singular value in low-diffusivity limit.

Many contemporary statistical learning methods assume a Euclidean feature space. This paper presents a method for defining similarity based on hyperspherical geometry and shows that it often improves the performance of support vector machine compared to other competing similarity measures. Specifically, the idea of usi…

2017-02-05abs ↗pdf ↗

We introduce a sub-Riemannian analogue of the Bence-Merriman-Osher diffusion driven algorithm and show that it leads to weak solutions of the horizontal mean curvature flow of graphs over sub-Riemannian Carnot groups. The proof follows the nonlinear semi-group theory approach originally introduced by L. C. Evans in the…

2012-08-30abs ↗pdf ↗

In this paper, we consider the heat flow for Yang-Mills connections on R5×SO(5)\mathbb{R}^5 \times SO(5). In the SO(5)SO(5)-equivariant setting, the Yang-Mills heat equation reduces to a single semilinear reaction-diffusion equation for which an explicit self-similar blowup solution was found by Weinkove \cite{Wei04}. We prove …

2016-04-26abs ↗pdf ↗

The paper analyzes the score field of diffusion models using Burgers dynamics.

problem Understanding the evolution of score fields in diffusion models.
method Analyzes the score field through Burgers-type evolution law for diffusion models.
result Identifies a universal \( anh\) interfacial term in the score field.

The study uses heat flow to analyze properties of Laplace eigenfunctions on manifolds and domains.

problem Analyzing mass concentration and nodal domains of Laplace eigenfunctions.
method Heat diffusion technique to study eigenfunctions and their nodal sets.
result Discovers new insights into the decay and behavior of Laplace eigenfunctions.

Heat flow on lens spaces settles into Morse functions with four critical points.

problem Understanding the behavior of heat flow on lens spaces.
method Analyzing the asymptotic spectral expansion of the heat flow.
result Generic heat evolutions on lens spaces \(L(p,q)\) with \(p\geq2\) and \(1\leq q\leq p/2\) tend to settle into Morse functions with exactly four critical points.

Study decision boundaries using heat diffusion and probabilistic techniques.

problem Understanding the geometry of decision boundaries in machine learning.
method Using Brownian motion and probabilistic techniques to analyze decision boundaries.
result Decision boundaries exhibit persistent 'wiggly and fuzzy' regions, even under adversarial attacks.

New discretization scheme for Wasserstein gradient flows using Schrödinger bridges.

problem Computing Wasserstein gradient flows efficiently and without score functions.
method Iterated Schrödinger bridge approximation with particle-based Sinkhorn algorithm.
result The scheme converges to Wasserstein gradient flows for certain flows, including heat flow.