2008
DOI: 10.1007/s00220-008-0652-9
|View full text |Cite
|
Sign up to set email alerts
|

Non-Intersecting Squared Bessel Paths and Multiple Orthogonal Polynomials for Modified Bessel Weights

Abstract: We study a model of n non-intersecting squared Bessel processes in the confluent case: all paths start at time t = 0 at the same positive value x = a, remain positive, and are conditioned to end at time t = T at x = 0. In the limit n → ∞, after appropriate rescaling, the paths fill out a region in the tx-plane that we describe explicitly. In particular, the paths initially stay away from the hard edge at x = 0, but at a certain critical time t * the smallest paths hit the hard edge and from then on are stuck t… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

3
120
0
6

Year Published

2008
2008
2021
2021

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 82 publications
(130 citation statements)
references
References 56 publications
3
120
0
6
Order By: Relevance
“…To this end, we mainly follow the theme laid out in [38], although the argument is somehow more involved since our RH problem is of size 4 × 4 whereas the dimension treated in [38] is 3 × 3. Furthermore, we have more generic cases to consider here.…”
Section: Steepest Descent Analysis For Y (Z)mentioning
confidence: 99%
See 3 more Smart Citations
“…To this end, we mainly follow the theme laid out in [38], although the argument is somehow more involved since our RH problem is of size 4 × 4 whereas the dimension treated in [38] is 3 × 3. Furthermore, we have more generic cases to consider here.…”
Section: Steepest Descent Analysis For Y (Z)mentioning
confidence: 99%
“…[20,33,36,49]. The case where a > 0 and b = 0 was considered in [38] and [39]. In that situation, all paths, after proper scaling, initially stay away from the hard edge at x = 0, but at a certain critical time t * the lowest paths hit the hard edge and are stuck to it from then on.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…nonintersecting random walks) are fixed to the sites located near to the origin. When we impose the condition to stay positive for all vicious walkers, we say "with a wall" (at the origin) [3,8,21,12,20,22]. The height of N-watermelon is the maximum site visited by the vicious walker, who walks the farthest path from the origin.…”
Section: X(t) ≡ |B(t)|mentioning
confidence: 99%