Related papers: Growth, Percolation, and Correlations in Disordere…
As a fundamental structural transition in complex networks, core percolation is related to a wide range of important problems. Yet, previous theoretical studies of core percolation have been focusing on the classical Erd\H{o}s-R\'enyi…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
Motivated by the analysis of social networks, we study a model of random networks that has both a given degree distribution and a tunable clustering coefficient. We consider two types of growth processes on these graphs: diffusion and…
During the last decade, network approaches became a powerful tool to describe protein structure and dynamics. Here we review the links between disordered proteins and the associated networks, and describe the consequences of local,…
Recent researches on complex systems highlighted the so-called super-linear growth phenomenon. As the system size $P$ measured as population in cities or active users in online communities increases, the total activities $X$ measured as GDP…
Many complex networks in nature have directed links, a property that affects the network's navigability and large-scale topology. Here we study the percolation properties of such directed scale-free networks with correlated in- and…
Hyperuniform many-particle systems, which encompass crystals, quasicrystals and certain exotic disordered systems, exhibit an anomalous suppression of density fluctuations on macroscopic length scales relative to those of conventional…
Deep neural networks exhibit empirical neural scaling laws, with error decreasing as a power law with increasing model or data size, across a wide variety of architectures, tasks, and datasets. This universality suggests that scaling laws…
In this paper we study the small-world network model of Watts and Strogatz, which mimics some aspects of the structure of networks of social interactions. We argue that there is one non-trivial length-scale in the model, analogous to the…
While for standard percolation directionality is known to increase the combinatorial complexity of percolation, here we show that when connectivity is ensured by paths of length $R\geq 2$, network directionality, impeding backtracking, can…
We study the cluster-size distribution of supercritical long-range percolation on $\mathbb{Z}^d$, where two vertices $x,y\in\mathbb{Z}^d$ are connected by an edge with probability $\mathrm{p}(\|x-y\|):=p\min(1,\beta\|x-y\|)^{-d\alpha}$ for…
We investigate percolation transitions in a nonlocal network model numerically. In this model, each node has an exclusive partner and a link is forbidden between two nodes whose $r$-neighbors share any exclusive pair. The $r$-neighbor of a…
Network formation of associative semiflexible fibers and mixtures of fibers and colloidal particles is simulated for the Johnson-Kendall-Roberts (JKR) model of elastic contacts, and a phase diagram in terms of particle elasticity and…
Studies of disordered heterogeneous media and galaxy cosmology share a common goal: analyzing the distribution of particles at `microscales' to predict physical properties at `macroscales', whether for a liquid, composite material, or…
We examine the structure of the percolating cluster (PC) formed by site percolation on a random clustered network (RCN) model. Using the generating functions, we formulate the clustering coefficient and assortative coefficient of the PC. We…
We consider the model of random trees introduced by Devroye (1999), the so-called random split trees. The model encompasses many important randomized algorithms and data structures. We then perform supercritical Bernoulli bond-percolation…
For a general class of percolation models with long-range correlations on $\mathbb Z^d$, $d\geq 2$, introduced in arXiv:1212.2885, we establish regularity conditions of Barlow arXiv:math/0302004 that mesoscopic subballs of all large enough…
The study of interdependent networks, and in particular the robustness on networks, has attracted considerable attention. Recent studies mainly assume that the dependence is fully interdependent. However, targeted attack for partially…
Models of growing networks are a central topic in network science. In these models, vertices are usually labeled by their arrival time, distinguishing even those node pairs whose structural roles are identical. In contrast, unlabeled…
We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering,…