English
Related papers

Related papers: Four moments theorems on Markov chaos

200 papers

Piecewise deterministic Markov processes (PDMPs) are a class of stochastic processes with applications in several fields of applied mathematics spanning from mathematical modeling of physical phenomena to computational methods. A PDMP is…

Probability · Mathematics 2022-09-30 Andrea Bertazzi , Joris Bierkens , Paul Dobson

The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…

Probability · Mathematics 2026-04-01 Matthias Lienau

Adapting the spectral viewpoint suggested in Ledoux (2012) in the context of symmetric Markov diffusion generators and recently exploited in the non-diffusive setup of a Poisson random measure by D\"obler and Peccati (2017), we investigate…

Probability · Mathematics 2017-10-10 Christian Döbler , Kai Krokowski

Markov chains are fundamental models for stochastic dynamics, with applications in a wide range of areas such as population dynamics, queueing systems, reinforcement learning, and Monte Carlo methods. Estimating the transition matrix and…

Statistics Theory · Mathematics 2026-01-26 Lasse Leskelä , Maximilien Dreveton

In this paper we define distributions on moment spaces corresponding to measures on the real line with an unbounded support. We identify these distributions as limiting distributions of random moment vectors defined on compact moment spaces…

Probability · Mathematics 2012-11-14 Holger Dette , Jan Nagel

Motivated by the problem of computing the distribution of the largest distance $d_{\max}$ between $n$ random points on a circle we derive an explicit formula for the moments of the maximal component of a random vector following a Dirichlet…

Probability · Mathematics 2015-05-19 Eckhard Schlemm

We treat the probability distributions for quadratic quantum fields, averaged with a Lorentzian test function, in four-dimensional Minkowski vacuum. These distributions share some properties with previous results in two-dimensional…

Quantum Physics · Physics 2012-09-06 Christopher J. Fewster , L. H. Ford , Thomas A. Roman

Arguing about the equilibrium distribution of continuous-time Markov chains can be vital for showing properties about the underlying systems. For example in biological systems, bistability of a chemical reaction network can hint at its…

Probability · Mathematics 2010-07-20 Tugrul Dayar , Holger Hermanns , David Spieler , Verena Wolf

Dynamical chaos has recently been shown to exist in the Gaussian approximation in quantum mechanics and in the self-consistent mean field approach to studying the dynamics of quantum fields. In this study, we first show that any variational…

Quantum Physics · Physics 2008-11-26 Fred Cooper , John Dawson , Salman Habib , Robert D. Ryne

We prove that a random distribution in two dimensions which is conformally invariant and satisfies a natural domain Markov property is a multiple of the Gaussian free field. This result holds subject only to a fourth moment assumption.

Probability · Mathematics 2020-04-24 Nathanael Berestycki , Ellen Powell , Gourab Ray

In this article, we give explicit bounds on the Wasserstein and the Kolmogorov distances between random variables lying in the first chaos of the Poisson space and the standard Normal distribution, using the results proved by Last, Peccati…

Probability · Mathematics 2026-01-14 Mahmoud Khabou , Giovanni Luca Torrisi

We study a Markov process with two components: the first component evolves according to one of finitely many underlying Markovian dynamics, with a choice of dynamics that changes at the jump times of the second component. The second…

Probability · Mathematics 2015-04-14 Bertrand Cloez , Martin Hairer

Markov chains are convenient means of generating realizations of networks with a given (joint or otherwise) degree distribution, since they simply require a procedure for rewiring edges. The major challenge is to find the right number of…

Social and Information Networks · Computer Science 2012-11-01 J. Ray , A. Pinar , C. Seshadhri

Networks of caustics can occur in the distribution of particles suspended in a randomly moving gas. These can facilitate coagulation of particles by bringing them into close proximity, even in cases where the trajectories do not coalesce.…

Statistical Mechanics · Physics 2009-11-10 M. Wilkinson , B. Mehlig

The basic question in perturbation analysis of Markov chains is: how do small changes in the transition kernels of Markov chains translate to chains in their stationary distributions? Many papers on the subject have shown, roughly, that the…

Probability · Mathematics 2025-08-13 Na Lin , Yuanyuan Liu , Aaron Smith

Let $f$ be a Gaussian random field on $\mathbb{R}^d$ and let $X$ be the number of critical points of $f$ contained in a compact subset. A long-standing conjecture is that, under mild regularity and non-degeneracy conditions on $f$, the…

Probability · Mathematics 2023-07-21 Louis Gass , Michele Stecconi

In a seminal paper of 2005, Nualart and Peccati discovered a surprising central limit theorem (called the "Fourth Moment Theorem" in the sequel) for sequences of multiple stochastic integrals of a fixed order: in this context, convergence…

Probability · Mathematics 2012-06-29 Ivan Nourdin

This paper is devoted the the study of the mean field limit for many-particle systems undergoing jump, drift or diffusion processes, as well as combinations of them. The main results are quantitative estimates on the decay of fluctuations…

Probability · Mathematics 2014-01-15 Stéphane Mischler , Clément Mouhot , Bernt Wennberg

Theoretical results for importance sampling rely on the existence of certain moments of the importance weights, which are the ratios between the proposal and target densities. In particular, a finite variance ensures square root convergence…

Methodology · Statistics 2013-07-31 Michael K. Pitt , Minh-Ngoc Tran , Marcel Scharth , Robert Kohn

Consider $N$ balls initially placed in $L$ bins. At each time step take a ball from each non-empty bin and \emph{randomly} reassign the balls into the bins.We call this finite Markov chain \emph{General Repeated Balls into Bins} process. It…

Probability · Mathematics 2021-03-25 Nicoletta Cancrini , Gustavo Posta