Tightness of fluctuations of first passage percolation on some large graphs

Itai Benjamini, Ofer Zeitouni

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

The theorem of Dekking and Host [Probab. Theor. Relat. Fields 90, 403-426 (1991)] 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 . This class of graphs is closed under product with any bounded degree graph. Few open problems and conjectures are gathered at the end.

Original languageEnglish
Title of host publicationGeometric Aspects of Functional Analysis
Subtitle of host publicationIsrael Seminar 2006-2010
EditorsBo'az Klartag, Shahar Mendelson, Vitali D. Milman
PublisherSpringer Verlag
Chapter6
Pages127-132
Number of pages6
ISBN (Print)9783642298486
DOIs
StatePublished - 29 May 2012

Publication series

NameLecture Notes in Mathematics
Volume2050

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory

Fingerprint

Dive into the research topics of 'Tightness of fluctuations of first passage percolation on some large graphs'. Together they form a unique fingerprint.

Cite this