2002
DOI: 10.1088/0305-4470/35/29/301
|View full text |Cite
|
Sign up to set email alerts
|

Exact solution for random walks on the triangular lattice with absorbing boundaries

Abstract: Abstract. The problem of a random walk on a finite triangular lattice with a single interior source point and zig-zag absorbing boundaries is solved exactly. This problem has been previously considered intractable.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2002
2002
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 12 publications
0
8
0
Order By: Relevance
“…Random walks, particularly on a lattice, have been extensively studied in the past [10] , [11] , [12] , [13] , [14] . Similar studies have also been used to analyze contact interactions [15] as stochastic processes, to better understand epidemic spread [16] , [17] , [18] , [19] , [20] , [21] , [22] , [23] .…”
Section: Monte Carlo Simulationsmentioning
confidence: 99%
“…Random walks, particularly on a lattice, have been extensively studied in the past [10] , [11] , [12] , [13] , [14] . Similar studies have also been used to analyze contact interactions [15] as stochastic processes, to better understand epidemic spread [16] , [17] , [18] , [19] , [20] , [21] , [22] , [23] .…”
Section: Monte Carlo Simulationsmentioning
confidence: 99%
“…First, true physical systems are not infinite, so that explicit boundary conditions have often to be taken into account in order to properly describe situations in which confinement can be relevant. Second, exact solvable random walk problems in bounded domains are very rare, making this theoretical field an important problem in its own right [8,9,10,11,12,13,14,15].…”
Section: Introductionmentioning
confidence: 99%
“…The exact calculation of the importance of the state (q 1; 0,0) is not possible, see e.g., Batchelor and Henry (2002). To study it we will make the following assumption: "In a three-queue tándem Jackson network with loads p, > p 3 , if the initial system state is (q 1; 0,1) and the number of customers in the third queue reaches L before the third queue empties, q^ customers will be in the third queue when the first one becomes empty".…”
Section: Three-queue Tándem Jackson Networkmentioning
confidence: 99%