Related papers: Average first-passage times for character sums

For a finite abelian group $G$ and a positive integer $d$, let $\mathsf s_{d \mathbb N} (G)$ denote the smallest integer $\ell \in \mathbb N_0$ such that every sequence $S$ over $G$ of length $|S| \ge \ell$ has a nonempty zero-sum…

First-passage time problems are ubiquitous across many fields of study including transport processes in semiconductors and biological synapses, evolutionary game theory and percolation. Despite their prominence, first-passage time…

Fix $k$ a positive integer, and let $\ell$ be coprime to $k$. Let $p(k,\ell)$ denote the smallest prime equivalent to $\ell \pmod{k}$, and set $P(k)$ to be the maximum of all the $p(k,\ell)$. We seek lower bounds for $P(k)$. In particular,…

We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…

We prove that the average size of the squares of differences between consecutive primes less than $x$ is $O(x^{0.23+\varepsilon})$ for any fixed $\varepsilon>0$. This improves on a result of Peck, who gave bound $O(x^{0.25+\varepsilon})$ in…

Let $f$ be a positive multiplicative function and let $k\geq 2$ be an integer. We prove that if the prime values $f(p)$ converge to $1$ sufficiently slowly as $p\rightarrow +\infty$, in the sense that $\sum_{p}|f(p)-1|=\infty$, there exists…

The classical Poisson theorem says that if $\xi_1,\xi_2,...$ are i.i.d. 0--1 Bernoulli random variables taking on 1 with probability $p_n\equiv \la/n$ then the sum $S_n=\sum_{i=1}^n\xi_i$ is asymptotically in $n$ Poisson distributed with…

We study the statistics of the first passage of a random walker to absorbing subsets of the boundary of compact domains in different spatial dimensions. We describe a novel diagnostic method to quantify the trajectory-to-trajectory…

For a zero-delayed random walk on the real line, let $\tau(x)$, $N(x)$ and $\rho(x)$ denote the first passage time into the interval $(x,\infty)$, the number of visits to the interval $(-\infty,x]$ and the last exit time from $(-\infty,x]$,…

The first-passage time is proposed as an independent thermodynamic parameter of the statistical distribution that generalizes the Gibbs distribution. The theory does not include the determination of the first passage statistics itself. A…

In this paper, we prove that for any $A>0$ there exist infinitely many primes $p$ for which sums of the Legendre symbol modulo $p$ over an interval of length $(\ln p)^A$ can take large values.

Let $x_i$, $i\in\mathbb{Z}$ be a sequence of i.i.d. standard normal random variables. Consider rectangular Toeplitz $\mathbf{X}=\left(x_{j-i}\right)_{1\leq i\leq p,1\leq j\leq n}$ and circulant $\mathbf{X}=\left(x_{(j-i)\mod…

Let $F_p$ be the field of a prime order $p$. Then for any positive integer $n>1$, for any $\epsilon>0$, and for any subset $A$ of $F_p$, every element of $F_p$ can be represented as a sum of $N$ elements, each of them is a product of $n$…

We obtain an asymptotic formula on the Odlyzko-Stanley enumeration problem. Let $N_m^*(k,b)$ be the number of $k$-subsets $S\subseteq F_p^*$ such that $\sum_{x\in S}x^m=b$. If $m<p^{1-\delta}$, then there is a constant…

Let $k\leq n$. Each polynomial $p\in\oR[x_1,...,x_n]$ can be uniquely written as $p=\sum_{\mu}\mu p_{\mu}$, where $\mu$ ranges over the set $M$ of all monomials in $\oR[x_1,...,x_k]$ and where $p_{\mu}\in\oR[x_{k+1},...,x_n]$. If $p$ is…

Let $\mathcal{G}$ be the greedy algorithm that, for each $\theta\in (0,1]$, produces an infinite sequence of positive integers $(a_n)_{n=1}^\infty$ satisfying $\sum_{n=1}^\infty 1/a_n = \theta$. For natural numbers $p < q$, let…

Let $S= \{ p_1, \ldots, p_s\}$ be a finite, non-empty set of distinct prime numbers and $(U_{n})_{n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j^{(k)})_{j\geq 1}$ an…

We prove a general ergodic-theoretic result concerning the return time statistic, which, properly understood, sheds some new light on the common sense phenomenon known as {\it the law of series}. Let \proc be an ergodic process on finitely…

We derive a general formula of the minimum achievable rate for fixed-to-variable length coding with a regular cost function by allowing the error probability up to a constant $\varepsilon$. For a fixed-to-variable length code, we call the…

We consider an i.i.d. supercritical bond percolation on Z^d , every edge is open with a probability p > p\_c (d), where p\_c (d) denotes the critical parameter for this percolation. We know that there exists almost surely a unique infinite…