Related papers: A lower bound for the Chung-Diaconis-Graham random…

We establish the asymptotic behaviour of $\mu(G(n,p))$, the number of unlabelled induced subgraphs in the binomial random graph $G(n,p)$, for almost the entire range of the probability parameter $p=p(n)\in[0,1]$. In particular, we show that…

We obtain complementary recurrence and transience criteria for processes $X=(X_n)_{n \ge 0}$ with values in $\mathbb R^d_+$ fulfilling a non-linear equation $X_{n+1}=MX_n+g(X_n)+ \xi_{n+1}$. Here $M$ denotes a primitive matrix having…

We investigate a discrimination scheme between unitary processes. By introducing a margin for the probability of erroneous guess, this scheme interpolates the two standard discrimination schemes: minimum-error and unambiguous…

The present paper contains additional asymptotic result over an earlier investigation of Kapelko and Kranakis. Consider $n$ mobile sensors placed independently at random with the uniform distribution on the unit interval $[0,1]$. Fix $a$ an…

Ulam has defined a history-dependent random sequence of integers by the recursion $X_{n+1}$ $= X_{U(n)}+X_{V(n)}, n \geqslant r$ where $U(n)$ and $V(n)$ are independently and uniformly distributed on $\{1,\dots,n\}$, and the initial…

We prove that for $k+1\geq 3$ and $c>(k+1)/2$ w.h.p. the random graph on $n$ vertices, $cn$ edges and minimum degree $k+1$ contains a (near) perfect $k$-matching. As an immediate consequence we get that w.h.p. the $(k+1)$-core of $G_{n,p}$,…

Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…

Chou and Wang's existence result for the $L_p$-Minkowski problem on ${\mathbb S}^{n-1}$ for $p\in(-n,1)$ and an absolutely continuous measure $\mu$ is discussed and extended to more general measures. In particular, we provide an almost…

In this paper, we consider a random walk and a random color scenery on Z. The increments of the walk and the colors of the scenery are assumed to be i.i.d. and to be independent of each other. We are interested in the random process of…

Let X be a second order random process indexed by a compact interval [0,T]. Assume that n independent realizations of X are observed on a fixed grid of p time points. Under mild regularity assumptions on the sample paths of X, we show the…

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

Let $\{X_n,n\ge1\}$ be a sequence of independent and identically distributed random variables, taking non-negative integer values, and call $X_n$ a $\delta$-record if $X_n>\max\{X_1,...,X_{n-1}\}+\delta$, where $\delta$ is an integer…

In the recent preprint [3], Goldston, Pintz, and Y{\i}ld{\i}r{\i}m established, among other things, $$ \liminf_{n\to\infty}{p_{n+1}-p_n\over\log p_n}=0,\leqno(0) $$ with $p_n$ the $n$th prime. In the present article, which is essentially…

Let $\boldsymbol{X}(t)=(X_1(t),\ldots,X_d(t))$ be a Gaussian vector process and $g(t)$ be a continuous function. The asymptotics of distribution of $\left\|\boldsymbol{X}(t)\right\|_p$, the $L^p$ norm for Gaussian finite-dimensional vector,…

In the present paper we show that the processes $X_n = \{X_n(t) \colon t \in [0,1]\}$, $n \in \mathbb{N}$, defined by $X_n(t) = \sqrt{n}C\int_0^t (-1)^{L(nu)} du$, where $L = \{L(t) \colon t \geq 0\}$ is a renewal processes whose…

Bollob\'{a}s and Thomason (1985) proved that for each $k=k(n) \in [1, n-1]$, with high probability, the random graph process, where edges are added to vertex set $V=[n]$ uniformly at random one after another, is such that the stopping time…

By well known results of probability theory, any sequence of random variables with bounded second moments has a subsequence satisfying the central limit theorem and the law of the iterated logarithm in a randomized form. In this paper we…

Let P(x,d,a) denote the number of primes p<=x with p=a(mod d). Chebyshev's bias is the phenomenon that `more often' P(x;d,n)>P(x;d,r) than the other way around, where n is a quadratic non-residue mod d and r is a quadratic residue mod d. If…

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G cong H. For several decades, the n^(log_p n + O(1)) generator-enumeration bound (where p is the smallest prime…

We show the existence of a constant $c > 0$ such that, for all positive integers $n$, there exist integers $1 \leq a_1 < \ldots < a_k \leq n$ such that there are at least $cn^2$ distinct integers of the form $\sum_{i=u}^{v}a_i$ with $1 \leq…