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.

169,291 papers · 148 categories

Trend · papers per month

1.6%3.1%4.7%6.3% · Aug 199619922001200920182026
48 results for massive particles

New string singularities enable quantum teleportation of massive particles.

problem Quantum teleportation of massive particles at large distances.
method Introduction of new world-sheet string singularities (cusps) that are stable and allow for the emission of captured massive quantum particles.
result Existence of a new mechanism for quantum teleportation of massive particles.

Unified framework for photon and massive particle hypersurfaces in stationary spacetimes.

problem Understanding photon and massive particle hypersurfaces in stationary spacetimes.
method Unified framework using Killing-invariant timelike hypersurfaces and associated Finsler structures.
result Conditions for a hypersurface to be a photon or massive particle hypersurface are established.

We report a statistical analysis of the Island ECN (NASDAQ) order book. We determine the static and dynamic properties of this system, and then analyze them from a physicist's viewpoint using an equivalent particle system obtained by treating orders as massive particles and price as position. We identify the fundamenta…

2001-06-06abs ↗pdf ↗

The paper studies how test particles' mass and charge vary in Kaluza-Klein models.

problem Understanding how test particles' mass and charge change in Kaluza-Klein models.
method Analyzes geodesic motion in a 5D Kaluza-Klein spacetime with background metrics encoding 4D gauge fields and Higgs-like scalars.
result The mass and charge of test particles become variable when traversing regions with massive gauge fields or non-constant Higgs scalars.

Smooth deformations of a Minkowski type metric in a four-dimensional space-time manifold are considered. Deformations of the basic spin-tensorial fields associated with this metric are calculated and their application to calculating the energy-momentum tensor of a massive spin 1/2 particle is shown.

2007-09-10abs ↗pdf ↗

We construct stationary flat three-dimensional Lorentzian manifolds with singularities that are obtained from Euclidean surfaces with cone singularities and closed one-forms on these surfaces. In the application to (2+1)-gravity, these spacetimes correspond to models containing massive particles with spin. We analyse t…

2011-08-04abs ↗pdf ↗

In this paper we develop a Morse Theory for timelike geodesics parameterized by a constant multiple of proper time. The results are obtained using an extension to the timelike case of the relativistic Fermat Principle, and techniques from Global Analysis on infinite dimensional manifolds. In the second part of the pape…

1999-05-17abs ↗pdf ↗

We investigate 3-dimensional globally hyperbolic AdS manifolds containing "particles", i.e., cone singularities along a graph ΓΓ. We impose physically relevant conditions on the cone singularities, e.g. positivity of mass (angle less than 2π on time-like singular segments). We construct examples of such manifolds, d…

2009-05-12abs ↗pdf ↗

Minkowski space is the local model of 3 dimensionnal flat spacetimes. Recent progress in the description of globally hyperbolic flat spacetimes showed strong link between Lorentzian geometry and Teichm{ü}ller space. We notice that Lorentzian generalisations of conical singularities are useful for the endeavours of desc…

2016-05-18abs ↗pdf ↗

Adaptive ML learns complex time-varying systems without new data.

problem Applying ML to time-varying systems with shifting distributions.
method Mapping high-dimensional inputs to low-dimensional latent space, actively tuning latent space based on feedback.
result Learning correlations and tracking system evolution in real-time without new data.

New MCMC method speeds up quantum physics simulations by a factor of 100.

problem Simulating quantum many-body systems with high computational complexity.
method FFT-accelerated MCMC with coupled particle and auxiliary variables.
result Achieves O(NlogN)O(N \log N) scaling, significantly faster than traditional O(N3)O(N^3) methods.

We use minimal (or CMC) surfaces to describe 3-dimensional hyperbolic, anti-de Sitter, de Sitter or Minkowski manifolds. We consider whether these manifolds admit ``nice'' foliations and explicit metrics, and whether the space of these metrics has a simple description in terms of Teichmüller theory. In the hyperbolic s…

2005-11-17abs ↗pdf ↗

It is believed by the majority today that the efficient market hypothesis is imperfect because of market irrationality. Using the physical concepts and mathematical structures of quantum mechanics, we construct an econophysics framework for the stock market, based on which we analogously map massive numbers of single s…

2014-05-13abs ↗pdf ↗

New framework improves fraud prediction with incremental data balancing for massive data streams.

problem Class imbalance problem in massive imbalanced data streams.
method Incremental data balancing framework using Racing Algorithm for automated balancing and Random Forest for classification.
result Better results than Batch mode on European Credit Card dataset.

A computer vision approach improves neutral particle detection in particle flow algorithms.

problem Optimal reconstruction of particle content and kinematics in calorimeter images.
method Computer vision techniques applied to calorimeter images, using deep learning and super-resolution.
result Significantly improved reconstruction of neutral particle calorimeter energy deposits.

Study examines the excluded area between two-dimensional hard particles, identifying key factors affecting its magnitude.

