Line-of-sight percolation

Line-of-sight percolation

Given $\omega\ge 1$, let $Z^2_{(\omega)}$ be the graph with vertex set $Z^2$ in which two vertices are joined if they agree in one coordinate and differ by at most $\omega$ in the other. (Thus $Z^2_{(1)}$ is precisely $Z^2$.) Let $p_c(\omega)$ be the critical probability for site percolation in $Z^2...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Bollobas, B, Janson, S, Riordan, O
Formáid:	Journal article
Teanga:	English
Foilsithe / Cruthaithe:	2007

Míreanna comhchosúla

Spread-out percolation in R^d
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2005)

Percolation.
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2006)

Clique percolation
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2008)

Sharp thresholds and percolation in the plane
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2004)

Percolation on self-dual polygon configurations
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2010)

Percolation on dual lattices with k-fold symmetry
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2006)

Percolation on random Johnson-Mehl tessellations and related models
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2006)

The critical probability for random Voronoi percolation in the plane is 1/2
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2004)

Erratum: Percolation on random Johnson-Mehl tessellations and related models
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2009)

Percolation on dense graph sequences
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2007)

Linear algebra and bootstrap percolation
de réir: Balogh, J, et al.
Foilsithe / Cruthaithe: (2011)

The threshold for jigsaw percolation on random graphs
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2017)

Percolation on random Johnson-Mehl tessellations and related models (vol 140, pg 319, 2008)
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2010)

On the maximum running time in graph bootstrap percolation
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2017)

Percolation on sequences of graphs
de réir: Riordan, O
Foilsithe / Cruthaithe: (2010)

On covering by translates of a set
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2009)

The phase transition in the uniformly grown random graph has infinite order
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2005)

Sparse random graphs with clustering
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2008)

The phase transition in inhomogeneous random graphs
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2005)

The cut metric, random graphs, and branching processes
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2009)

Monotone graph limits and quasimonotone graphs
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2011)

Explosive percolation is continuous.
de réir: Riordan, O, et al.
Foilsithe / Cruthaithe: (2011)

Subcritical $ \mathcal{U}$-bootstrap percolation models have non-trivial phase transitions
de réir: Balister, P, et al.
Foilsithe / Cruthaithe: (2016)

Line-of-sight and non-line-of-sight links for dispersive terahertz wireless networks
de réir: Yasaman Ghasempour, et al.
Foilsithe / Cruthaithe: (2021-04-01)

Metrics for sparse graphs
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2007)

Slow emergence of the giant component in the growing m-out graph
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2005)

Asymptotic normality of the size of the giant component via a random walk
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2010)

A simple branching process approach to the phase transition in $G_{n,p}$
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2012)

A note on the Harris-Kesten Theorem
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2005)

Sparse graphs: metrics and random models
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2008)

A short proof of the Harris-Kesten Theorem
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2004)

Asymptotic normality of the size of the giant component in a random hypergraph
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2012)

An old approach to the giant component problem
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2012)

Exploring hypergraphs with martingales
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2017)

Counting dense connected hypergraphs via the probabilistic method
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2018)

Asymptotic normality of the size of the giant component in a random hypergraph
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2011)

Asymptotic normality of the size of the giant component via a random walk
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2011)

Long-range last-passage percolation on the line
de réir: Foss, S, et al.
Foilsithe / Cruthaithe: (2011)

Time-of-arrival–based localization algorithm in mixed line-of-sight/non-line-of-sight environments
de réir: Peixin Wang, et al.
Foilsithe / Cruthaithe: (2020-03-01)

Accurate Underwater Optical Wireless Communication Model With Both Line-of-Sight and Non-Line-of-Sight Channels
de réir: Chengwei Fang, et al.
Foilsithe / Cruthaithe: (2022-01-01)