Results 91 to 100 of about 120 (114)

Embedding of Markov matrices for d ⩽ 4. [PDF]

J Math Biol
Baake M, Sumner J.
europepmc   +1 more source

Perfect simulation of some point processes for the impatient user

Recently Propp and Wilson [14] have proposed an algorithm, called coupling from the past (CFTP), which allows not only an approximate but perfect(i.e. exact) simulation of the stationary distribution of certain finite state space Markov chains.

core  

Some of the next articles are maybe not open access.

Related searches:

Practical drift conditions for subgeometric rates of convergence

Annals of Applied Probability, 2004
Randal Douc, Philippe Soulier
exaly  

Limit theorems for discrete-time metapopulation models

Probability Surveys, 2010
P K Pollett
exaly  

Excited Random Walk on Trees

Electronic Journal of Probability, 2003
Stanislav Volkov
exaly  

Stochastic alternating projections

Illinois Journal of Mathematics, 2010
Laurent Saloff-Coste, Kshitij Khare
exaly  

Markov chain comparison

Probability Surveys, 2006
Martin Dyer, Russell Martin, Mark Jerrum   +2 more
exaly  

Avoidance Coupling

Electronic Communications in Probability, 2013
Peter Winkler, Ömer Angel
exaly