problem Determining the excluded area between two-dimensional hard particles with various orientations and shapes.
method Used principal component analysis and Monte Carlo simulations to analyze randomly generated non-self-intersecting polygons and star lines.
result The minimum excluded area is achieved when particles are antiparallel, and elongation of the particle shape significantly affects the excluded area.

Jointly estimates flow fields and particle properties from Lagrangian data.

problem Estimating flow fields and particle properties from sparse, noisy Lagrangian data.
method Data assimilation framework coupling Eulerian and Lagrangian models.
result Joint estimation of flow fields and particle properties in various flow regimes.

Estimates log-likelihood of interacting particle systems using virtual particles.

problem Inconsistent estimation of finite-particle log-likelihood in large particle systems.
method Stochastic gradient estimate using continuous trajectory and virtual particle systems.
result Convergence to stationary points of limiting mean-field system's log-likelihood.

This paper optimizes functions of probability measures using particle gradient descent for displacement convex functions.

problem Optimizing functions of probability measures with displacement convex properties.
method Particle gradient descent applied to displacement convex functions with theoretical guarantees.
result Finite number of particles and computations are sufficient to find optimal solutions for displacement convex functions.

New sampling method improves on particle-optimization techniques.

problem Particles tend to collapse in SVGD, leading to poor sampling.
method Introduce stochastic noise to update particles, developing non-asymptotic convergence theory.
result More particles do not always improve approximation due to computational constraints.

A method for optimal Bayesian filtering using progressive particle flow and optimal transport maps.

problem Optimizing Bayesian filtering with deterministic particles to avoid degeneration.
method Progressive flow of particles through a sequence of sub-steps, each using an optimal transport map to replace non-equally weighted particles with equally weighted ones.
result The method avoids particle degeneration and simplifies the filtering process by not requiring inversions or monotonicity constraints.

Optimal weights improve particle-based approximations of discrete distributions.

problem Improving particle-based approximations of discrete distributions.
method Proving optimality of weights and showing how to compute them efficiently.
result Optimal weights can be computed from existing particle-based methods without extra costs.

Particle MCMC involves using a particle filter within an MCMC algorithm. For inference of a model which involves an unobserved stochastic process, the standard implementation uses the particle filter to propose new values for the stochastic process, and MCMC moves to propose new values for the parameters. We show how p…

2014-08-29abs ↗pdf ↗

Topaz uses neural networks to pick particles from cryoEM images efficiently.

problem Manual particle picking is time-consuming and requires post-processing.
method Positive-Unlabeled (PU) learning with minimal labeled data.
result Topaz improves cryoEM reconstruction resolution by up to 0.15 Å.

Optimizes particle filtering for non-stationary environments.

problem Tracking and adapting to non-stationary environments in online prediction.
method Formulated an efficient particle filtering method using online mirror descent algorithm.
result Achieves optimal particle efficiency in non-stationary environments.

Improved particle approximation for mean-field neural networks.

problem Particle approximation error for mean-field neural networks.
method Improved particle approximation error by leveraging the problem structure in risk minimization.
result Established an LSI-constant-free particle approximation error concerning the objective gap.

A new particle filter avoids resampling to improve state estimation in high dimensions.

problem Particle deprivation in high-dimensional state spaces.
method A resampling-free particle filter designed to mitigate particle deprivation.
result The filter offers a near-accurate representation of the posterior distribution in high-dimensional contexts.

We introduce a new sequential Monte Carlo algorithm we call the particle cascade. The particle cascade is an asynchronous, anytime alternative to traditional particle filtering algorithms. It uses no barrier synchronizations which leads to improved particle throughput and memory efficiency. It is an anytime algorithm i…

2014-07-10abs ↗pdf ↗

Random orthogonalization improves FL in massive MIMO systems without CSI.

problem Efficient model aggregation in FL with minimal channel estimation overhead.
method Combining FL with massive MIMO's channel hardening and favorable propagation, random orthogonalization reduces channel estimation overhead.
result Achieves model aggregation without CSI, significantly reducing channel estimation overhead.

Paper uses averaging from many particle filters to approximate posterior predictive distributions.

problem Approximating posterior predictive distributions efficiently and accurately.
method Particle swarm filter algorithm that averages many particle filter approximations.
result Law of large numbers and central limit theorem support the method's effectiveness.

This paper studies when particle filtering is efficient for planning in partially observed systems.

problem The efficiency of particle filtering for planning in partially observed linear dynamical systems.
method Coupling of ideal and approximate sequences to bound particle complexity.
result Polynomially many particles suffice for stable systems to approximate optimal planning.

Cryo-electron microscopy (cryo-EM) is an emerging experimental method to characterize the structure of large biomolecular assemblies. Single particle cryo-EM records 2D images (so-called micrographs) of projections of the three-dimensional particle, which need to be processed to obtain the three-dimensional reconstruct…

2013-11-29abs ↗pdf ↗

New algorithm trains latent diffusion models using interacting particles.

problem Training latent diffusion models efficiently and accurately.
method Reformulate training as minimizing a free energy functional, then approximate with interacting particles.
result The new algorithm outperforms previous methods in experiments.