Consistent minimal displacement of branching random walks.
Fang, Ming, Zeitouni, Ofer (2010)
Electronic Communications in Probability [electronic only]
Similarity:
Fang, Ming, Zeitouni, Ofer (2010)
Electronic Communications in Probability [electronic only]
Similarity:
Puyhaubert, Vincent (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Nadia Creignou, Hervé Daudé (2003)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The aim of this paper is to study the threshold behavior for the satisfiability property of a random -XOR-CNF formula or equivalently for the consistency of a random Boolean linear system with variables per equation. For we show the existence of a sharp threshold for the satisfiability of a random -XOR-CNF formula, whereas there are smooth thresholds for and .
Roch, Sébastien (2005)
Electronic Communications in Probability [electronic only]
Similarity:
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 and in a typical environment, at a distance larger than () from its initial position, is .
Ivan Kramosil (1990)
Kybernetika
Similarity:
Gantert, Nina, Popov, Serguei, Vachkovskaia, Marina (2009)
Electronic Journal of Probability [electronic only]
Similarity:
Miodrag Živković (2008)
Review of the National Center for Digitization
Similarity:
Kunal Dutta, C.R. Subramanian (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Given a simple directed graph D = (V,A), let the size of the largest induced acyclic tournament be denoted by mat(D). Let D ∈ D(n, p) (with p = p(n)) be a random instance, obtained by randomly orienting each edge of a random graph drawn from Ϟ(n, 2p). We show that mat(D) is asymptotically almost surely (a.a.s.) one of only 2 possible values, namely either b*or b* + 1, where b* = ⌊2(logrn) + 0.5⌋ and r = p−1. It is also shown that if, asymptotically, 2(logrn) + 1 is not within a distance...