[HTML][HTML] Lipschitz embeddings of random sequences
We develop a new multi-scale framework flexible enough to solve a number of problems
involving embedding random sequences into random sequences. Grimmett et al.(Random …
involving embedding random sequences into random sequences. Grimmett et al.(Random …
Three problems for the clairvoyant demon
G Grimmett - arXiv preprint arXiv:0903.4749, 2009 - arxiv.org
A number of tricky problems in probability are discussed, having in common one or more
infinite sequences of coin tosses, and a representation as a problem in dependent …
infinite sequences of coin tosses, and a representation as a problem in dependent …
Percolation of words on the hypercubic lattice with one-dimensional long-range interactions
We investigate the problem of percolation of words in a random environment. To each
vertex, we independently assign a letter 0 or 1 according to Bernoulli rv's with parameter p …
vertex, we independently assign a letter 0 or 1 according to Bernoulli rv's with parameter p …
[图书][B] Lipschitz Embeddings of Random Objects and Related Topics
R Basu - 2015 - search.proquest.com
More than twenty years ago Peter Winkler introduced a fascinating class of dependent or co-
ordinate percolation models with his compatible sequences and clairvoyant demon …
ordinate percolation models with his compatible sequences and clairvoyant demon …
Percolação de palavras em grafos de longo alcance
CS do Amaral - 2012 - repositorio.ufmg.br
O modelo de percolação de palavras que iremos estudar foi introduzido por Benjamini e
Kesten [2] em 1995. Nesse modelo consideramos um grafo infinito, enumerável e …
Kesten [2] em 1995. Nesse modelo consideramos um grafo infinito, enumerável e …