Tightness of Fluctuations of First Passage Percolation on Some Large Graphs

Details Tightness of Fluctuations of First Passage Percolation on Some Large Graphs Tightness of Fluctuations of First Passage Percolation on Some Large Graphs

2010-10-07

arxiv.org/abs/1010.1412v2

Mathematics

Probability

6 pages; added reference ([3])

Scientific paper

The theorem of Dekking and Host regarding tightness around the mean of first passage percolation on the binary tree, from the root to a boundary of a ball, is generalized to a class of graphs which includes all lattices in hyperbolic spaces and the lamplighter graph over N. This class of graphs is closed under product with any bounded degree graph. Few open problems and conjectures are gathered at the end.

Affiliated with

Also associated with

No associations

Rating

Tightness of Fluctuations of First Passage Percolation on Some Large Graphs 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 Tightness of Fluctuations of First Passage Percolation on Some Large Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tightness of Fluctuations of First Passage Percolation on Some Large Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-509593