Related papers: Zero-one laws for events with positional symmetrie…
Zero-one laws state that probabilistic events of a certain type must occur with probability either $0$ or $1$, and nothing in between. We formulate a syntactic zero-one law, which enjoys good logical properties while being broadly…
A set of binary random variables indexed by a lattice torus is considered. Under a mixing hypothesis, the probability of any proposition belonging to the first order logic of colored graphs tends to 0 or 1, as the size of the lattice tends…
We prove a game-theoretic version of Levy's zero-one law, and deduce several corollaries from it, including non-stochastic versions of Kolmogorov's zero-one law, the ergodicity of Bernoulli shifts, and a zero-one law for dependent trials.…
Classical results for exchangeable systems of random variables are extended to multi-class systems satisfying a natural partial exchangeability assumption. It is proved that the conditional law of a finite multi-class system, given the…
For an $n\times n$ random image with independent pixels, black with probability $p(n)$ and white with probability $1-p(n)$, the probability of satisfying any given first-order sentence tends to 0 or 1, provided both $p(n)n^{\frac{2}{k}}$…
Let (\Omega,\mathcal{B},P) be a probability space, \mathcal{A} a sub-sigma-field of \mathcal{B}, and \mu a regular conditional distribution for P given \mathcal{A}. For various, classically interesting, choices of \mathcal{A} (including…
We prove a law of large numbers in terms of complete convergence of independent random variables taking values in increments of monotone functions, with convergence uniform both in the initial and the final time. The result holds also for…
The probability that a one dimensional excited random walk in stationary ergodic and elliptic cookie environment is transient to the right (left) is either zero or one. This solves a problem posed by Kosygina and Zerner [8].
A zero-one law of Engelbert--Schmidt type is proven for the norm process of a transient random walk. An invariance principle for random walk local times and a limit version of Jeulin's lemma play key roles.
Starting from an n-by-n matrix of zeros, choose uniformly random zero entries and change them to ones, one-at-a-time, until the matrix becomes invertible. We show that with probability tending to one as n tends to infinity, this occurs at…
We correct and streamline the proof of the fact that, at the critical point $\alpha=1$, the vacant set of the two-dimensional random interlacements is infinite (Comets, Popov, 2017). Also, we prove a zero-one law for a natural class of tail…
Let $(\Omega,\mathcal{B},P)$ be a probability space, $\mathcal{A}\subset\mathcal{B}$ a sub-$\sigma$-field, and $\mu$ a regular conditional distribution for $P$ given $\mathcal{A}$. Necessary and sufficient conditions for $\mu(\omega)(A)$ to…
Shelah Spencer [ShSp:304] proved the 0-1 law for the random graphs G(n,p_n), p_n=n^{- alpha}, alpha in (0,1) irrational (set of nodes in [n]= {1, ...,n}, the edges are drawn independently, probability of edge is p_n). One may wonder what…
In this work limit probabilities of first-order properties of the random $s$-uniform hypergraph in the binomial model $G^{s}(n,p)$ are studied. We give a complete discription of all positive $\alpha$ such that $G^{s}(n,n^{-\alpha})$ obeys…
Given a finite sequence of events and a well-defined notion of events being interesting, the Odds-theorem (Bruss (2000)) gives an online strategy to stop on the last interesting event. It is optimal for independent events. Here we study…
We introduce and study a subclass of joint Bernoulli distributions which has the palindromic property. For such distributions the vector of joint probabilities is unchanged when the order of the elements is reversed. We prove for binary…
Let $Q_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are i.i.d. Bernoulli random variables (which take values 0 and 1 with probability 1/2). We prove that $Q_n$ is non-singular with probability…
We derive conditions under which random sequences of polarizations (two-point symmetrizations) converge almost surely to the symmetric decreasing rearrangement. The parameters for the polarizations are independent random variables whose…
Let G_n be the random graph on [n]= {1, ...,n} with the possible edge {i,j} having probability being p_{|i-j|}= 1/|i-j|^alpha, alpha in (0,1) irrational. We prove that the zero one law (for first order logic) holds. The paper is continued…
We establish a strong law of large numbers for one-dimensional continuous-time random walks in dynamic random environments under two main assumptions: the environment is required to satisfy a decoupling inequality that can be interpreted as…