Search arXiv⌕ Search

arXiv · 2610.15852

Uniform-in-time propagation of chaos for singular $L^k$ interaction kernels with rates

Abstract

Based on a semigroup approach, we prove quantitative uniform-in-time propagation of chaos for two systems of interacting particles with singular interaction kernels $K$ of type $L^k$, $k>d$, and a contractive Lipschitz confinement force field. First, we consider a system with moderate interaction, which means that the particles interact through the mollified kernel $K\ast V^N$, for some approximation of identity $V^N = N^{dα} V(N^α\cdot),\, α>0$. Assuming that $\|K\|_{L^k}$ is sufficiently small, we obtain that for any $\varepsilon>0$ the uniform-in-time rate is of order $N^{-\min\left(α,\frac12-\frac{dα}{2}-\varepsilon\right)}$, plus an exponentially small in time contribution of the initial condition. Second, for the classical, non-mollified particle system we establish uniform-in-time propagation of chaos with rate $N^{-\min\left(α,\frac12-\frac{dα}{2}-\varepsilon\right)} + \|K-K\ast V^N\|_{L^{k}}$, plus an exponentially small in time contribution of the initial condition. The method relies on the regularity properties of the solution of the associated nonlinear Fokker-Planck equation combined with estimates of the Duhamel formulation of the mollified empirical measure, together with partial Girsanov transforms for the non-mollified system of particles.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicoleta Cazacu, Alexandre Richard, Milica Tomasevic. 2026-10-11. Uniform-in-time propagation of chaos for singular $L^k$ interaction kernels with rates. https://arxiv.org/abs/2610.15852

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Loglinear Hawkes processes: existence, nonexplosion, stability and moment bounds

This paper discusses a special class of nonlinear Hawkes processes, where the rate function is the exponential function. We call these processes loglinear Hawkes processes. Such processes are used with success in computational neuroscience and we provide a mathematical background for them. After obtaining existence from a standard Poisson embedding, we give sufficient conditions for explosion and nonexplosion that cover a large class of memory functions. In order to give sufficient stability conditions, we construct an autoregressive integer-valued time series that gives pathwise upper bounds for the bin counts of a loglinear Hawkes process. From here, a Markov chain argument shows that the regeneration time for a loglinear Hawkes process has finite expectation if the memory function is negative enough in a neighborhood of zero. Stability in total variation follows. Finally, we show that both the loglinear Hawkes process under a large class of initial conditions and its stationary version have finite exponential moments.

math.PR↗

Eddy viscosity by Lévy transport noises

We consider stochastic linear transport equations in dimension $d\geq 2$ and stochastic 2D Euler equations with $L^2$-initial condition, both driven by Lévy transport noise in the Marcus sense. Under a suitable scaling limit of the noises, we prove that the solutions to the stochastic linear transport equations converge to the solution of the deterministic heat equation, while weak solutions to the stochastic 2D Euler equations converge weakly to the unique solution of the deterministic 2D Navier--Stokes equation. These results show that small-scale jump noises generate eddy viscosity, extending the recent studies on Itô--Stratonovich diffusion limits to the discontinuous setting.

math.PR↗

Triggered urn models for frequently asked questions (FAQ)

We investigate a nonclassic urn model with triggers that increase the number of colors. The scheme has emerged as a model for web services that set up frequently asked questions (FAQ). We present a thorough asymptotic analysis of the FAQ urn scheme in generality that covers a large number of special cases, such as Simon's urn. For instance, we consider time dependent triggering probabilities. We identify regularity conditions on these probabilities that classify the schemes into those where the number of colors in the urn remains almost surely finite or increases to infinity and conditions that tell us whether all the existing colors are observed infinitely often or not. We determine the rank curve, too. In view of the broad generality of the trigger probabilities, a spectrum of limit distributions appears, from central limit theorems to Poisson approximation, to power-laws, revealing connections to Heaps exponent and Zipf's law. A combinatorial approach to the Simon urn is presented to indicate the possibility of such exact analysis, which is important for short-term predictions. Extensive simulations on real datasets (from Amazon sales) as well as computer-generated data clearly indicate that the asymptotic and exact theory developed agrees with practice.

math.PR↗