Related papers: Zero-one laws for events with positional symmetrie…
We develop e-values and e-processes testing the null hypothesis that a distribution over nonnegative integers is monotone, and that a distribution over integers is unimodal given a certain mode. Our e-processes lead to tests of power one…
As was noted already by A. N. Kolmogorov, any random variable has a Bernoulli component. This observation provides a tool for the extension of results which are known for Bernoulli random variables to arbitrary distributions. Two…
Semiring semantics evaluates logical statements by values in some commutative semiring K. Random semiring interpretations, induced by a probability distribution on K, generalise random structures, and we investigate here the question of how…
We ask for necessary and sufficient conditions for almost sure finiteness of the perpetual integrals of a Levy process. Zero-one laws are already known for Brownian motion with drift and spectrally one-sided Levy processes. Under the…
The random key graph is a random graph naturally associated with the random key predistribution scheme of Eschenauer and Gligor for wireless sensor networks. For this class of random graphs we establish a new version of a conjectured…
We consider a nearest neighbor random walk on the one-dimensional integer lattice with drift towards the origin determined by an asymptotically vanishing function of the number of visits to zero. We show the existence of distinct regimes…
The Bernoulli sieve is a random allocation scheme obtained by placing independent points with the uniform [0,1] law into the intervals made up by successive positions of a multiplicative random walk with factors taking values in the…
We consider the telegraph process with two velocities, $a_1>a_2\in\mathbb{R}$, and two rates of reversal, $\lambda_1,\lambda_2>0$. We study some of its features with respect to the conditional probability measure where both the initial…
We consider the statistical distribution of zeros of random meromorphic functions whose poles are independent random variables. It is demonstrated that correlation functions of these zeros can be computed analytically and explicit…
We establish zero-one laws and convergence laws for monadic second-order logic (MSO) (and, a fortiori, first-order logic) on a number of interesting graph classes. In particular, we show that MSO obeys a zero-one law on the class of…
This note develops Rio's proof [C. R. Math. Acad. Sci. Paris, 1995] of the rate of convergence in the Marcinkiewicz--Zygmund strong law of large numbers to the case of sums of dependent random variables with regularly varying normalizing…
Zero-determinant strategies are a class of strategies in repeated games which unilaterally control payoffs. Zero-determinant strategies have attracted much attention in studies of social dilemma, particularly in the context of evolution of…
In this paper we prove a L\'evy-Ottaviani type of property for the Bernoulli process defined on an interval. Namely, we show that under certain conditions on functions $(a_i)_{i=1}^{n}$ and for independent Bernoulli random variables…
We register a random sequence which has the following properties: it has three segments being the homogeneous Markov processes. Each segment has his own one step transition probability law and the length of the segment is unknown and…
The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…
We give a framework for dealing with 0-1 laws (for first order logic) such that expanding by further random structure tend to give us another case of the framework. From another perspective we deal with 0-1 laws when the number of solutions…
We present conditions that allow us to pass from the convergence of probability measures in distribution to the uniform convergence of the associated quantile functions. Under these conditions, one can in particular pass from the asymptotic…
Let $\mathcal G$ be an addable, minor-closed class of graphs. We prove that the zero-one law holds in monadic second-order logic (MSO) for the random graph drawn uniformly at random from all {\em connected} graphs in $\mathcal G$ on $n$…
Do completely unpredictable events exist in nature? Classical theory, being fully deterministic, completely excludes fundamental randomness. On the contrary, quantum theory allows for randomness within its axiomatic structure. Yet, the fact…
A regular language has the zero-one law if its asymptotic density converges to either zero or one. We prove that the class of all zero-one languages is closed under Boolean operations and quotients. Moreover, we prove that a regular…