SearcharxivSearch

arXiv · 1204.2999

The Poisson Rain Tessellation Under Spatial Expansion and Temporal Transformation

Abstract

For cell-division processes in a window, Cowan introduced four selection rules and two division rules each of which stands for one cell-division model. One of these is the area-weighted in-cell model. In this model, each cell is selected for division with a probability that corresponds to the ratio between its area and the area of the whole window. This selected cell is then divided by throwing a (uniformly distributed) point into the cell and drawing a line segment through the point under a random angle with the segment ending at the cell's boundary. For the STIT model which uses both a different selection and a different division rule, Mart\'inez and Nagel showed that for a STIT process {Y(t, W): t > 0} the process {exp(t) Y(exp(t), W): t real} is not only spatially stationary but also temporally. For a continuous-time area-weighted in-cell model it is shown by using the different and generalizing approach of a Poisson Rain that in order to get temporal stationarity it is necessary to have an exponential spatial expansion. For the temporal transformation it is found that there is a strong relation between that transformation and the intensity of the Poisson Rain in time.

Explore related subjects

Keep this discovery

BibTeXRIS

Eike Biehler. 2012-04-13. The Poisson Rain Tessellation Under Spatial Expansion and Temporal Transformation. https://arxiv.org/abs/1204.2999

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