Consider the following elliptic system: \begin{equation*} \left\{\aligned&-\ve^2\Delta u_1+\lambda_1u_1=\mu_1u_1^3+\alpha_1u_1^{p-1}+\beta u_2^2u_1\quad&\text{in }\Omega,\\ &-\ve^2\Delta u_2+\lambda_2u_2=\mu_2u_2^3+\alpha_2u_2^{p-1}+\beta u_1^2u_2\quad&\text{in }\Omega,\\ &u_1,u_2>0\quad\text{in }\Omega,\quad u_1=u_2=0\quad\text{on }\partial\Omega,\endaligned\right. \end{equation*} where $\Omega\subset\bbr^4$ is a bounded domain, $\lambda_i,\mu_i,\alpha_i>0$ $(i=1,2)$ and $\beta\not=0$ are constants, $\ve>0$ is a small parameter and $2<p<2^*=4$. By using variational methods, we study the existence of ground state solutions to this system for sufficiently small $\ve>0$. The concentration behaviors of least-energy solutions as $\ve\to0^+$ are also studied. Furthermore, by combining elliptic estimates and local energy estimates, we obtain the locations of these spikes as $\ve\to0^+$.

Future state prediction for nonlinear dynamical systems is a challenging task, particularly when only a few time series samples for high-dimensional variables are available from real-world systems. In this work, we propose a model-free framework, named randomly distributed embedding (RDE), to achieve accurate future state prediction based on short-term high-dimensional data. Specifically, from the observed data of high-dimensional variables, the RDE framework randomly generates a sufficient number of low-dimensional “nondelay embeddings” and maps each of them to a “delay embedding,” which is constructed from the data of a to be predicted target variable. Any of these mappings can perform as a low-dimensional weak predictor for future state prediction, and all of such mappings generate a distribution of predicted future states. This distribution actually patches all pieces of association information from various embeddings unbiasedly or biasedly into the whole dynamics of the target variable, which after operated by appropriate estimation strategies, creates a stronger predictor for achieving prediction in a more reliable and robust form. Through applying the RDE framework to data from both representative models and real-world systems, we reveal that a high-dimension feature is no longer an obstacle but a source of information crucial to the accurate prediction for short-term data, even under noise deterioration.

Mean field games (MFG) and mean field control (MFC) are critical classes of multi-agent models for efficient analysis of massive populations of interacting agents. Their areas of application span topics in economics, finance, game theory, industrial engineering, crowd motion, and more. In this paper, we provide a flexible machine learning framework for the numerical solution of potential MFG and MFC models. State of-the-art numerical methods for solving such problems utilize spatial discretization that leads to a curse-of-dimensionality. We approximately solve high-dimensional problems by combining Lagrangian and Eulerian viewpoints and leveraging recent advances from machine learning. More precisely, we work with a Lagrangian formulation of the problem and enforce the underlying Hamilton-Jacobi-Bellman (HJB) equation that is derived from the Eulerian formulation. Finally, a tailored neural network parameterization of the MFG/MFC solution helps us avoid any spatial discretization. Our numerical results include the approximate solution of 100-dimensional instances of optimal transport and crowd motion problems on a standard work station and a validation using a Eulerian solver in two dimensions. These results open the door to much-anticipated applications of MFG and MFC models that were beyond reach with existing numerical methods.

We consider Hermitian random band matrices $H=(h_{xy})$ on the $d$-dimensional lattice $(\Z/L\Z)^d$. The entries $h_{xy}$ are independent (up to Hermitian conditions) centered complex Gaussian random variables with variances $s_{xy}=\mathbb E|h_{xy}|^2$. The variance matrix $S=(s_{xy})$ has a banded structure so that $s_{xy}$ is negligible if $|x-y|$ exceeds the band width $W$. In dimensions $d\ge 8$, we prove that, as long as $W\ge L^\e$ for a small constant $\e>0$, with high probability most bulk eigenvectors of $H$ are delocalized in the sense that their localization lengths are comparable to $L$. Denote by $G(z)=(H-z)^{-1}$ the Green's function of $H$. For $\im z\gg W^2/L^2$, we also prove a widely used criterion in physics for quantum diffusion of this model, namely, the leading term in the Fourier transform of $\E|G_{xy}(z)|^2$ with respect to $x-y$ is of the form $(\im z + a(p))^{-1}$ for some $a(p)$ quadratic in $p$, where $p$ is the Fourier variable. Our method is based on an expansion of $T_{xy}=|m|^2 \sum_{\alpha}s_{x\alpha}|G_{\alpha y}|^2$ and it requires a self-energy renormalization up to error $W^{-K}$ for any large constant $K$ independent of $W$ and $L$. We expect that this method can be extended to non-Gaussian band matrices.

No abstract uploaded!