Related papers: Accessibility percolation and first-passage site p…

We study models of spatial growth processes where initially there are sources of growth (indicated by the colour green) and sources of a growth-stopping (paralyzing) substance (indicated by red). The green sources expand and may merge with…

We investigate algorithms to find the first vertex in large trees generated by either the uniform attachment or preferential attachment model. We require the algorithm to output a set of $K$ vertices, such that, with probability at least…

We consider first-passage percolation on the edges of $\mathbb{Z}^2 \times \{1, \cdots, k\},$ namely the slab $\mathbb{S}_k$ of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $p_c(\mathbb{S}_k)$)…

Let $T$ be a regular rooted tree. For every natural number $n$, let $B_n$ be the finite subtree of vertices with graph distance at most $n$ from the root. Consider the following forest-fire model on $B_n$: Each vertex can be "vacant" or…

Quantum percolation describes the problem of a quantum particle moving through a disordered system. While certain similarities to classical percolation exist, the quantum case has additional complexity due to the possibility of Anderson…

We study independent long-range percolation on $\mathbb{Z}^d$ for all dimensions $d$, where the vertices $u$ and $v$ are connected with probability 1 for $\|u-v\|_\infty=1$ and with probability $p(\beta,\{u,v\})=1-e^{-\beta…

We prove that the free energy of directed polymer in Bernoulli environment converges to the growth rate for the number of open paths in super-critical oriented percolation as the temperature tends to zero. Our proof is based on rate of…

We study the growth of two competing infection types on graphs generated by the configuration model with a given degree sequence. Starting from two vertices chosen uniformly at random, the infection types spread via the edges in the graph…

Sites in an infinite d-dimensional lattice, open with probability greater or equal to 1/d, form an infinite open path.

We study set selection problems where the weights are uncertain. Instead of its exact weight, only an uncertainty interval containing its true weight is available for each element. In some cases, some solutions are universally optimal;…

Some examples of translation invariant site percolation processes on the $\Z^2$ lattice are constructed, the most far-reaching example being one that satisfies uniform finite energy (meaning that the probability that a site is open given…

We consider the branch-length estimation problem on a bifurcating tree: a character evolves along the edges of a binary tree according to a two-state symmetric Markov process, and we seek to recover the edge transition probabilities from…

A 1-independent bond percolation model on a graph $G$ is a probability distribution on the spanning subgraphs of $G$ in which, for all vertex-disjoint sets of edges $S_1$ and $S_2$, the states of the edges in $S_1$ are independent of the…

Consider a graph on $n$ uniform random points in the unit square, each pair being connected by an edge with probability $p$ if the inter-point distance is at most $r$. We show that as $n\to\infty$ the probability of full connectivity is…

A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…

We present an extension of Voronoi diagrams where when considering which site a client is going to use, in addition to the site distances, other site attributes are also considered (for example, prices or weights). A cell in this diagram is…

In this paper, we study the weighted $n$-dimensional badly approximable points on manifolds. Given a $C^n$ differentiable non-degenerate submanifold $\mathcal{U} \subset \mathbb{R}^n$, we will show that any countable intersection of the…

We investigate the degree sequences of geometric preferential attachment graphs in general compact metric spaces. We show that, under certain conditions on the attractiveness function, the behaviour of the degree sequence is similar to that…

First passage percolation on $\mathbb{Z}^2$ is a model for describing the spread of an infection on the sites of the square lattice. The infection is spread via nearest neighbor sites and the time dynamic is specified by random passage…

We consider the $2$-neighbor bootstrap percolation process on the $n$-dimensional $q$-ary hypercube with vertex set $V=\{0,1,\dots,q-1\}^n$ and edges connecting the pairs at Hamming distance $1$. We extend the main theorem of…