English
Related papers

Related papers: Rigidity for Markovian Maximal Couplings of Ellipt…

200 papers

In this paper we present a novel method for estimating the parameters of a parametric diffusion processes. Our approach is based on a closed-form Maximum Likelihood estimator for an approximating Continuous Time Markov Chain (CTMC) of the…

Methodology · Statistics 2021-08-31 J. L. Kirkby , Dang Nguyen , Duy Nguyen , Nhu Nguyen

Nonlinear Markov Chains (nMC) are regarded as the original (linear) Markov Chains with nonlinear small perturbations. It fits real-world data better, but its associated properties are difficult to describe. A new approach is proposed to…

Probability · Mathematics 2022-12-13 Kaichen Xu

Excess pore pressure in granular--fluid mixtures can transiently suppress frictional contacts and dramatically enhance flow mobility, yet its evolution is commonly modeled using constant effective diffusivities. Here we show that the…

Soft Condensed Matter · Physics 2026-04-21 Eric C. P. Breard , Claudia Elijas Parra , Mattia de' Michieli Vitturi

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

We introduce a framework to approximate a Markov Decision Process that stands on two pillars: state aggregation -- as the algorithmic infrastructure; and central-limit-theorem-type approximations -- as the mathematical underpinning of…

Optimization and Control · Mathematics 2021-04-13 Amy B. Z. Zhang , Itai Gurvich

Markov models are widely used to describe processes of stochastic dynamics. Here, we show that Markov models are a natural consequence of the dynamical principle of Maximum Caliber. First, we show that when there are different possible…

Statistical Mechanics · Physics 2015-05-28 Hao Ge , Steve Presse , Kingshuk Ghosh , Ken Dill

In this paper we develop a general framework for constructing and analysing coupled Markov chain Monte Carlo samplers, allowing for both (possibly degenerate) diffusion and piecewise deterministic Markov processes. For many performance…

Probability · Mathematics 2018-06-29 N. Nuesken , G. A. Pavliotis

Markov chains and diffusion processes are indispensable tools in machine learning and statistics that are used for inference, sampling, and modeling. With the growth of large-scale datasets, the computational cost associated with simulating…

Statistics Theory · Mathematics 2017-08-31 Jonathan H. Huggins , James Zou

A system of interacting Brownian particles subject to short-range repulsive potentials is considered. A continuum description in the form of a nonlinear diffusion equation is derived systematically in the dilute limit using the method of…

Statistical Mechanics · Physics 2017-10-12 Maria Bruna , S. Jonathan Chapman , Martin Robinson

When two Markov operators commute, it suggests that we can couple two copies of one of the corresponding processes. We explicitly construct a number of couplings of this type for a commuting family of Markov processes on the set of…

Probability · Mathematics 2008-11-20 Anthony P. Metcalfe , Neil O'Connell , Jon Warren

We develop exact Markov chain Monte Carlo methods for discretely-sampled, directly and indirectly observed diffusions. The qualification "exact" refers to the fact that the invariant and limiting distribution of the Markov chains is the…

Flip-flop processes refer to a family of stochastic fluid processes which converge to either a standard Brownian motion (SBM) or to a Markov modulated Brownian motion (MMBM). In recent years, it has been shown that complex distributional…

Probability · Mathematics 2021-10-12 Guy Latouche , Giang T. Nguyen , Oscar Peralta

We consider several critical wetting models. In the discrete case, these probability laws are known to converge, after an appropriate rescaling, to the law of a reflecting Brownian motion, or of the modulus of a Brownian bridge, according…

Probability · Mathematics 2020-02-04 Jean-Dominique Deuschel , Henri Elad Altman , Tal Orenshtein

This paper studies the asymptotic behavior of processes with switching. More precisely, the stability under fast switching for diffusion processes and discrete state space Markovian processes is considered. The proofs are based on…

Probability · Mathematics 2017-07-07 Sören Christensen , Albrecht Irle

This paper is a step in the direction of understanding the behavior of non-intersecting Brownian motions on the real line, when the number of particles becomes large. Consider 2k non-intersecting Brownian motions, all starting at the…

Probability · Mathematics 2007-05-23 Mark Adler , Pierre van Moerbeke

We study particle transport in a class of open channels of finite length, made of identical cells of connected open polygonal billiards with parallel boundaries. In these systems the Mean Square Displacement (MSD) grows in time faster than…

Statistical Mechanics · Physics 2025-03-20 Luisana Claudio-Pachecano , Hernán Larralde , Carlos Mejía-Monasterio

In this paper, we study discrete approximation of reflected Brownian motions on domains in Euclidean space. Our approximation is given by a sequence of Markov chains on partitions of the domain, where we allow uneven or random partitions.…

Probability · Mathematics 2025-04-09 Masanori Hino , Arata Maki , Kouhei Matsuura

We construct a class of one-dimensional diffusion processes on the particles of branching Brownian motion that are symmetric with respect to the limits of random martingale measures. These measures are associated with the extended extremal…

Probability · Mathematics 2018-11-07 Sebastian Andres , Lisa Hartung

This paper provides a general and abstract approach to approximate ergodic regimes of Markov and Feller processes. More precisely, we show that the recursive algorithm presented in Lamberton & Pages (2002) and based on simulation algorithms…

Probability · Mathematics 2018-01-17 Gilles Pagès , Clément Rey

We survey existing techniques to bound the mixing time of Markov chains. The mixing time is related to a geometric parameter called conductance which is a measure of edge-expansion. Bounds on conductance are typically obtained by a…

Data Structures and Algorithms · Computer Science 2016-03-07 Venkatesan Guruswami