Related papers: The large connectivity limit of bootstrap percolat…
We develop a percolation model motivated by recent experimental studies of gels with active network remodeling by molecular motors. This remodeling was found to lead to a critical state reminiscent of random percolation (RP), but with a…
Recently, a hybrid percolation transitions (HPT) that exhibits both a discontinuous transition and critical behavior at the same transition point has been observed in diverse complex systems. In spite of considerable effort to develop the…
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…
We examine bootstrap percolation in d-dimensional, directed metric graphs in the context of recent measurements of firing dynamics in 2D neuronal cultures. There are two regimes, depending on the graph size N. Large metric graphs are…
Although higher-order interactions are known to affect the typical state of dynamical processes giving rise to new collective behavior, how they drive the emergence of rare events and fluctuations is still an open problem. We investigate…
Coupled oscillator networks often display transitions between qualitatively different phase-locked solutions -- such as synchrony and rotating wave solutions -- following perturbation or parameter variation. In the limit of weak coupling,…
We consider the Constrained-degree percolation model in random environment 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 probability…
Metastability is a physical phenomenon ubiquitous in first order phase transitions. A fruitful mathematical way to approach this phenomenon is the study of rare transitions Markov chains. For Metropolis chains associated with Statistical…
We study the connectivity of random subgraphs of the $d$-dimensional Hamming graph $H(d, n)$, which is the Cartesian product of $d$ complete graphs on $n$ vertices. We sample the random subgraph with an i.i.d.\ Bernoulli bond percolation on…
The long-term behavior of a supercritical branching random walk can be described and analyzed with the help of Biggins' martingales, parametrized by real or complex numbers. The study of these martingales with complex parameters is a rather…
We investigate the global basin structure of twisted states in nearest-neighbor coupled phase oscillators with a common phase shift $\alpha$. As $\alpha$ increases, basin boundaries become progressively more complex, with their fractal…
In bootstrap percolation it is known that the critical percolation threshold tends to converge slowly to zero with increasing system size, or, inversely, the critical size diverges fast when the percolation probability goes to zero. To…
The bootstrap percolation (or threshold model) is a dynamic process modelling the propagation of an epidemic on a graph, where inactive vertices become active if their number of active neighbours reach some threshold. We study an…
Majority bootstrap percolation on a graph $G$ is an epidemic process defined in the following manner. Firstly, an initially infected set of vertices is selected. Then step by step the vertices that have more infected than non-infected…
We study the percolation in coupled networks with both inner-dependency and inter-dependency links, where the inner- and inter-dependency links represent the dependencies between nodes in the same or different networks, respectively. We…
Nonlinear dynamical systems may be exposed to tipping points, critical thresholds at which small changes in the external inputs or in the systems parameters abruptly shift the system to an alternative state with a contrasting dynamical…
We study a random graph model which is a superposition of the bond percolation model on $Z^d$ with probability $p$ of an edge, and a classical random graph $G(n, c/n)$. We show that this model, being a {\it homogeneous} random graph, has a…
A sufficiently connected topology linking the constituent units of a complex system is usually seen as a prerequisite for the emergence of collective phenomena such as synchronization. We present a random network of heterogeneous phase…
We establish the existence of the phase transition in site percolation on pseudo-random $d$-regular graphs. Let $G=(V,E)$ be an $(n,d,\lambda)$-graph, that is, a $d$-regular graph on $n$ vertices in which all eigenvalues of the adjacency…
In this paper we study anisotropic oriented percolation on $\mathbb{Z}^d$ for $d\geq 4$ and show that the local condition for phase transition is closely related to the mean-field condition. More precisely, we show that if the sum of the…