Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
54
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(55 citation statements)
references
References 0 publications
1
54
0
Order By: Relevance
“…Still focusing on the right edge setting, we prove in Section 4.5.1 that K (0) N (x, y) does not contribute in the large N limit. Moreover, we prove the convergence of kernel K (1) N (x, y) to the Airy kernel in an appropriate sense and then complete the proof of Theorem 3(b). For this last step, we use a different approach than in [8,31]: instead of relying on a factorization trick and the Hölder inequality to obtain the trace class convergence, we use an argument involving the regularized Fredholm determinant det 2 to show the convergence of the Fredholm determinants.…”
Section: Outline Of the Proofmentioning
confidence: 81%
See 2 more Smart Citations
“…Still focusing on the right edge setting, we prove in Section 4.5.1 that K (0) N (x, y) does not contribute in the large N limit. Moreover, we prove the convergence of kernel K (1) N (x, y) to the Airy kernel in an appropriate sense and then complete the proof of Theorem 3(b). For this last step, we use a different approach than in [8,31]: instead of relying on a factorization trick and the Hölder inequality to obtain the trace class convergence, we use an argument involving the regularized Fredholm determinant det 2 to show the convergence of the Fredholm determinants.…”
Section: Outline Of the Proofmentioning
confidence: 81%
“…As a consequence, proving the Tracy-Widom fluctuations boils down to establishing the appropriate convergence of rescaled versions K N (x, y) of the kernel K N (x, y) toward the Airy kernel. To this end, we split K N (x, y) into two parts, K (0) N (x, y) and K (1) N (x, y), each involving different integration contours.…”
Section: Outline Of the Proofmentioning
confidence: 99%
See 1 more Smart Citation
“…If v(x) = − ln w(x; t) = (λ + β) ln(x + t) − γ ln x + x + t, and λ < 0, β > 0, γ > 0, t > 0, γ − λ − β > −1, x ∈ (0, ∞), the evaluation of the orthogonal polynomials at the x = 0, reads, (−1) n P n (0; t, γ) ∼ n n+γ−α−β+ 1 2 e −n exp − γ + 1 2 ln γ + γ + λ + β 2 ln(nt)…”
Section: )mentioning
confidence: 99%
“…The numbers of rows in this case are specified as m A n and m C <n. This results in the following structure of the GSVD [38,39], based on Equations (42) and (43):…”
Section: The Regularized Solution For Casementioning
confidence: 99%