Related papers: Tricritical point in heterogeneous k-core percolat…
The degree of a vertex in a hypergraph is defined as the number of edges incident to it. In this paper we study the $k$-core, defined as the maximal induced subhypergraph of minimum degree $k$, of the random $r$-uniform hypergraph…
A new class of patterns for multiplex networks is studied, which consists in a collection of different homogeneous states each referred to a distinct layer. The associated stability diagram exhibits a tricritical point, as a function of the…
Tricritical points separate continuous and discontinuous symmetry breaking transitions. They occur in a variety of physical systems and their mathematical models. A tricritical point is used to determine a liquid-solid phase transition line…
The use of machine learning techniques in classical and quantum systems has led to novel techniques to classify ordered and disordered phases, as well as uncover transition points in critical phenomena. Efforts to extend these methods to…
We present an exact solution of percolation in a generalized class of Watts-Strogatz graphs defined on a 1-dimensional underlying lattice. We find a non-classical critical point in the limit of the number of long-range bonds in the system…
For pairs of knots K and J in the three-sphere, we consider the set of four-tuples of integers (g,x,y,z) for which there is a cobordism from K to J of genus g having x, y, and z, critical points of index 0, 1, and 2, respectively. We…
We locate the critical threshold $p_c$ at which it becomes likely that the complete graph $K_n$ can be obtained from the Erd\H{o}s-R\'enyi graph ${\cal G}_{n,p}$ by iteratively completing copies of $K_4$ minus an edge. This refines work of…
Critical site percolation on the triangular lattice is described by the Yang-Baxter solvable dilute $A_2^{(2)}$ loop model with crossing parameter specialized to $\lambda=\frac\pi3$, corresponding to the contractible loop fugacity…
Methods for determining the percolation threshold usually study the behavior of network ensembles and are often restricted to a particular type of probabilistic node/link removal strategy. We propose a network-specific method to determine…
The renowned general epidemic process describes the stochastic evolution of a population of individuals which are either susceptible, infected or dead. A second order phase transition belonging to the universality class of dynamic isotropic…
We give a self-contained and detailed presentation of Kesten's results that allow to relate critical and near-critical percolation on the triangular lattice. They constitute an important step in the derivation of the exponents describing…
The models of $k$-core percolation and interdependent networks (IN) have been extensively studied in their respective fields. A recent study has revealed that they share several common critical exponents. However, several newly discovered…
We introduce and study a family of 2D percolation systems which are based on the bond percolation model of the triangular lattice. The system under study has local correlations, however, bonds separated by a few lattice spacings act…
We study site percolation on Angel & Schramm's uniform infinite planar triangulation. We compute several critical and near-critical exponents, and describe the scaling limit of the boundary of large percolation clusters in all regimes…
In complex networks, many elements interact with each other in different ways. A hypergraph is a network in which group interactions occur among more than two elements. In this study, first, we propose a method to identify influential…
In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square,…
We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for…
Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a…
We examine the heterogeneous responses of individual nodes in sparse networks to the random removal of a fraction of edges. Using the message-passing formulation of percolation, we discover considerable variation across the network in the…
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…