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 MG of Gibbs like measures on the set of piecewise linear convex functions g:R2. It turns out that there is a one-to-one correspondence between the gradient of such convex functions and Laguerre tessellations. Each cell in a Laguerre tessellation is a convex polygon that is marked by a vector ∈R2. Each measure f∈MG in our family is uniquely characterized by a kernel f(x,-,+), which represents the rate at which a line separating two cells associated with marks - and + 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 MG with respect to the dynamics of such Hamilton-Jacobi PDEs. In particular we conjecture the invariance of a suitable subfamily MG of MG. More precisely, we expect that if the initial slope ux(·,0) is selected according to a measure f∈ MG, then at a later time the law of ux(·, t) is given by a measure t(f)∈MG, for a suitable kernel t(f). As we vary t, the kernel 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 R3.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…