Related papers: Tessellations derived from random geometric graphs
We demonstrate how concepts of statistical mechanics of interacting particles can have important implications in the choice of interaction potentials to model qualitative properties of cell aggregates in theoretical biology. We illustrate…
The point process of vertices of an iteration infinitely divisible or more specifically of an iteration stable random tessellation in the Euclidean plane is considered. We explicitly determine its covariance measure and its pair-correlation…
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and…
For any graph consisting of $k$ vertices and $m$ edges we construct an ensemble of random pure quantum states which describe a system composed of $2m$ subsystems. Each edge of the graph represents a bi-partite, maximally entangled state.…
We study the problem of determining the distribution of vertices of a particular given type in the set of all Feynman tree graphs in quantum field theories. We show that in almost all cases a Gaussian distribution arises asymptotically, and…
The adhesion approximation is a simple analytical model suggested for explanation of the major geometrical features of the observed structure in the galaxy distribution on scales from 1 to (a few)x100/h Mpc. It is based on Burgers' equation…
Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are…
We study the statistics of edges and vertices in the vicinity of a reference vertex (origin) within random planar quadrangulations and Eulerian triangulations. Exact generating functions are obtained for theses graphs with fixed numbers of…
Voronoi tessellations of scale-invariant fractal sets are characterized by topological and metrical properties that are significantly different from those of natural cellular structures. As an example we analyze Voronoi diagrams of…
Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…
We study a model of growing planar tree graphs where in each time step we separate the tree into two components by splitting a vertex and then connect the two pieces by inserting a new link between the daughter vertices. This model…
The concept of splitting tessellations and splitting tessellation processes in spherical spaces of dimension $d\geq 2$ is introduced. Expectations, variances and covariances of spherical curvature measures induced by a splitting…
We study a random graph model in continuous time. Each vertex is partially copied with the same rate, i.e.\ an existing vertex is copied and every edge leading to the copied vertex is copied with independent probability $p$. In addition,…
We observe a realization of a stationary generalized weighted Voronoi tessellation of the d-dimensional Euclidean space within a bounded observation window. Given a geometric characteristic of the typical cell, we use the minus-sampling…
We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
A tessellation or tiling is a collection of sets, called tiles, that cover a plane without gaps and overlaps. The present note is an invitation to get to know the beauty and majesty of tessellations and triangulation of orientable surfaces.
We study the problem of computing the homology of the configuration spaces of a finite cell complex $X$. We proceed by viewing $X$, together with its subdivisions, as a subdivisional space--a kind of diagram object in a category of cell…
For a class of cell division processes, generating tessellations of the Euclidean space $\mathbb{R}^d$, spatial consistency is investigated. This addresses the problem whether the distribution of these tessellations, restricted to a bounded…
A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a…