English
Related papers

Related papers: On a Markov construction of couplings

200 papers

We establish a simple variance inequality for U-statistics whose underlying sequence of random variables is an ergodic Markov Chain. The constants in this inequality are explicit and depend on computable bounds on the mixing rate of the…

Statistics Theory · Mathematics 2013-03-05 Gersende Fort , Eric Moulines , Pierre Priouret , Pierre Vandekerkhove

The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…

Probability · Mathematics 2023-06-22 Rudolf Grübel

Markov chains for probability distributions related to matrix product states and 1D Hamiltonians are introduced. With appropriate 'inverse temperature' schedules, these chains can be combined into a random approximation scheme for ground…

Strongly Correlated Electrons · Physics 2014-05-14 S. Iblisdir

The bijection between composition structures and random closed subsets of the unit interval implies that the composition structures associated with $S \cap [0,1]$ for a self-similar random set $S\subset {\mathbb R}_+$ are those which are…

Probability · Mathematics 2007-05-23 Alexander Gnedin , Jim Pitman

We analyse the $\ell^2(\pi)$-convergence rate of irreducible and aperiodic Markov chains with $N$-band transition probability matrix $P$ and with invariant distribution $\pi$. This analysis is heavily based on: first the study of the…

Probability · Mathematics 2015-11-06 Loïc Hervé , James Ledoux

The well-known reflection coupling gives a maximal coupling of two one-dimensional Brownian motions with different starting points. Nevertheless, the reflection coupling does not generalize to more than two Brownian motions. In this paper,…

Probability · Mathematics 2022-10-25 Cheuk Ting Li , Venkat Anantharam

We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle…

Data Structures and Algorithms · Computer Science 2020-07-08 Luís M. S. Russo , Andreia Sofia Teixeira , Alexandre P Francisco

The main result of this paper states that if $(N, \Pi)$ is a pair of independent point processes on a common ground space with $N$ Poisson and $\Pi$ determinantal induced by a locally trace class (not necessarily self-adjoint) correlation…

Probability · Mathematics 2017-10-27 Yanqi Qiu

The $s$-point correlation function of a Gaussian Hermitian random matrix theory, with an external source tuned to generate a multi-critical singularity, provides the intersection numbers of the moduli space for the $p$-th spin curves…

Mathematical Physics · Physics 2015-02-06 E. Brezin , S. Hikami

The paper is concerned with the equilibrium distribution $\Pi_n$ of the $n$-th element in a sequence of continuous-time density dependent Markov processes on the integers. Under a $(2+\a)$-th moment condition on the jump distributions, we…

Probability · Mathematics 2009-02-06 Sanda N. Socoll , A. D. Barbour

For a reversible and ergodic Markov chain $\{X_n,n\geq0\}$ with invariant distribution $\pi$, we show that a valid confidence interval for $\pi(h)$ can be constructed whenever the asymptotic variance $\sigma^2_P(h)$ is finite and positive.…

Statistics Theory · Mathematics 2016-08-14 Yves F. Atchadé

We study a model for the entanglement of a two-dimensional reflecting Brownian motion in a bounded region divided into two halves by a wall with three or more small windows. We map the Brownian motion into a Markov Chain on the fundamental…

Probability · Mathematics 2020-10-19 Gage Bonner , Jean-Luc Thiffeault , Benedek Valko

Let X be a Poisson point process of intensity lambda on the real line. A thickening of it is a (deterministic) measurable function f such that the union of X and f(X) is a Poisson point process of intensity lambda' where lambda'>lambda. An…

Probability · Mathematics 2017-03-14 Ori Gurel-Gurevich , Ron Peled

The Mallows measure is measure on permutations which was introduced by Mallows in connection with ranking problems in statistics. Under this measure, the probability of a permutation $\pi$ is proportional to $q^{Inv(\pi)}$ where $q$ is a…

Probability · Mathematics 2019-08-15 Naya Banerjee , Ke Jin

In theory, the probabilistic linkage method provides two distinct advantages over non-probabilistic methods, including minimal rates of linkage error and accurate measures of these rates for data users. However, implementations can fall…

Methodology · Statistics 2019-11-06 Abel Dasylva , Arthur Goussanou , David Ajavon , Hanan Abousaleh

We describe a controllable and unbiased strong-coupling diagrammatic Monte Carlo technique that is applicable to a wide range of fermionic systems and spin models. Unlike previous strong coupling methods that generally rely on the…

Strongly Correlated Electrons · Physics 2021-05-26 Johan Carlström

In this paper we consider random dynamical systems formed by concatenating maps acting on the unit interval $[0,1]$ in an iid fashion. Considered as a stationary Markov process, the random dynamical system possesses a unique stationary…

Dynamical Systems · Mathematics 2024-11-20 Romain Aimino , Matthew Nicol , Andrew Török

Linear structural equation models are multivariate statistical models encoded by mixed graphs. In particular, the set of covariance matrices for distributions belonging to a linear structural equation model for a fixed mixed graph $G=(V,…

Statistics Theory · Mathematics 2022-10-04 Bibhas Adhikari , Elizabeth Gross , Marc Härkönen , Elias Tsigaridas

We develop a general theory for Markov chains whose transition probabilities are the coefficients of descent operators on combinatorial Hopf algebras. These model the breaking-then-recombining of combinational objects. Examples include the…

Combinatorics · Mathematics 2018-08-28 C. Y. Amy Pang

We introduce the problem of Poisson sampling over joins: compute a sample of the result of a join query by conceptually performing a Bernoulli trial for each join tuple, using a non-uniform and tuple-specific probability. We propose an…

Databases · Computer Science 2026-03-17 Liese Bekkers , Frank Neven , Lorrens Pantelis , Stijn Vansummeren