On the shuffling algorithm for domino tilings.
Nordenstam, Eric J.G. (2010)
Electronic Journal of Probability [electronic only]
Similarity:
Nordenstam, Eric J.G. (2010)
Electronic Journal of Probability [electronic only]
Similarity:
A. B. Dieker, J. Warren (2008)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
We find the transition kernels for four markovian interacting particle systems on the line, by proving that each of these kernels is intertwined with a Karlin–McGregor-type kernel. The resulting kernels all inherit the determinantal structure from the Karlin–McGregor formula, and have a similar form to Schütz’s kernel for the totally asymmetric simple exclusion process.
Penrose, Mathew D. (2008)
Probability Surveys [electronic only]
Similarity:
Kosygina, Elena, Zerner, Martin P.W. (2008)
Electronic Journal of Probability [electronic only]
Similarity:
Ferrari, Pablo A., Marić, Nevena (2007)
Electronic Journal of Probability [electronic only]
Similarity:
Alexei Borodin, Maurice Duits (2011)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
We study a Markov process on a system of interlacing particles. At large times the particles fill a domain that depends on a parameter > 0. The domain has two cusps, one pointing up and one pointing down. In the limit ↓ 0 the cusps touch, thus forming a tacnode. The main result of the paper is a derivation of the local correlation kernel around the tacnode in the transition regime ↓ 0. We also prove that the local process interpolates between the Pearcey process and the GUE...
Borodin, Alexei, Ferrari, Patrik L. (2008)
Electronic Journal of Probability [electronic only]
Similarity:
Christophe Gallesco, Sebastian Müller, Serguei Popov (2011)
ESAIM: Probability and Statistics
Similarity:
Spider walks are systems of interacting particles. The particles move independently as long as their movements do not violate some given rules describing the relative position of the particles; moves that violate the rules are not realized. The goal of this paper is to study qualitative properties, as recurrence, transience, ergodicity, and positive rate of escape of these Markov processes.
Christophe Gallesco, Sebastian Müller, Serguei Popov (2012)
ESAIM: Probability and Statistics
Similarity:
Spider walks are systems of interacting particles. The particles move independently as long as their movements do not violate some given rules describing the relative position of the particles; moves that violate the rules are not realized. The goal of this paper is to study qualitative properties, as recurrence, transience, ergodicity, and positive rate of escape of these Markov processes.
Ferrari, P.A., Fontes, L.R.G. (1998)
Electronic Journal of Probability [electronic only]
Similarity:
Kurkova, I., Popov, S., Vachkovskaia, M. (2004)
Electronic Journal of Probability [electronic only]
Similarity: