Related papers: Phase transitions in diluted negative-weight perco…
In this paper we will consider the contact process in a very simple type of random environment that physicists call the random dilution model. We start with the contact process on a graph, here either $\mathbb{Z}^d$, a $d$-dimensional torus…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of…
Cascading failures in complex systems have been studied extensively using two different models: $k$-core percolation and interdependent networks. We combine the two models into a general model, solve it analytically and validate our…
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…
This study introduces a pore morphology algorithm that emphasizes the central role of topology in multiphase flow through porous media. Analysis of drainage in lattice-based pore networks identifies two key quantities, the percolation…
For massless vertex-transitive transient graphs, the percolation phase transition for the level sets of the Gaussian free field on the associated continuous cable system is particularly well understood, and in particular the associated…
We investigate the percolation properties of a two-state (occupied - empty) cellular automaton, where at each time step a cluster of occupied sites is removed and the same number of randomly chosen empty sites are occupied again. We find a…
We introduce the \emph{leaf-excluded} percolation model, which corresponds to independent bond percolation conditioned on the absence of leaves (vertices of degree one). We study the leaf-excluded model on the square and simple-cubic…
The percolation study offers valuable insights into the characteristics of phase transition, shedding light on the underlying mechanisms that govern the formation of global connectivity within the system. We explore the percolation phase…
In this paper the percolation of monomers on a square lattice is studied as the particles interact with either repulsive or attractive energies. By means of a finite-size scaling analysis, the critical exponents and the scaling collapsing…
We revisit the phase transition for percolation on randomly stretched lattices. Starting with the usual square grid, keep all vertices untouched while erasing edges according as follows: for every integer $i$, the entire column of vertical…
We compare phase transition and critical phenomena of bond percolation on Euclidean lattices, nonamenable graphs, and complex networks. On a Euclidean lattice, percolation shows a phase transition between the nonpercolating phase and…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
In this work we consider five different lattice models which exhibit continuous phase transitions into absorbing states. By measuring certain universal functions, which characterize the steady state as well as the dynamical scaling…
Percolation in systems made up of randomly placed impermeable grains is often examined in the context of system spanning clusters of connected solids forming above a relatively low critical grain density $\rho_{c1}$ or networks of…
The universal behaviour of two-dimensional loop models can change dramatically when loops are allowed to cross. We study models with crossings both analytically and with extensive Monte Carlo simulations. Our main focus (the 'completely…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
The stochastic addition of either vertices or connections in a network leads to the observation of the percolation transition, a structural change with the appearance of a connected component encompassing a finite fraction of the system.…
We study the geometry of the critical clusters in fully coordinated percolation on the square lattice. By Monte Carlo simulations (static exponents) and normal mode analysis (dynamic exponents), we find that this problem is in the same…