Related papers: Connectivity patterns in loop percolation I: the r…
We introduce a new correlated percolation model on the $d$-dimensional lattice $\mathbb{Z}^d$ called the random length worms model. Assume given a probability distribution on the set of positive integers (the length distribution) and $v \in…
Models of percolation processes on networks currently assume locally tree-like structures at low densities, and are derived exactly only in the thermodynamic limit. Finite size effects and the presence of short loops in real systems however…
We present a study of connectivity percolation in suspensions of hard spherocylinders by means of Monte Carlo simulation and connectedness percolation theory. We focus attention on polydispersity in the length, the diameter and the…
We study the effects of mobility on two crucial characteristics in multi-scale dynamic networks: percolation and connection times. Our analysis provides insights into the question, to what extent long-time averages are well-approximated by…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…
Percolation and synchronization are two phase transitions that have been extensively studied since already long ago. A classic result is that, in the vast majority of cases, these transitions are of the second-order type, i.e. continuous…
Explosive Percolation describes the abrupt onset of large-scale connectivity that results from a simple random process designed to delay the onset of the transition on an underlying random network or lattice. Explosive percolation…
In [3] the radius of convergence of the generating function of the collision local time of two independent copies of an irreducible, symmetric and transient random walk on Zd, d \geq 1, was studied. Two versions were considered: z1, the…
We study a lattice model where the coupling stochastically switches between repulsive (subtractive) and attractive (additive) at each site with probability p at every time instance. We observe that such kind of coupling stabilizes the local…
Percolation processes on random networks have been the subject of intense research activity over the last decades: the overall phenomenology of standard percolation on uncorrelated and unclustered topologies is well known. Still some…
Fitting percolation into the conformal field theory framework requires showing that connection probabilities have a conformally invariant scaling limit. For critical site percolation on the triangular lattice, we prove that the probability…
We consider the density at a point z = x + i y of critical percolation clusters that touch the left [P_L(z)], right [P_R(z)], or both [P_{LR}(z)] sides of a rectangular system, with open boundary conditions on the top and bottom. The ratio…
Conformal loop ensembles are random collections of loops in a simply connected domain, whose laws are characterized by a natural conformal invariance property. The set of points not surrounded by any CLE loop is a natural random and…
We study here the so called subsequence pattern matching also known as hidden pattern matching in which one searches for a given pattern $w$ of length $m$ as a subsequence in a random text of length $n$. The quantity of interest is the…
We analyze the critical connectivity of systems of penetrable $d$-dimensional spheres having size distributions in terms of weighed random geometrical graphs, in which vertex coordinates correspond to random positions of the sphere centers…
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…
Connectivity is a fundamental structural feature of a network that determines the outcome of any dynamics that happens on top of it. However, an analytical approach to obtain connection probabilities between nodes associated to paths of…
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…
We discuss duality properties of critical Boltzmann planar maps such that the degree of a typical face is in the domain of attraction of a stable distribution with parameter $\alpha\in(1,2]$. We consider the critical Bernoulli bond…