Results 91 to 100 of about 111 (110)
On ballistic deposition process on a strip. [PDF]
Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Card-cyclic-to-random shuffling with relabeling
The card-cyclic-to-random shuffle is the card shuffle where the n cards are labeled 1,..., n according to their starting positions. Then the cards are mixed by first picking card 1 from the deck and reinserting it at a uniformly random position, then ...
Jonasson, Johan, Johan Jonasson
core
On the geometric ergodicity of hybrid samplers
In this paper, we consider the random scan symmetric random walk Metropolis algorithm (RSM) on R . This algorithm performs a Metropolis step on just one coordinate at a time (as opposed to the full dimensional symmetric Random walk Metropolis algorithm,
Fort, G. +7 more
core
Average height for Abelian sandpiles and the looping constant on Sierpiński graphs. [PDF]
Heizmann N, Kaiser R, Sava-Huss E.
europepmc +1 more source
NETWORK-ENSEMBLE COMPARISONS WITH STOCHASTIC REWIRING AND VON NEUMANN ENTROPY. [PDF]
Li Z, Mucha PJ, Taylor D.
europepmc +1 more source
Some Open Questions About the Anisotropic Random Walks. [PDF]
Csáki E, Földes A.
europepmc +1 more source
Mutation and Selection in Bacteria: Modelling and Calibration. [PDF]
Bayliss CD +3 more
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:
Related searches:
Semi-classical analysis of a random walk on a manifold
Annals of Probability, 2010Gilles Lebeau
exaly
On the Number of Collisions in $\Lambda$-Coalescents
Electronic Journal of Probability, 2007Alexander Gnedin, Yuri Yakubovich
exaly

