Information recovery from randomly mixed-up message text.

Lember, Jüri; Matzinger, Heinrich

Displaying similar documents to “Information recovery from randomly mixed-up message text.”

Survival time of random walk in random environment among soft obstacles.

Gantert, Nina, Popov, Serguei, Vachkovskaia, Marina (2009)

Electronic Journal of Probability [electronic only]

Similarity:

A note on limiting behaviour of disastrous environment exponents.

Mountford, Thomas S. (2001)

Electronic Journal of Probability [electronic only]

Similarity:

A note on quenched moderate deviations for Sinai’s random walk in random environment

Francis Comets, Serguei Popov (2004)

ESAIM: Probability and Statistics

Similarity:

We consider the continuous time, one-dimensional random walk in random environment in Sinai’s regime. We show that the probability for the particle to be, at time $t$ and in a typical environment, at a distance larger than $t^{a}$ ( $0 < a < 1$ ) from its initial position, is $exp {- Const \cdot t^{a} / [(1 - a) ln t] (1 + o (1))}$ .

Central limit theorem for the excited random walk in dimension $d \geq 2$ .

Bérard, Jean, Ramirez, Alejandro (2007)

Electronic Communications in Probability [electronic only]

Similarity:

Giant vacant component left by a random walk in a random d-regular graph

Jiří Černý, Augusto Teixeira, David Windisch (2011)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

We study the trajectory of a simple random walk on a -regular graph with ≥ 3 and locally tree-like structure as the number of vertices grows. Examples of such graphs include random -regular graphs and large girth expanders. For these graphs, we investigate percolative properties of the set of vertices not visited by the walk until time , where > 0 is a fixed positive parameter. We show that this so-called set exhibits a phase transition in in the following sense: there exists...