Related papers: Tessellations derived from random geometric graphs
A new and rather broad class of stationary (i.e. stochastically translation invariant) random tessellations of the $d$-dimensional Euclidean space is introduced, which are called shape-driven nested Markov tessellations. Locally, these…
The typical cell is a key concept for stochastic-geometry based modeling in communication networks, as it provides a rigorous framework for describing properties of a serving zone associated with a component selected at random in a large…
Spatially homogeneous random tessellations that are stable under iteration (nesting) in the 3-dimensional Euclidean space are considered, so-called STIT tessellations. They arise as outcome of a spatio-temporal process of subsequent cell…
Let $Z$ be the typical cell of a stationary Poisson hyperplane tessellation in $\mathbb{R}^d$. The distribution of the number of facets $f(Z)$ of the typical cell is investigated. It is shown, that under a well-spread condition on the…
Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…
We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…
Maps are polygonal cellular networks on Riemann surfaces. This paper analyzes the construction of closed form general representations for the enumerative generating functions associated to maps of fixed but arbitrary genus. The method of…
Given a `genus' function $g=g(n)$, we let $\mathcal{E}^g$ be the class of all graphs $G$ such that if $G$ has order $n$ (that is, has $n$ vertices) then it is embeddable in a surface of Euler genus at most $g(n)$. Let the random graph $R_n$…
This habilitation thesis summarizes the research that I have carried out from 2005 to 2019. It is organized in four chapters. The first three deal with random planar maps. Chapter 1 is about their metric properties: from a general…
The positioning of new cellular walls during cell division plays a key role in shaping plant tissue organization. The influence of cell geometry on the positioning of division planes has been previously captured into various geometrical…
This paper introduces cellular sheaf theory to graphical methods and reciprocal constructions in structural engineering. The elementary mechanics and statics of trusses are derived from the linear algebra of sheaves and cosheaves. Further,…
In their 1993 paper, Arak, Clifford and Surgailis discussed a new model of random planar graph. As a particular case, that model yields tessellations with only T-vertices (T-tessellations). Using a similar approach involving Poisson lines,…
We study the construction of substitution tilings of the plane based on certain simplicial configurations of tangents of the deltoid with evenly distributed orientations. The random tiling ensembles are obtained as a result of tile…
This paper is the second part of a two-part study of an elementary functorial construction of tesselated surfaces from finite groups. This elementary construction was discussed in the first part and generally results in a large collection…
We extend the construction of [19] by introducing spaces of generalized tensor fields on smooth manifolds that possess optimal embedding and consistency properties with spaces of tensor distributions in the sense of L. Schwartz. We thereby…
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…
For a compact and convex window, Mecke described a process of tessellations which arise from cell divisions in discrete time. At each time step, one of the existing cells is selected according to an equally-likely law. Independently, a line…
A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The $t$-tessellability problem aims to decide whether there is a…
We show how, given a sufficiently large point cloud sampled from an embedded 2-manifold in $\mathbb{R}^n$, we may obtain a global representation as a cell complex with vertices given by a representative subset of the point cloud. The vertex…
We present a model of a random field on a topological space $M$ that unifies well-known models such as the Poisson hyperplane tessellation model, the random token model, and the dead leaves model. In addition to generalizing these submodels…