相关论文: Comparing balanced $\mathbb{Z}_v$-sequences obtain…

Building on ideas of Gurevich and Shelah for the G\"odel Class, we present a new probabilistic proof of the finite model property for the Guarded Fragment of First-Order Logic. Our proof is conceptually simple and yields the optimal…

In this paper, we investigate discrete regularity estimates for a broad class of temporal numerical schemes for parabolic stochastic evolution equations. We provide a characterization of discrete stochastic maximal $\ell^p$-regularity in…

The purpose of the present paper is to establish moment estimates of Rosenthal type for a rather general class of random variables satisfying certain bounds on the cumulants. We consider sequences of random variables which satisfy a central…

This work prepares new probability bounds for sums of random, independent, Hermitian tensors. These probability bounds characterize large-deviation behavior of the extreme eigenvalue of the sums of random tensors. We extend Lapalace…

Reimann and Slaman initiated the study of sequences that are Martin-L\"of random with respect to a continuous measure, establishing fundamental facts about NCR, the collection of sequences that are not Martin-L\"of random with respect to…

We give an algorithm to determine all the repeated concatenations, in a given base, of a natural number in a residue class. The author recently describes a particular sequence of $v$-palindromes that inspires this investigation. We also…

We propose a kernel-based partial permutation test for checking the equality of functional relationship between response and covariates among different groups. The main idea, which is intuitive and easy to implement, is to keep the…

Let $p>7$ be a prime, let $G=\Z/p\Z$, and let $S_1=\prod_{i=1}^p g_i$ and $S_2=\prod_{i=1}^p h_i$ be two sequences with terms from $G$. Suppose that the maximum multiplicity of a term from either $S_1$ or $S_2$ is at most $\frac{2p+1}{5}$.…

Random paths are time continuous interpolations of random walks. By using Littelmann path model, we associate to each irreducible highest weight module of a Kac Moody algebra g a random path W. Under suitable hypotheses, we make explicit…

Successive pairs of pseudo-random numbers generated by standard linear congruential transformations display ordered patterns of parallel lines. We study the ``ordered'' and ``chaotic'' distribution of such pairs by solving the eigenvalue…

Finding the minimum distance of linear codes is an NP-hard problem. Traditionally, this computation has been addressed by means of the design of algorithms that find, by a clever exhaustive search, a linear combination of some generating…

We show that efficient approximate sampling algorithms, combined with a slow exponential time oracle for computing its output distribution, can be combined into constructing efficient perfect samplers, which sample exactly from a target…

In this work we present a model for computation of random processes in digital computers which solves the problem of periodic sequences and hidden errors produced by correlations. We show that systems with non-invertible non-linearities can…

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

Linear fractional Galton-Watson branching processes in i.i.d.~random environment are, on the quenched level, intimately connected to random difference equations by the evolution of the random parameters of their linear fractional marginals.…

We investigate moment sequences of probability measures on $E\subset\mathbb{R}$ under constraints of certain moments being fixed. This corresponds to studying sections of $n$-th moment spaces, i.e. the spaces of moment sequences of order…

This paper develops some general calculus for GGC and Dirichlet process means functionals. It then proceeds via an investigation of positive Linnik random variables, and more generally random variables derived from compositions of a stable…

We prove concentration results for $\ell_p^n$ operator norms of rectangular random matrices and eigenvalues of self-adjoint random matrices. The random matrices we consider have bounded entries which are independent, up to a possible…

In the paper we study the models of time-changed Poisson and Skellam-type processes, where the role of time is played by compound Poisson-Gamma subordinators and their inverse (or first passage time) processes. We obtain explicitly the…

As society becomes more reliant on computers, cryptographic security becomes increasingly important. Current encryption schemes include the ElGamal signature scheme, which depends on the complexity of the discrete logarithm problem. It is…