Related papers: Cluster aggregation model for discontinuous percol…
We analytically show the percolation thresholds of the Fortuin-Kasteleyn cluster for the Edwards-Anderson Ising model on random graphs with arbitrary degree distributions. The results on the Nishimori line are shown. We obtain the results…
A Barak-Erd\H{o}s graph is a directed acyclic version of the Erd\H{o}s-R\'enyi random graph. It is obtained by performing independent bond percolation with parameter $p$ on the complete graph with vertices $\{1,...,n\}$, in which the edge…
We study the evolution of random graphs where edges are added one by one between pairs of weighted vertices so that resulting graphs are scale-free with the degree exponent $\gamma$. We use the branching process approach to obtain scaling…
The internal organization of complex networks often has striking consequences on either their response to external perturbations or on their dynamical properties. In addition to small-world and scale-free properties, clustering is the most…
K-core percolation is a fundamental dynamical process in complex networks with applications that span numerous real-world systems. Earlier studies focus primarily on random networks without spatial constraints and reveal intriguing…
In this work, we study explosive percolation (EP) in Barab\'{a}si-Albert (BA) network, in which nodes are born with degree $k=m$, for both product rule (PR) and sum rule (SR) of the Achlioptas process. For $m=1$ we find that the critical…
Theory of one-electron transition density matrices has been formulated within the time-independent coupled cluster method for the polarization propagator [R. Moszynski, P. S. \.Zuchowski, and B. Jeziorski, Coll. Czech. Chem. Commun. {\bf…
The continuum random cluster model is a Gibbs modification of the standard boolean model of intensity $z > 0$ and law of radii $Q$. The formal unormalized density is given by $q^{N_{cc}}$ where $q$ is a fixed parameter and $N_{cc}$ is the…
We consider stochastic networks with pairwise transition rates of the exponential form where the temperature T is a small parameter. Such networks arise in physics and chemistry and serve as mathematically tractable models of complex…
The Gaussian model of discontinuous percolation, recently introduced by Ara\'ujo and Herrmann [Phys. Rev. Lett., 105, 035701 (2010)], is numerically investigated in three dimensions, disclosing a discontinuous transition. For the…
In cluster tomography, we propose measuring the number of clusters $N$ intersected by a line segment of length $\ell$ across a finite sample. As expected, the leading order of $N(\ell)$ scales as $a\ell$, where $a$ depends on microscopic…
Binary aggregation is known to lead, under certain kinetic rules, to the coexistence of two populations, one consisting of finite-size clusters (sol), and one that contains a single cluster that carries a finite fraction of the total mass…
We review the field theory approach to percolation processes. Specifically, we focus on the so-called simple and general epidemic processes that display continuous non-equilibrium active to absorbing state phase transitions whose asymptotic…
Intercellular exchange networks are essential for the adaptive capabilities of populations of cells. While diffusional exchanges have traditionally been difficult to map, recent advances in nanotechnology enable precise probing of exchange…
We study numerically a model of nonequilibrium networks where nodes and links are added at each time step with aging of nodes and connectivity- and age-dependent attachment of links. By varying the effects of age in the attachment…
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 consider a model for the formation of a river network in which erosion process plays a role only at the initial stage. Once a global connectivity is achieved, no further evolution takes place. In spite of this, the network reproduces…
We consider long-range percolation on $\mathbb{Z}^d$, where the probability that two vertices at distance $r$ are connected by an edge is given by $p(r)=1-\exp[-\lambda(r)]\in(0,1)$ and the presence or absence of different edges are…
Real networks are vulnerable to random failures and malicious attacks. However, when a node is harmed or damaged, it may remain partially functional, which helps to maintain the overall network structure and functionality. In this paper, we…
Extended-range percolation is a robust percolation process that has relevance for quantum communication problems. In extended-range percolation nodes can be trusted or untrusted. Untrusted facilitator nodes are untrusted nodes that can…