Related papers: A tame sequence of transitive Boolean functions

We say that a sequence $(x_n)_{n \in \mathbb{N}}$ in $[0,1)$ has Poissonian pair correlations if \begin{equation*} \lim_{N \to \infty} \frac{1}{N} \# \lbrace 1 \leq l \neq m \leq N: \| x_l - x_m \| \leq \frac{s}{N} \rbrace = 2s…

Consider a stable L\'evy process $X=(X_t,t\geq 0)$ and let $T_x$, for $x>0$, denote the first passage time of $X$ above the level $x$. In this work, we give an alternative proof of the absolute continuity of the law of $T_x$ and we obtain a…

Let $X_1,X_2,...$ be independent variables, each having a normal distribution with negative mean $-\beta<0$ and variance 1. We consider the partial sums $S_n=X_1+...+X_n$, with $S_0=0$, and refer to the process $\{S_n:n\geq0\}$ as the…

We establish the linear independence of time-frequency translates for functions $f$ having one sided decay $\lim_{x\to \infty} |f(x)| e^{cx \log x} = 0$ for all $c>0$. We also prove such results for functions with faster than exponential…

A discrete Gibbsian line ensemble $\mathfrak{L} = (L_1,\dots,L_N)$ consists of $N$ independent random walks on the integers conditioned not to cross one another, i.e., $L_1 \geq \cdots \geq L_N$. In this paper we provide sufficient…

We show that functions of type $X_n = P[Z^n]$, where $P[t]$ is a periodic function and $Z$ is a generic real number, can produce sequences such that any string of values $X_{s}, X_{s+1}, ...,X_{s+m}$ is deterministically independent of past…

We consider a nearest-neighbor, one-dimensional random walk $\{X_n\}_{n\geq 0}$ in a random i.i.d. environment, in the regime where the walk is transient with speed v_P > 0 and there exists an $s\in(1,2)$ such that the annealed law of…

We introduce a simply stated conjecture regarding the maximum mutual information a Boolean function can reveal about noisy inputs. Specifically, let $X^n$ be i.i.d. Bernoulli(1/2), and let $Y^n$ be the result of passing $X^n$ through a…

We study sequences $(x_n)_{n=1}^{\infty}$ of reals given by $x_{n+1} = f(x)$ where $$f(x) = x - \sum_{i=1}^{m} \frac{\alpha_i}{x - \beta_i},$$ where $\alpha_1, \dots, \alpha_m \in \mathbb{R}_{>0}$ and $\beta_1, \dots, \beta_m \in…

Let $b$ be an integer greater than 1 and let $W^{\ee}=(W^{\ee}_n; n\geq 0)$ be a random walk on the $b$-ary rooted tree $\U_b$, starting at the root, going up (resp. down) with probability $1/2+\epsilon$ (resp. $1/2 -\epsilon$), $\epsilon…

Let $G$ be a group with a non-elementary action on a proper CAT(0) space $X$, and let $\mu$ be a measure on $G$ such that the random walk $(Z_n)_n$ generated by $\mu$ has finite second moment on $X$. Let $o$ be a basepoint in $X$, and…

Let $X=\{X_n: n\in\mathbb{N}\}$ be a long memory linear process in which the coefficients are regularly varying and innovations are independent and identically distributed and belong to the domain of attraction of an $\alpha$-stable law…

The stochastic processes of finite length defined by recurrence relations request additional relations specifying the first terms of the process analogously to the initial conditions for the differential equations. As a general rule, in…

The range process $R_n$ of a random walk is the collection of sites visited by the random walk up to time $n$. In this work we deal with the question of whether the range process of a random walk or the range process of a cocycle over an…

A sequence $\Big(u_n\Big)_{n=0}^{\infty}$ is said to be convex if it satisfies the following inequality $$ 2u_n\leq u_{n-1}+u_{n+1}\qquad \mbox{for all}\qquad n\in\mathbb{N}. $$ We present several characterizations of convex sequences and…

Proving a 2009 conjecture of Itai Benjamini, we show: For any C there is an $\varepsilon>0$ such that for any simple graph $G$ on $V$ of size $n$, and $X_0,\ldots$ an ordinary random walk on $G$, $P(\{X_0,\dots, X_{Cn}\}= V) <…

Inspired by a recent paper of I. Grama, E. Le Page and M. Peign\'e, we consider a sequence $(g_n)_{n \geq 1}$ of i.i.d. random $d\times d$-matrices with non-negative entries and study the fluctuations of the process $(\log \vert g_n\cdots…

We extend the use of random evolving sets to time-varying conductance models and utilize it to provide tight heat kernel upper bounds. It yields the transience of any uniformly lazy random walk, on Z^d, d>=3, equipped with uniformly bounded…

We prove that a planar random walk with bounded increments and mean zero which is conditioned to stay in a cone converges weakly to the corresponding Brownian meander if and only if the tail distribution of the exit time from the cone is…

Let $X_n(k)$ be the number of vertices at level $k$ in a random recursive tree with $n+1$ vertices. We prove a functional limit theorem for the vector-valued process $(X_{[n^t]}(1),\ldots, X_{[n^t]}(k))_{t\geq 0}$, for each $k\in\mathbb N$.…