Page 1 Next

Displaying 1 – 20 of 24

Showing per page

Markov chain comparison.

Dyer, Martin, Goldberg, Leslie Ann, Jerrum, Mark, Martin, Russell (2006)

Probability Surveys [electronic only]

Markov chains approximation of jump–diffusion stochastic master equations

Clément Pellegrini (2010)

Annales de l'I.H.P. Probabilités et statistiques

Quantum trajectories are solutions of stochastic differential equations obtained when describing the random phenomena associated to quantum continuous measurement of open quantum system. These equations, also called Belavkin equations or Stochastic Master equations, are usually of two different types: diffusive and of Poisson-type. In this article, we consider more advanced models in which jump–diffusion equations appear. These equations are obtained as a continuous time limit of martingale problems...

Mathematical model of mixing in Rumen

Wiesław Szlenk (1996)

Applicationes Mathematicae

A mathematical model of mixing food in rumen is presented. The model is based on the idea of the Baker Transformation, but exhibits some different phenomena: the transformation does not mix points at all in some parts of the phase space (and under some conditions mixes them strongly in other parts), as observed in ruminant animals.

Meeting time of independent random walks in random environment

Christophe Gallesco (2013)

ESAIM: Probability and Statistics

We consider, in the continuous time version, γ independent random walks on Z+ in random environment in Sinai’s regime. Let Tγ be the first meeting time of one pair of the γ random walks starting at different positions. We first show that the tail of the quenched distribution of Tγ, after a suitable rescaling, converges in probability, to some functional of the Brownian motion. Then we compute the law of this functional. Eventually, we obtain results about the moments of this meeting time. Being...

Mixing time for the Ising model : a uniform lower bound for all graphs

Jian Ding, Yuval Peres (2011)

Annales de l'I.H.P. Probabilités et statistiques

Consider Glauber dynamics for the Ising model on a graph of n vertices. Hayes and Sinclair showed that the mixing time for this dynamics is at least nlog n/f(Δ), where Δ is the maximum degree and f(Δ) = Θ(Δlog2Δ). Their result applies to more general spin systems, and in that generality, they showed that some dependence on Δ is necessary. In this paper, we focus on the ferromagnetic Ising model and prove that the mixing time of Glauber dynamics on any n-vertex graph is at least (1/4 + o(1))nlog n....

Currently displaying 1 – 20 of 24

Page 1 Next