Searcharxiv⌕ Search

arXiv · 2610.20090

Drift parameter estimation for interacting particle systems with singular repulsion

Abstract

We study the estimation of the interaction parameter in singular interacting particle systems from continuous and discrete observations over a fixed time horizon. The singularity of the interaction drift prevents the direct application of standard likelihood and contrast-based methods, which rely on regularity assumptions that fail in this setting. Our approach exploits an exact reduction of the particle dynamics to a one-dimensional stochastic differential equation for a quadratic empirical moment. By the symmetry of the interaction kernel, the singular terms cancel, yielding an explicit estimator in which the unknown parameter enters linearly. We establish consistency and asymptotic normality as the number of particles, \(N\), tends to infinity. Letting \(\varepsilon_N\) denote the microscopic noise scaling of the system, we obtain asymptotic normality at the rate \(\sqrt{N/\varepsilon_N}\) for strictly positive interaction kernels, under an additional condition on the limiting empirical information. We further extend these results to degenerate interaction kernels, achieving consistency and asymptotic normality at rate \(N\) under suitable structural assumptions and the canonical scaling \(\varepsilon_N=N^{-1}\). In both regimes, we provide conditions on the observation mesh ensuring that the statistical limits remain valid under discrete sampling, in high frequency. Finally, we illustrate the applicability of our methodology through Dyson Brownian motion, the Dyson Ornstein--Uhlenbeck process, and Wishart--Laguerre particle systems, alongside a numerical investigation of the estimators' finite-sample performance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chiara Amorino, Jacek Malecki, Radomyra Shevchenko. 2026-10-14. Drift parameter estimation for interacting particle systems with singular repulsion. https://arxiv.org/abs/2610.20090

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

KEEP EXPLORING

Related papers

Clustered Switchback Designs for Experimentation Under Spatio-temporal Interference

We consider experimentation in the presence of non-stationarity, inter-unit (spatial) interference, and carry-over effects (temporal interference), where we wish to estimate the global average treatment effect (GATE), the difference between average outcomes having exposed all units at all times to treatment or to control. We suppose spatial interference is described by a graph, where a unit's outcome depends on its neighborhood's treatments, and that temporal interference is described by an MDP, where the transition kernel under either treatment (action) satisfies a rapid mixing condition. We propose a clustered switchback design, where units are grouped into clusters and time steps are grouped into blocks, and each whole cluster-block combination is assigned a single random treatment. Under this design, we show that for graphs that admit good clustering, a truncated Horvitz-Thompson estimator achieves a $\tilde O(1/NT)$ mean squared error (MSE), matching the lower bound up to logarithmic terms for sparse graphs. Our results simultaneously generalize the results from \citet{hu2022switchback,ugander2013graph} and \citet{leung2022rate}. Simulation studies validate the favorable performance of our approach.

math.ST↗

Random sets from the perspective of metric statistics

Since the seminal work by Beresteanu and Molinari(2008), the random set theory and related inference methods have been widely applied in partially identified econometric models. Meanwhile, there is an emerging field in statistics for studying random objects in metric spaces, called metric statistics. This paper clarifies a relationship between two fundamental concepts in these literatures, the Aumann and Fréchet means, and presents some applications of metric statistics to econometric problems involving random sets.

math.ST↗

Minimax Binary Counting under Shuffle Privacy: Poisson Limits and Randomized-Response Optimality

We study estimation of a deterministic binary count from the shuffled outputs of a common single-message local channel. Privacy is required for every neighboring composition at fixed global parameters $(\varepsilon,δ)$, and estimators may be biased. We obtain uniform critical Poisson and Skellam approximations and characterize the limiting minimax risk as an infimum over finite observed-mark Poisson experiments. Let $Λ$ be the noise intensity required by the boundary Poisson-shift profile and let $λ_{\min}$ be the intensity required by the full composition-maximized randomized-response profile. Binary randomized response is asymptotically minimax optimal if and only if $Λ=λ_{\min}$. When $Λ<λ_{\min}$, the minimax value lies strictly between $(Λ+λ_{\min})/2$ and $λ_{\min}$, and a randomized-response construction with observed rare marks strictly improves on binary randomized response. We give a finite-sample certified example. Binary randomized response is strictly suboptimal at $\varepsilon=0$ for every $0<δ<1$, and this persists for sufficiently small positive $\varepsilon$ at each fixed target. For every fixed positive $\varepsilon$, strict suboptimality also occurs along a sequence of fixed privacy targets tending to zero. The variational characterization permits approximation by finite marked channels; it does not assert that a finite optimizer exists.

math.ST↗