相关论文: Compatible sequences and a slow Winkler percolatio…
A collection of $n$ random events is said to be $(n - 1)$-wise independent if any $n - 1$ events among them are mutually independent. We characterise all probability measures with respect to which $n$ random events are $(n - 1)$-wise…
Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter $p$. By the law of large numbers, the frequency of zeros in the sequence tends to~$p$, and thus we can get better and better…
In our problem, we are given access to a number of sequences of nonnegative i.i.d. random variables, whose realizations are observed sequentially. All sequences are of the same finite length. The goal is to pick one element from each…
A collection of complex sequences of length v is complementary if the sum of their periodic autocorrelation function values at all non-zero shifts is constant. For a complex sequence A=[a_0,a_1,...,a_{v-1}] of length v=dm we define the…
The correlation between a random sequence and its transformed sequences is studied. In the case of a permutation operation or, in other word, the shuffling operation, it is shown that the correlation can be so small that the sequences can…
We characterize when two conic curved creases are compatible with each other, when the rule lines must converge to conic foci and reflect at the crease. Namely, two conics are compatible (can be connected by rule segments in a foldable…
We study a version of compact directed percolation (CDP) in one dimension in which occupation of a site for the first time requires that a "mine" or antiparticle be eliminated. This process is analogous to the variant of directed…
The problem is addressed of defining the values of functions, whose variables tend to infinity, from the knowledge of these functions at asymptotically small variables close to zero. For this purpose, the extrapolation by means of different…
Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at a leaf of the tree, i.e. below a previously placed number.…
Consider Bernoulli(1/2) percolation on $\mathbb{Z}^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make…
We characterize the minimum-length sequences of independent lazy simple transpositions whose composition is a uniformly random permutation. For every reduced word of the reverse permutation there is exactly one valid way to assign…
We study complete interpolating sequences in two types of small Fock spaces, $\mathcal{F}^p_{\alpha +}$ and $\mathcal{F}^p_{\alpha}$, for $0 < p \le \infty$. One-sided small Fock spaces $\mathcal{F}^p_{\alpha +}$ are well-studied spaces of…
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…
Consider an independent site percolation model on $\Z^d$, with parameter $p \in (0,1)$, where all long range connections in the axes directions are allowed. In this work we show that given any parameter $p$, there exists and integer $K(p)$…
For a sequence of nonnegative random variables, we provide simple necessary and sufficient conditions to ensure that each sequence of its forward convex combinations converges in probability to the same limit. These conditions correspond to…
We study limit laws for simple random walks on supercritical long-range percolation clusters on the integer lattice. For the long range percolation model, the probability that two vertices are connected behaves asymptotically as a negative…
Two permutations $s$ and $t$ are $k$-similar if they can be decomposed into subpermutations $s^1, \ldots, s^k$ and $t^1, \ldots, t^k$ such that $s^i$ is order-isomorphic to $t^i$ for all $i$. Recently, Dudek, Grytczuk and Ruci\'nski posed…
This paper studies when a sequence of probability measures on a metric space admit subsequential weak limits. A sufficient condition called sequential tightness is formulated, which relaxes some assumptions for asymptotic tightness used in…
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}}$…
We say that a sequence $\{x_n\}_{n \geq 1}$ in $[0,1)$ has Poissonian pair correlations if \begin{equation*} \lim_{N \rightarrow \infty} \frac{1}{N} \# \left\{ 1 \leq l \neq m \leq N \, : \, \left\lVert x_l-x_m \right\rVert < \frac{s}{N}…