Related papers: Phase Transition in a Self-repairing Random Networ…
A simple but powerful network model with $n$ nodes and $m$ partly overlapping layers is generated as an overlay of independent random graphs $G_1,\dots,G_m$ with variable sizes and densities. The model is parameterised by a joint…
Modular networks, such as critical infrastructures, are often built from distinct, densely connected modules (e.g., cities) that are sparsely interconnected. When such networks are gradually and randomly disrupted under a percolation…
The critical boundaries separating ordered from chaotic behavior in randomly wired S-state networks are calculated. These networks are a natural generalization of random Boolean nets and are proposed as on extended approach to genetic…
We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes are removed if below a…
Percolation in a scale-free hierarchical network is solved exactly by renormalization-group theory, in terms of the different probabilities of short-range and long-range bonds. A phase of critical percolation, with algebraic…
We present a simple model that enables us to analytically characterize a floppy to rigid transition and an associated self-adaptive intermediate phase in a random bond network. In this intermediate phase, the network adapts itself to lower…
We study the site-bond percolation on a hierarchical scale-free network, namely, the decorated (2,2)-flower, by using the renormalization group technique. The phase diagram essentially depends on the fraction of occupied sites.…
\emph{Full-bond percolation} with parameter $p$ is the process in which, given a graph, for every edge independently, we delete the edge with probability $1-p$. Bond percolation is motivated by problems in mathematical physics and it is…
Consider subcritical Bernoulli bond percolation with fixed parameter p<p_c. We define a dependent site percolation model by the following procedure: for each bond cluster, we colour all vertices in the cluster black with probability r and…
Percolation theory characterizing the robustness of a network has applications ranging from biology, to epidemic spreading, and complex infrastructures. Percolation theory, however, only concern the typical response of a infinite network to…
Standard Random Boolean Networks display an order-disorder phase transition. We add to the standard Random Boolean Networks a disconnection rule which couples the control and order parameters. By this way, the system is driven to the…
We study a generic model of self-assembling chains which can branch and form networks with branching points (junctions) of arbitrary functionality. The physical realizations include physical gels, wormlike micells, dipolar fluids and…
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…
Analytical results are derived for the bond percolation threshold and the size of the giant connected component in a class of random networks with non-zero clustering. The network's degree distribution and clustering spectrum may be…
Bootstrap percolation is a well-known model to study the spreading of rumors, new products or innovations on social networks. The empirical studies show that community structure is ubiquitous among various social networks. Thus, studying…
Phase segregation, the process by which the components of a binary mixture spontaneously separate, is a key process in the evolution and design of many chemical, mechanical, and biological systems. In this work, we present a data-driven…
The possible paralelism existing between phase transitions and fracture in disordered materials, is discussed using the well-known Fiber Bundle Models and a probabilistic approach suited to smooth fluctuations near the critical point. Two…
Percolation on complex networks is used both as a model for dynamics on networks, such as network robustness or epidemic spreading, and as a benchmark for our models of networks, where our ability to predict percolation measures our ability…
A method to treat a N-component percolation model as effective one component model is presented by introducing a scaled control variable $p_{+}$. In Monte Carlo simulations on $16^{3}$, $32^{3}$, $64^{3}$ and $128^{3}$ simple cubic lattices…
Transition out of a topological phase is typically characterized by discontinuous changes in topological invariants along with bulk gap closings. However, as a clean system is geometrically punctured, it is natural to ask the fate of an…