2020
DOI: 10.48550/arxiv.2006.09285
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Random tensors, propagation of randomness, and nonlinear dispersive equations

Abstract: The purpose of this paper is twofold. We introduce the theory of random tensors, which naturally extends the method of random averaging operators in our earlier work [32], to study the propagation of randomness under nonlinear dispersive equations. By applying this theory we also solve Conjecture 1.7 in [32], and establish almost-sure local well-posedness for semilinear Schrödinger equations in spaces that are subcritical in the probabilistic scaling. The solution we find has an explicit expansion in terms of … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
38
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 14 publications
(38 citation statements)
references
References 55 publications
0
38
0
Order By: Relevance
“…This outline is rather simplistic; in reality there are other almost-leading diagrams whose contributions have to be analyzed separately. Moreover, the problem of estimating the diagrams is probabilistically critical in the sense of [10], which is added to the factorial growth of the number of diagrams, to make the execution of this outline far from trivial. We shall review some elements of that proof in Section 3 below, and also refer the reader to Section 3 of [9] for a more detailed exposition.…”
Section: Introductionmentioning
confidence: 99%
“…This outline is rather simplistic; in reality there are other almost-leading diagrams whose contributions have to be analyzed separately. Moreover, the problem of estimating the diagrams is probabilistically critical in the sense of [10], which is added to the factorial growth of the number of diagrams, to make the execution of this outline far from trivial. We shall review some elements of that proof in Section 3 below, and also refer the reader to Section 3 of [9] for a more detailed exposition.…”
Section: Introductionmentioning
confidence: 99%
“…It might be possible to refine the argument below for the multilinear estimates involved in the proof of Theorem 1.5 in the case of High×High→High interactions to show that we can take α > 3 2 in Theorem 1.5, and that this threshold for the dispersion solely comes from the control on High×Low→High interactions with a linear evolution of the random initial data as a high regularity input. This is precisely the bad interaction that is amenable to the more sophisticated method of random averaging operators and random tensors developed recently in [26,27]. Thus we believe that there is a chance that Theorem 1.5 can be improved all the way down to the range α > 1.…”
Section: Remark 14mentioning
confidence: 94%
“…See also the discussions in a similar context in [57,58]. However, note that in the critical case α = d, the exponential NLS appears to be probabilistic critical in the sense of [26,27], and it is not clear at all that the methods developed in these papers could handle this case due to combinatorics losses. Namely, after decomposing the (renormalized) nonlinearity in (1.17) as…”
Section: Remark 14mentioning
confidence: 99%
See 1 more Smart Citation
“…In comparison with Bourgain's trick (1.8), the advantage of the random expansion (1.10) is that the nonlinear remainder z lives at regularity 1´, which is above the deterministic threshold for local well-posedness. More recently, the random averaging operators were generalized to random tensors in [DNY20].…”
mentioning
confidence: 99%