Scaling limit of the prudent walk.
Beffara, Vincent, Friedli, Sacha, Velenik, Yvan (2010)
Electronic Communications in Probability [electronic only]
Similarity:
Beffara, Vincent, Friedli, Sacha, Velenik, Yvan (2010)
Electronic Communications in Probability [electronic only]
Similarity:
Gregory F. Lawler (1999)
ESAIM: Probability and Statistics
Similarity:
Kang, Mihyun (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Niederhausen, Heinrich (2005)
Journal of Integer Sequences [electronic only]
Similarity:
Dangovski, Rumen (2012)
Serdica Mathematical Journal
Similarity:
2010 Mathematics Subject Classification: Primary: 05C81. Secondary: 60G50. We consider self-avoiding walks on the square grid graph. More precisely we investigate the number of walks of a fixed length on Z×{-1,0,1}. Using combinatorial arguments we derive the related generating function. We present the asymptotic estimates of the number of walks in consideration, as well as important connective constants.
Tomáš Kouřim, Petr Volf (2020)
Applications of Mathematics
Similarity:
The contribution focuses on Bernoulli-like random walks, where the past events significantly affect the walk's future development. The main concern of the paper is therefore the formulation of models describing the dependence of transition probabilities on the process history. Such an impact can be incorporated explicitly and transition probabilities modulated using a few parameters reflecting the current state of the walk as well as the information about the past path. The behavior...
Bertacchi, Daniela (2006)
Electronic Journal of Probability [electronic only]
Similarity:
Benjamini, Itai, Wilson, David B. (2003)
Electronic Communications in Probability [electronic only]
Similarity:
Gessel, Ira, Weinstein, Jonathan, Wilf, Herbert S. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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.
Kilian Raschel (2011)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
We consider a family of random walks killed at the boundary of the Weyl chamber of the dual of Sp(4), which in addition satisfies the following property: for any ≥ 3, there is in this family a walk associated with a reflection group of order 2. Moreover, the case = 4 corresponds to a process which appears naturally by studying quantum random walks on the dual of Sp(4). For all the processes belonging to this family, we find the exact asymptotic of the Green functions along all infinite...
Bérard, Jean, Ramirez, Alejandro (2007)
Electronic Communications in Probability [electronic only]
Similarity: