2017
DOI: 10.1007/978-3-319-65313-6_12
|View full text |Cite
|
Sign up to set email alerts
|

Large Deviations for the Rightmost Position in a Branching Brownian Motion

Abstract: Dedicated to Professor Valentin Konakov on the occasion of his 70th birthday Summary. We study the lower deviation probability of the position of the rightmost particle in a branching Brownian motion and obtain its large deviation function.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
16
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 15 publications
(17 citation statements)
references
References 24 publications
(38 reference statements)
1
16
0
Order By: Relevance
“…Also, parts (iii) and (iv) of Theorem 1.2 calculated by Gantert and Höfelsauer [7] have been simplified here. Notice here that the rate function in Theorem 1.2 is similar to that of the Branching Brownian Motion (BBM) calculated by Derrida and Shi [6]. As a result, we also see similarities in the figures in Section 2 and those in Derrida and Shi [6].…”
Section: Resultssupporting
confidence: 75%
“…Also, parts (iii) and (iv) of Theorem 1.2 calculated by Gantert and Höfelsauer [7] have been simplified here. Notice here that the rate function in Theorem 1.2 is similar to that of the Branching Brownian Motion (BBM) calculated by Derrida and Shi [6]. As a result, we also see similarities in the figures in Section 2 and those in Derrida and Shi [6].…”
Section: Resultssupporting
confidence: 75%
“…For maximum of branching Brownian motion, Chauvin and Rouault [13] first studied the large deviation probability. Recently, Derrida and Shi [16,17,18] considered both the large deviation and lower deviation. They established precise estimations.…”
Section: Branching Random Walk and Its Maximummentioning
confidence: 99%
“…Motivated by [25], [23] and [17], the goal of this article is to study moderate deviation P(M n ≤ x * n − 3 2θ * log n − n ) with n = O(n). As we already mentioned, [25] first considered this problem with n = o(log n); see Remarks 1.2 and 1.5 below for more details.…”
Section: Branching Random Walk and Its Maximummentioning
confidence: 99%
“…Appendix A.1. Derivation of (15) For the branching Brownian motion, starting from (4), we know that F (z) → 1 as z → ∞ and F (z) → Be ( √ 2−1)z as z → ∞ (see (5)). Therefore for any 0 < η < 2(…”
Section: Appendixmentioning
confidence: 99%
“…In the present work we estimate the long time asymptotics of u(x, t) for x t = c < 2. This large deviation function exhibits a phase transition [15] at some negative velocity…”
Section: Introductionmentioning
confidence: 99%