Related papers: Sandpile model on an optimized scale-free network …
We report analytical and numerical modelling of active elastic networks, motivated by experiments on crosslinked actin networks contracted by myosin motors. Within a broad range of parameters, the motor-driven collapse of active elastic…
We investigate the trade-off between the robustness against random and targeted removal of nodes from a network. To this end we utilize the stochastic block model to study ensembles of infinitely large networks with arbitrary large-scale…
By employing a recently introduced optimization algorithm we explicitely design optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree…
This paper mainly discusses the diffusion on complex networks with time-varying couplings. We propose a model to describe the adaptive diffusion process of local topological and dynamical information, and find that the Barabasi-Albert…
The Abelian Sandpile Model, seen as a deterministic lattice automaton, on two-dimensional periodic graphs generates complex regular patterns displaying (fractal) self-similarity. In particular, on a variety of lattices and initial…
Networks with nodes embedded in a metric space have gained increasing interest in recent years. The effects of spatial embedding on the networks' structural characteristics, however, are rarely taken into account when studying their…
We investigate a network model based on an infinite regular square lattice embedded in the Euclidean plane where the node connection probability is given by the geometrical distance of nodes. We show that the degree distribution in the…
We introduce appropriate definitions of dimensions in order to characterize the fractal properties of complex networks. We compute these dimensions in a hierarchically structured network of particular interest. In spite of the nontrivial…
In this paper, we propose a simple rule that generates scale-free small-world networks with tunable assortative coefficient. These networks are constructed by two-stage adding process for each new node. The model can reproduce scale-free…
Many complex systems--from social and communication networks to biological networks and the Internet--are thought to exhibit scale-free structure. However, prevailing explanations rely on the constant addition of new nodes, an assumption…
The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We prove that the asymptotic shape of this model is a Euclidean ball, in a sense which is…
We investigate topologically biased failure in scale-free networks with degree distribution $P(k) \propto k^{-\gamma}$. The probability $p$ that an edge remains intact is assumed to depend on the degree $k$ of adjacent nodes $i$ and $j$…
Real-world road networks have an approximate scale-invariance property; can one devise mathematical models of random networks whose distributions are {\em exactly} invariant under Euclidean scaling? This requires working in the continuum…
In this article we presented a brief study of the main network models with growth and preferential attachment. Such models are interesting because they present several characteristics of real systems. We started with the classical model…
In complex systems, responses to small perturbations are too diverse to predict how much they would be definitely, and then such diverse responses can be predicted in a probabilistic way. Here we study such a problem in scale-free networks,…
The application of Bayesian networks (BNs) to cognitive assessment and intelligent tutoring systems poses new challenges for model construction. When cognitive task analyses suggest constructing a BN with several latent variables, empirical…
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisation problem where the goal is to find a BN structure which…
We study the performance of Weibull and scale free Internet-like networks and compare them to a classical random graph based network. The scaling of the traffic load with the nodal degree is established, and confimed in a numerical…
A dissipative stochastic sandpile model is constructed and studied on small world networks in one and two dimensions with different shortcut densities $\phi$, where $\phi=0$ represents regular lattice and $\phi=1$ represents random network.…
A variety of scale-free networks have been created since the pioneer work by A.-L. Barab\'{a}si and R. Albert. All this networks are homogeneous since they are composed of the same kind of nodes. In the realistic world, however, one element…