Related papers: Random Cluster Tessellations
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…
A relaxed version of Gummelt's covering rules for the aperiodic decagon is considered, which produces certain random-tiling-type structures. These structures are precisely characterized, along with their relationships to various other…
Random tessellations are a prominent class of models in stochastic geometry. In this chapter, we give an overview of mechanisms that have been used to formulate random tessellation models. First, the notion of a random tessellation and…
We introduce a new class of spatial-temporal point processes based on Voronoi tessellations. At each step of such a process, a point is chosen at random according to a distribution determined by the associated Voronoi cells. The point is…
We generalize the standard site percolation model on the $d$-dimensional lattice to a model on random tessellations of $\mathbb R^d$. We prove the uniqueness of the infinite cluster by adapting the Burton-Keane argument…
We introduce a concept for random tilings which, comprising the conventional one, is also applicable to tiling ensembles without height representation. In particular, we focus on the random tiling entropy as a function of the tile…
This paper is based on the study of random lozenge tilings of non-convex polygonal regions with interacting non-convexities (cuts) and the corresponding asymptotic kernel as in [3] and [4] (discrete tacnode kernel). Here this kernel is used…
We present a rejection method based on recursive covering of the probability density function with equal tiles. The concept works for any probability density function that is pointwise computable or representable by tabular data. By the…
We propose a simple, projection-based algorithm for clustering mixtures of discrete (Bernoulli) distributions. Unlike previous approaches that rely on coordinate-specific ``combinatorial projections,'' our algorithm is rotationally…
In these lecture notes we present some connections between random matrices, the asymmetric exclusion process, random tilings. These three apparently unrelated objects have (sometimes) a similar mathematical structure, an interlacing…
Suppose a set of prototiles allows $N$ different substitution rules. In this paper we study tilings of $\mathbb{R}^d$ constructed from random application of the substitution rules. The space of all possible tilings obtained from all…
A new family of decagonal quasiperiodic tilings are constructed by the use of generalized point substitution processes, which is a new substitution formalism developed by the author [N. Fujita, Acta Cryst. A 65, 342 (2009)]. These tilings…
A new approach to the generation of random sequences and two dimensional random patterns is proposed in this paper in which random sequences are generated by making use of either Delaunay triangulation or Voronoi diagrams drawn from random…
In this paper, we present a cluster algorithm for the simulation of hard spheres and related systems. In this algorithm, a copy of the configuration is rotated with respect to a randomly chosen pivot point. The two systems are then…
Consider a Voronoi tiling of the Euclidean space based on a realization of a inhomogeneous Poisson random set. A Voronoi polyomino is a finite and connected union of Voronoi tiles. In this paper we provide tail bounds for the number of…
In this chapter we review some examples, methods, and recent results involving comparison of clustering properties of point processes. Our approach is founded on some basic observations allowing us to consider void probabilities and moment…
We propose an automated method for detecting galaxy clusters in imaging surveys based on the Voronoi tessellation technique. It appears very promising, expecially for its capability of detecting clusters indipendently from their shape.…
After generalizing the concept of clusters to incorporate clusters that are linked to other clusters through some relatively narrow bridges, an approach for detecting patches of separation between these clusters is developed based on an…
We have implemented different algorithms for generating Poissonian and vectorizable random lattices. The random lattices fulfil the Voronoi/Delaunay construction. We measure the performance of our algorithms for the two types of random…
Some combinatorial properties of fixed boundary rhombus random tilings with octagonal symmetry are studied. A geometrical analysis of their configuration space is given as well as a description in terms of discrete dynamical systems, thus…