On some fundamental aspects of polyominoes on random Voronoi tilings

From MaRDI portal
Publication:1930643

DOI10.1214/11-BJPS150zbMATH Open1263.60086arXiv1009.3898MaRDI QIDQ1930643FDOQ1930643


Authors: Leandro P. R. Pimentel Edit this on Wikidata


Publication date: 11 January 2013

Published in: Brazilian Journal of Probability and Statistics (Search for Journal in Brave)

Abstract: 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 boxes that are intersected by a Voronoi polyomino, and vice-versa. These results will be crucial to analyze self-avoiding paths, greedy polyominoes and first-passage percolation models on Voronoi tilings and on the dual graph, named the Delaunay triangulation.


Full work available at URL: https://arxiv.org/abs/1009.3898




Recommendations




Cites Work


Cited In (6)





This page was built for publication: On some fundamental aspects of polyominoes on random Voronoi tilings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1930643)