Communications on Pure and Applied Mathematics最新文献

The nonlinear Schrödinger equation in the weakly nonlinear regime with random Gaussian fields as initial data is considered. The problem is set on the torus in any dimension greater than two. A conjecture in statistical physics is that there exists a kinetic time scale depending on the frequency localization of the data and on the strength of the nonlinearity, on which the expectation of the squares of moduli of Fourier modes evolve according to an effective equation: the so-called kinetic wave equation. When the kinetic time for our setup is 1, we prove this conjecture up to an arbitrarily small polynomial loss. When the kinetic time is larger than 1, we obtain its validity on a more restricted time scale. The key idea of the proof is the use of Feynman interaction diagrams both in the construction of an approximate solution and in the study of its nonlinear stability. We perform a truncated series expansion in the initial data, and obtain bounds in average in various function spaces for its elements. The linearized dynamics then involves a linear Schrödinger equation with a corresponding random potential whose operator norm in Bourgain spaces we are able to estimate on average. This gives a new approach for the analysis of nonlinear wave equations out of equilibrium, and gives hope that refinements of the method could help settle the conjecture.

We prove that Runge–Kutta (RK) methods for numerical integration of arbitrarily large systems of Ordinary Differential Equations are linearly stable. Standard stability arguments—based on spectral analysis, resolvent condition or strong stability, fail to secure the stability of RK methods for arbitrarily large systems. We explain the failure of different approaches, offer a new stability theory based on the numerical range of the underlying large matrices involved in such systems, and demonstrate its application with concrete examples of RK stability for hyperbolic methods of lines.

This paper deals with the derivation of the mean-field limit for multi-agent systems on a large class of sparse graphs. More specifically, the case of non-exchangeable multi-agent systems consisting of non-identical agents is addressed. The analysis does not only involve PDEs and stochastic analysis but also graph theory through a new concept of limits of sparse graphs (extended graphons) that reflect the structure of the connectivities in the network and has critical effects on the collective dynamics. In this article some of the main restrictive hypothesis in the previous literature on the connectivities between the agents (dense graphs) and the cooperation between them (symmetric interactions) are removed.

In this paper we establish for the first time local semiconvexity estimates for fully nonlinear equations and for obstacle problems driven by integro-differential operators with general kernels. Our proof is based on the Bernstein technique, which we develop for a natural class of nonlocal operators and consider to be of independent interest. In particular, we solve an open problem from Cabré-Dipierro-Valdinoci. As an application of our result, we establish optimal regularity estimates and smoothness of the free boundary near regular points for the nonlocal obstacle problem on domains. Finally, we also extend the Bernstein technique to parabolic equations and nonsymmetric operators.

We prove that Calabi–Yau metrics on compact Calabi–Yau manifolds whose Kähler classes shrink the fibers of a holomorphic fibration have a priori estimates of all orders away from the singular fibers. To this end, we prove an asymptotic expansion of these metrics in terms of powers of the fiber diameter, with $��k�\text{th}�$-order remainders that satisfy uniform $�C^k$-estimates with respect to a collapsing family of background metrics. The constants in these estimates are uniform not only in the sense that they are independent of the fiber diameter, but also in the sense that they only depend on the constant in the estimate for $��k�=�0�$ known from previous work of the second-named author. For $��k�>�0�$, the new estimates are proved by blowup and contradiction, and each additional term of the expansion arises as the obstruction to proving a uniform bound on one additional derivative of the remainder.

We prove the uniqueness of $�L^1$ blow-down limit at infinity for an entire minimizing solution $��u�:�R^2�\to �R^2�$ of a planar Allen–Cahn system with a triple-well potential. Consequently, $�u$ can be approximated by a triple junction map at infinity. The proof exploits a careful analysis of energy upper and lower bounds, ensuring that the diffuse interface remains within a small neighborhood of the approximated triple junction at all scales.