Related papers: Globe-hopping

We study the long-time behavior of the scaled walker (particle) position associated with decoupled continuous-time random walk which is characterized by superheavy-tailed distribution of waiting times and asymmetric heavy-tailed…

An upper bound for the critical probability of long range bond percolation in $d=2$ and $d=3$ is obtained by connecting the bond percolation with the SIR epidemic model, thus complementing the lower bound result in Frei and Perkins…

We study the circumradius of a random section of an $\ell_p$-ellipsoid, $0<p\le \infty$, and compare it with the minimal circumradius over all sections with subspaces of the same codimension. Our main result is an upper bound for random…

In high dimensional percolation at parameter $p < p_c$, the one-arm probability $\pi_p(n)$ is known to decay exponentially on scale $(p_c - p)^{-1/2}$. We show the same statement for the ratio $\pi_p(n) / \pi_{p_c}(n)$, establishing a form…

We study lower bounds on the optimal error probability in classical coding over classical-quantum channels at rates below the capacity, commonly termed quantum sphere-packing bounds. Winter and Dalai have derived such bounds for…

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

We study crossover phenomena in a model of self-avoiding walks with medium-range jumps, that corresponds to the limit $N\to 0$ of an $N$-vector spin system with medium-range interactions. In particular, we consider the critical crossover…

Zhang found a simple, elegant argument deducing the non-existence of an infinite open cluster in certain lattice percolation models (for example, p=1/2 bond percolation on the square lattice) from general results on the uniqueness of an…

We consider a simple symmetric random walk on a spider, that is a collection of half lines (we call them legs) joined at the origin. Our main question is the following: if the walker makes $n$ steps how high can he go up on all legs. This…

Quantum walks are counterparts of classical random walks. They spread faster, which can be exploited in information processing tasks, and constitute a versatile simulation platform for many quantum systems. Yet, some of their properties can…

Spatial search on graphs is one of the most important algorithmic applications of quantum walks. To show that a quantum-walk-based search is more efficient than a random-walk-based search is a difficult problem, which has been addressed in…

Let $p\_n$ be the probability for a planar Poisson-Voronoi cell to have exactly $n$ sides. We construct the asymptotic expansion of $\log p\_n$ up to terms that vanish as $n\to\infty$. We show that {\it two independent biased random walks}…

Poisson processes of so-called $\lambda$-geodesic hyperplanes in $d$-dimensional hyperbolic space are studied for $0\leq\lambda\leq 1$. The case $\lambda=0$ corresponds to genuine geodesic hyperplanes, the case $\lambda=1$ to horospheres…

We report some novel properties of a square lattice filled with white sites, randomly occupied by black sites (with probability $p$). We consider connections up to second nearest neighbours, according to the following rule. Edge-sharing…

In this article, we provide new structural results and algorithms for the Homotopy Height problem. In broad terms, this problem quantifies how much a curve on a surface needs to be stretched to sweep continuously between two positions. More…

Let E be an elliptic curve defined over a number field k. In this paper, we define the ``global discrepancy'' of a finite set Z of algebraic points on E which in a precise sense measures how far the set is from being adelically…

Bell inequalities are mathematical constructs that demarcate the boundary between quantum and classical physics. A new class of multiplicative Bell inequalities originating from a volume maximization game (based on products of correlators…

Sub-Gaussian estimates for the natural random walk is typical of many regular fractal graphs. Subordination shows that there exist heavy tailed jump processes whose jump indices are greater than or equal to two. However, the existing…

The goal of this note is to provide an alternative proof of Theorem 1.1 (i) in [4], that is, if $n\geq 2$ and $M^{\alpha}$ is bounded on $L^{p}(\mathbb{R}^{n})$ for some $\alpha\in \mathbb{C}$ and $p\geq 2$, then we have \begin{align*}…

In the bootstrap percolation model, sites in an $L$ by $L$ square are initially independently declared active with probability $p$. At each time step, an inactive site becomes active if at least two of its four neighbours are active. We…