Greedy Polyominoes and first-passage times on random Voronoi tilings

Details Greedy Polyominoes and first-passage times on random Voronoi tilings Greedy Polyominoes and first-passage times on random Voronoi tilings

2008-11-03

arxiv.org/abs/0811.0308v2

Mathematics

Probability

31 pages, 2 figures. The proof of the BK-type inequality has moved to Leandro Pimentel's paper "On Some fundamental aspects of

Scientific paper

Let N be distributed as a Poisson random set on R^d with intensity comparable to the Lebesgue measure. Consider the Voronoi tiling of R^d, (C_v)_{v\in N}, where C_v is composed by points x in R^d that are closer to v than to any other v' in N. A polyomino P of size n is a connected union (in the usual R^d topological sense) of n tiles, and we denote by Pi_n the collection of all polyominos P of size n containing the origin. Assume that the weight of a Voronoi tile C_v is given by F(C_v), where F is a nonnegative functional on Voronoi tiles. In this paper we investigate the tail behavior of the maximal weight among polyominoes in Pi_n for some functionals F, mainly when F(C_v) is the number of faces of C_v. Next we apply our results to study self-avoiding paths, first-passage percolation models and the stabbing number on the dual graph, named the Delaunay triangulation. As the main application we show that first passage percolation has at most linear variance.

Affiliated with

Also associated with

No associations

Rating

Greedy Polyominoes and first-passage times on random Voronoi tilings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Greedy Polyominoes and first-passage times on random Voronoi tilings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Greedy Polyominoes and first-passage times on random Voronoi tilings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-234005