2012
DOI: 10.1239/aap/1346955258
|View full text |Cite
|
Sign up to set email alerts
|

Spatial Stit Tessellations: Distributional Results for I-Segments

Abstract: Three-dimensional random tessellations that are stable under iteration (STIT tessellations) are considered. They arise as a result of subsequent cell division, which implies that their cells are not face-to-face. The edges of the cell-dividing polygons are the so-called I-segments of the tessellation. The main result is an explicit formula for the distribution of the number of vertices in the relative interior of the typical I-segment. On the way of its proof other distributional identities for the typical as … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
6
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
5

Relationship

4
1

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 25 publications
1
6
0
Order By: Relevance
“…We start by determining the marginal distribution Q (j) β,t , that is, the birth time distribution of the typical V jweighted maximal k-polytope of Y t . Our next proposition largely extends and unifies earlier results for the special case k = d − 1 and j = 0 in [37] and d = 3, k = 1 and j ∈ {0, 1} in [42].…”
Section: Markov Properties Of Typical Maximal Polytopes and Their Bir...supporting
confidence: 86%
See 1 more Smart Citation
“…We start by determining the marginal distribution Q (j) β,t , that is, the birth time distribution of the typical V jweighted maximal k-polytope of Y t . Our next proposition largely extends and unifies earlier results for the special case k = d − 1 and j = 0 in [37] and d = 3, k = 1 and j ∈ {0, 1} in [42].…”
Section: Markov Properties Of Typical Maximal Polytopes and Their Bir...supporting
confidence: 86%
“…d is strictly increasing for all d ≥ 3. In contrast, for the mean number of internal vertices on the typical length-weighted maximal segment we have that EN In the planar case d = 2, as mentioned above, the probabilities p 1,0 (n) are known from [20,39], whereas for d = 3 the formula for p 1,0 (n) has been established in [42] by different methods. Our approach in the present paper is more general and allows to deduce the corresponding formula also for the length-weighted maximal segment as well as to deal with arbitrary space dimensions.…”
Section: The Number Of Internal Vertices On Maximal Segmentsmentioning
confidence: 99%
“…From each such vertex there are precisely 2d emanating edges and each edge has two vertices as its endpoints (see also [18,Equation (16) To compute N 1 (t) we apply Theorem 7.8 to deduce that The previous result can be used, in particular, to determine the expected length of the typical maximal spherical segment of a splitting tessellation Y t on S d . Let us emphasize that in contrast to the expected length of the typical maximal segment in a Euclidean STIT-tessellation (see [33] for the planar case, [56] for the spatial case and [38,53] for general space dimensions), the expected length of the typical maximal spherical segment of a splitting tessellation Y t on S d is universal and does not depend on the underlying direction distribution κ. Especially, if d = 2, this reduces to 2πt t 2 + 1 − e −t .…”
Section: Typical Maximal Spherical Facesmentioning
confidence: 99%
“…Tessellations of that kind arise for example by subsequent cell division. Among these models the iteration stable or STIT tessellations are of particular interest, because of the number of analytically available results, see [7], [5], [1], [12], [11] and the references therein. They may serve as a reference model for crack and fissure structures or for processes of cell division.…”
Section: Introductionmentioning
confidence: 99%