SearcharxivSearch

arXiv · 2108.09361

Random Tessellations and Gibbsian solutions of Hamilton-Jacobi Equations

Abstract

We pursue two goals in this article. As our first goal, we construct a family $\mathcal{M}_G$ of Gibbs like measures on the set of piecewise linear convex functions $g:\mathbb{R}^2\to\mathbb{R}$. It turns out that there is a one-to-one correspondence between the gradient of such convex functions and $\textit{Laguerre tessellations}$. Each cell in a Laguerre tessellation is a convex polygon that is marked by a vector $\rho\in\mathbb{R}^2$. Each measure $\nu^f\in\mathcal{M}_G$ in our family is uniquely characterized by a kernel $f(x,\rho^-,\rho^+)$, which represents the rate at which a line separating two cells associated with marks $\rho^-$ and $\rho^+$ passes through $x$. To construct our measures, we give a precise recipe for the law of the restriction of our tessellation to a box. This recipe involves a boundary condition, and a dynamical description of our random tessellation inside the box. As we enlarge the box, the consistency of these random tessellations requires that the kernel satisfies a suitable kinetic like PDE. As our second goal, we study the invariance of the set $\mathcal{M}_G$ with respect to the dynamics of such Hamilton-Jacobi PDEs. In particular we $\textit{conjecture}$ the invariance of a suitable subfamily $\widehat{\mathcal{M}_G}$ of $\mathcal{M}_G$. More precisely, we expect that if the initial slope $u_x(\cdot,0)$ is selected according to a measure $\nu^{f}\in \widehat{\mathcal{M}_G}$, then at a later time the law of $u_x(\cdot, t)$ is given by a measure $\nu^{\Theta_t(f)}\in\widehat{\mathcal{M}_G}$, for a suitable kernel $\Theta_t(f)$. As we vary $t$, the kernel $\Theta_t(f)$ must satisfy a suitable kinetic equation. We remark that the function $u$ is also piecewise linear convex function in $(x,t)$, and its law is an example of a Gibbs-like measure on the set of Laguerre tessellations of certain convex subsets of $\mathbb{R}^3$.

Explore related subjects

Keep this discovery

BibTeXRIS

Mehdi Ouaki, Fraydoun Rezakhanlou. 2021-08-20. Random Tessellations and Gibbsian solutions of Hamilton-Jacobi Equations. https://doi.org/10.1007/s00220-022-04402-0

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR