相关论文: The Clairvoyant Demon Has a Hard Task

Most networks of interest do not live in isolation. Instead they form components of larger systems in which multiple networks with distinct topologies coexist and where elements distributed amongst different networks may interact directly.…

Bootstrap Percolation is a process defined on a graph which begins with an initial set of infected vertices. In each subsequent round, an uninfected vertex becomes infected if it is adjacent to at least $r$ previously infected vertices. If…

We study, on a square lattice, an extension to fully coordinated percolation which we call iterated fully coordinated percolation. In fully coordinated percolation, sites become occupied if all four of its nearest neighbors are also…

Fix $c\in (0,1)$ and let $\Gamma$ be a $\lfloor c n\rfloor$-regular digraph on $n$ vertices drawn uniformly at random. We prove that when $n$ is large, the (non-symmetric) adjacency matrix $M$ of $\Gamma$ is invertible with high…

Large Language Models (LLMs) have benefited enormously from scaling, yet these gains are bounded by five fundamental limitations: (1) hallucination, (2) context compression, (3) reasoning degradation, (4) retrieval fragility, and (5)…

We consider bond percolation on $n$ vertices on a circle where edges are permitted between vertices whose spacing is at most some number L=L(n). We show that the resulting random graph gets a giant component when $L\gg(\log n)^2$ (when the…

We consider percolation on the discrete torus $\mathbb{Z}_n^d$ at $p_c(\mathbb{Z}^d)$, the critical value for percolation on the corresponding infinite lattice $\mathbb{Z}^d$, and within the scaling window around it. We assume that $d$ is a…

In $H$-percolation, we start with an Erd\H{o}s--R\'enyi graph ${\mathcal G}_{n,p}$ and then iteratively add edges that complete copies of $H$. The process percolates if all edges missing from ${\mathcal G}_{n,p}$ are eventually added. We…

We study the behavior of the optimal path between two sites separated by a distance $r$ on a $d$-dimensional lattice of linear size $L$ with weight assigned to each site. We focus on the strong disorder limit, i.e., when the weight of a…

We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…

We consider random interlacements on $\mathbb{Z}^d$, $d \ge 3$. We show that the percolation function that to each $u \ge 0$ attaches the probability that the origin does not belong to an infinite cluster of the vacant set at level $u$, is…

We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…

We consider a geometric percolation process partially motivated by recent work of Hejda and Kala. Specifically, we start with an initial set $X \subseteq \mathbb{Z}^2$, and then iteratively check whether there exists a triangle $T \subseteq…

Consider some matrix waiting for its coefficients to be written. For each column, sample independently a Bernoulli random variable of some parameter $p$. Seeing all this and possibly using extra randomness, Alice then chooses one spot in…

A constellation pattern is a finite increasing rational sequence \(Q=[0=q_0<q_1<\cdots<q_k=1]\), and a \(Q\)-constellation in \([n]\) is obtained by scaling and translating a rational pattern $Q$, with key examples including arithmetic…

Colloidal particles of two types, driven in opposite directions, can segregate into lanes [Vissers et al. Soft Matter 7, 2352 (2011)]. This phenomenon can be reproduced by two-dimensional Brownian dynamics simulations of model particles…

We count the number of countable homogeneous colored linear orderings in $k$ colors. Relatedly, we count the number of countable $C_{n,m}$-homogeneous linear orderings. $C_{n,m}$-homogeneity is a strong homogeneity notion that approximates…

A $P_m$ path in a graph is a path on $m$ vertices. A $P_m$ system of order $n>1$ is a partition of the edges of the complete graph $K_n$ into $P_m$ paths. A $P_m$ system is said to be $k$-colourable if the vertex set of $K_n$ can be…

The state space of our model is the Euclidean space in dimension d = 2. Simultaneously, from all points of a homogeneous Poisson point process, we let grow independent and identically distributed random continuum paths. Each path stops…

A matrix is given in ``shredded'' form if we are presented with the multiset of rows and the multiset of columns, but not told which row is which or which column is which. The matrix is reconstructible if it is uniquely determined by this…