SearcharxivSearch

arXiv · 1304.2572

Branching random tessellations with interaction: A thermodynamic view

Abstract

A branching random tessellation (BRT) is a stochastic process that transforms a coarse initial tessellation of $\mathbb{R}^d$ into a finer tessellation by means of random cell divisions in continuous time. This concept generalises the so-called STIT tessellations, for which all cells split up independently of each other. Here, we allow the cells to interact, in that the division rule for each cell may depend on the structure of the surrounding tessellation. Moreover, we consider coloured tessellations, for which each cell is marked with an internal property, called its colour. Under a suitable condition, the cell interaction of a BRT can be specified by a measure kernel, the so-called division kernel, that determines the division rules of all cells and gives rise to a Gibbsian characterisation of BRTs. For translation invariant BRTs, we introduce an "inner" entropy density relative to a STIT tessellation. Together with an inner energy density for a given "moderate" division kernel, this leads to a variational principle for BRTs with this prescribed kernel, and further to an existence result for such BRTs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hans-Otto Georgii, Tomasz Schreiber, Christoph Thäle. 2015-09-09. Branching random tessellations with interaction: A thermodynamic view. https://doi.org/10.1214/14-aop923

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