2018
DOI: 10.1214/17-aihp850
|View full text |Cite
|
Sign up to set email alerts
|

The near-critical Gibbs measure of the branching random walk

Abstract: Consider the supercritical branching random walk on the real line in the boundary case and the associated Gibbs measure ν n,β on the n th generation, which is also the polymer measure on a disordered tree with inverse temperature β. The convergence of the partition function W n,β , after rescaling, towards a nontrivial limit has been proved by Aïdékon and Shi [3] in the critical case β = 1 and by Madaule [34] when β > 1. We study here the near-critical case, where β n → 1, and prove the convergence of W n,βn … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
10
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(12 citation statements)
references
References 49 publications
2
10
0
Order By: Relevance
“…When individuals are sampled according to ν n,β with β < 1, Chauvin and Rouault [11] proved that MRCA(z, z ′ ) converges in law, thus ρ β = 0 for β < 1. This result was then extended by Pain [29], who proved the same convergence holds when considering ν n,βn with β n → 1. The conjecture of Derrida and Spohn was partially proved by Bovier and Kurkova [7] for some binary branching processes with Gaussian increments, by Arguin and Zindy [3] for the overlapping probability in the 2-dimensional discrete Gaussian free field, and by Jagannath [22] for the binary branching random walk.…”
Section: Introductionmentioning
confidence: 67%
See 2 more Smart Citations
“…When individuals are sampled according to ν n,β with β < 1, Chauvin and Rouault [11] proved that MRCA(z, z ′ ) converges in law, thus ρ β = 0 for β < 1. This result was then extended by Pain [29], who proved the same convergence holds when considering ν n,βn with β n → 1. The conjecture of Derrida and Spohn was partially proved by Bovier and Kurkova [7] for some binary branching processes with Gaussian increments, by Arguin and Zindy [3] for the overlapping probability in the 2-dimensional discrete Gaussian free field, and by Jagannath [22] for the binary branching random walk.…”
Section: Introductionmentioning
confidence: 67%
“…Proof. Again, by Lemma A.1 of [29], we can suppose that F ∈ C u b (D). Up to decomposing f into its positive and its negative part, we assume without loss of generality that f ≥ 0.…”
Section: Asymptotic Independence Of the Endpoint And The Shape Of Thementioning
confidence: 99%
See 1 more Smart Citation
“…Chauvin and Rouault [CR97] studied similarly the overlap of subcritical measures, such that β < 1. They proved that in this case, the measure ω n,β converges toward δ 0 , and the measure λ n,β converges toward a proper probability measure on N. For the critical case, Pain [Pai17] proves that if (β n ) is a sequence converging to 1, then lim n→∞ ω n,βn = δ 0 in probability.…”
Section: The Supercritical Gibbs Measurementioning
confidence: 99%
“…This method, which uses the probability Q x defined in the previous section, is due to Aïdékon [3] and sometimes called the peeling lemma, see Shi [75] for more applications. We also incorporate simplifications of this method from Pain [72]. Throughout, let x ≥ 0.…”
Section: Truncated Derivative Martingale: Momentsmentioning
confidence: 99%