Related papers: On a property of random-oriented percolation in a …
We study subcritical two-dimensional oriented percolation seen from its rightmost point on the set of infinite configurations which are bounded above. This a Feller process whose state space is not compact and has no invariant measures. We…
Despite the recently exhibited importance of higher-order interactions for various processes, few flexible (null) models are available. In particular, most studies on hypergraphs focus on a small set of theoretical models. Here, we…
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,…
We consider the Constrained-degree percolation model on the hypercubic lattice, $\mathbb L^d=(\mathbb Z^d,\mathbb E^d)$ for $d\geq 3$. It is a continuous time percolation model defined by a sequence, $(U_e)_{e\in\mathbb E^d}$, of i.i.d.…
The properties of the similarity transformation in percolation theory in the complex plane of the percolation probability are studied. It is shown that the percolation problem on a two-dimensional square lattice reduces to the Mandelbrot…
We present an algorithm to compute the exact probability $R_{n}(p)$ for a site percolation cluster to span an $n\times n$ square lattice at occupancy $p$. The algorithm has time and space complexity $O(\lambda^n)$ with $\lambda \approx…
Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…
We consider the random connection model in which an edge between two Poisson points at distance $r$ is present with probability $g(r)$. We conduct an extreme value analysis on this model, namely by investigating the longest edge with at…
We generalize the random graph evolution process of Bohman, Frieze, and Wormald [T. Bohman, A. Frieze, and N. C. Wormald, Random Struct. Algorithms, 25, 432 (2004)]. Potential edges, sampled uniformly at random from the complete graph, are…
We consider inhomogeneous non-oriented Bernoulli bond percolation on $\mathbb{Z}^d$, where each edge has a parameter depending on its direction. We prove that, under certain conditions, if the sum of the parameters is strictly greater than…
We consider the random right-angled Coxeter group $W_{\Gamma}$ whose presentation graph $\Gamma\sim \mathcal{G}_{n,p}$ is an Erd{\H o}s--R\'enyi random graph on $n$ vertices with edge probability $p=p(n)$. We establish that $p=1/\sqrt{n}$…
The universality of the crossing probability $\pi_{hs}$ of a system to percolate only in the horizontal direction, was investigated numerically by using a cluster Monte-Carlo algorithm for the $q$-state Potts model for $q=2,3,4$ and for…
We consider Bernoulli percolation on transitive graphs of polynomial growth. In the subcritical regime ($p<p_c$), it is well known that the connection probabilities decay exponentially fast. In the present paper, we study the supercritical…
We consider random right-angled Coxeter groups, $W_{\Gamma}$, whose presentation graph $\Gamma$ is taken to be an Erd\H{o}s--R\'enyi random graph, i.e., $\Gamma\sim \mathcal{G}_{n,p}$. We use techniques from probabilistic combinatorics to…
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 introduce a new oriented evolving graph model inspired by biological networks. A node is added at each time step and is connected to the rest of the graph by random oriented edges emerging from older nodes. This leads to a statistical…
We consider the Constrained-degree percolation model in random environment (CDPRE) on the square lattice. In this model, each vertex $v$ has an independent random constraint $\kappa_v$ which takes the value $j\in \{0,1,2,3\}$ with…
We study the phase transition phenomena for long-range oriented percolation and contact process. We studied a contact process in which the range of each vertex are independent, updated dynamically and given by some distribution $N$. We also…
Numerical simulations and finite-size scaling analysis have been carried out to study standard and inverse percolation of straight rigid rods on triangular lattices. In the case of standard (inverse) percolation, the lattice is initially…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…