Related papers: The Clairvoyant Demon Has a Hard Task

Let $d\ge 3$ be a fixed integer. Let $y:= y(p)$ be the probability that the root of an infinite $d$-regular tree belongs to an infinite cluster after $p$-bond-percolation. We show that for every constants $b,\alpha>0$ and $1<\lambda< d-1$,…

This paper presents a Monte-Carlo study of percolation in a distorted square lattice, in which, the adjacent sites are not equidistant. Starting with an undistorted lattice, the position of the lattice sites are shifted through a tunable…

We prove a known 2-coloring of the integers $[N] := \{1,2,3,\ldots,N\}$ minimizes the number of monochromatic arithmetic 3-progressions under certain restrictions. A monochromatic arithmetic progression is a set of equally-spaced integers…

We consider inhomogeneous percolation on a hierarchical configuration model with a heavy-tailed degree distribution. This graph is the configuration model where all the half-edges are colored either black or white, and edges are formed by…

The work is devoted to one of the variations of the Hadwiger--Nelson problem on the chromatic number of the plane. In this formulation one needs to find for arbitrarily small $\varepsilon$ the least possible number of colors needed to color…

Let X be a planar random field on Z^2 which we interpret as a random height function describing some landscape of montains. We consider a source of light (a sun) located at infinity in a direction parallel with an axis od Z^2 and emitting…

Let $d\ge 3$ be a fixed integer, $p\in (0,1)$, and let $n\geq 1$ be a positive integer such that $dn$ is even. Let $\mathbb{G}(n, d, p)$ be a (random) graph on $n$ vertices obtained by drawing uniformly at random a $d$-regular (simple)…

In r-neighbour bootstrap percolation on a graph G, a set of initially infected vertices A \subset V(G) is chosen independently at random, with density p, and new vertices are subsequently infected if they have at least r infected…

Percolation refers to the emergence of a giant connected cluster in a disordered system when the number of connections between nodes exceeds a critical value. The percolation phase transitions were believed to be continuous until recently…

The fourfold research proposal regards in particular: critical oriented percolation; random walk limit laws; neural networks with long-range connections; the ant in a labyrinth.

We study Mandelbrot's percolation process in dimension $d \geq 2$. The process generates random fractal sets by an iterative procedure which starts by dividing the unit cube $[0,1]^d$ in $N^d$ subcubes, and independently retaining or…

We study mixed long-range percolation on the square lattice. Each vertical edge of unit length is independently open with probability $\varepsilon$, and each horizontal edge of length $i$ is independently open with probability $p_i$. Also,…

In this article, we study a bond percolation model on a horizontally stretched square lattice, constructed by stretching the distances between the columns of $\mathbb{Z}_+^2$ according to a collection of independent and identically…

Can autoregressive large language models (LLMs) learn consistent probability distributions when trained on sequences in different token orders? We prove formally that for any well-defined probability distribution, sequence perplexity is…

We investigate the first passage time t_{j,N} to a given chemical or Euclidean distance of the first j of a set of N>>1 independent random walkers all initially placed on a site of a disordered medium. To solve this order-statistics problem…

We consider a dependent percolation model on the square lattice $\mathbb{Z}^2$. The range of dependence is infinite in vertical and horizontal directions. In this context, we prove the existence of a phase transition. The proof exploits a…

Suppose each site independently and randomly chooses some sites around it, and it is weakly (strongly) connected with them (if there choose each other). What is the probability that the weak (strong) connected cluster is infinite? We…

Let $P$ be a set of $2n$ points in convex position, such that $n$ points are colored red and $n$ points are colored blue. A non-crossing alternating path on $P$ of length $\ell$ is a sequence $p_1, \dots, p_\ell$ of $\ell$ points from $P$…

The Unfriendly Partition Conjecture posits that every countable graph admits a 2-colouring in which for each vertex there are at least as many bichromatic edges containing that vertex as monochromatic ones. This is not known in general, but…

We model two-dimensional crystals by a configuration space in which every admissible configuration is a hard disk configuration and a perturbed version of some triangular lattice with side length one. In this model we show that, under the…