相关论文: Synchronous and Asynchronous Recursive Random Scal…

In this paper, by both simulations and theoretical predictions we study two and three node (or degree) correlations in random Apollonian network (RAN), which have small-world and scale-free topologies. Using the rate equation approach under…

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…

In this paper we present a deterministic vertex spawning model that yields a scale-free network. The model specifies that a parent vertex produces a child vertex in a time interval approximately proportional to the current time and…

Recently, a framework for analyzing time series by constructing an associated complex network has attracted significant research interest. One of the advantages of the complex network method for studying time series is that complex network…

We investigate the dynamic scaling properties of stochastic particle systems on a non-deterministic scale-free network. It has been known that the dynamic scaling behavior depends on the degree distribution exponent of the underlying…

Complex networks have abundant and extensive applications in real life. Recently, researchers have proposed a number of complex networks, in which some are deterministic and others are random. Compared with deterministic networks, random…

We study the synchronizability and the synchronization dynamics of networks of nonlinear oscillators. We investigate how the synchronization of the network is influenced by some of its topological features such as variations of the power…

Scale free dynamics are observed in a variety of physical and biological systems. These include neural activity in which evidence for scale freeness has been reported using a range of imaging modalities. Here, we derive the ways in which…

This brief paper further investigates the locally and globally adaptive synchronization of an uncertain complex dynamical network. Several network synchronization criteria are deduced. Especially, our hypotheses and designed adaptive…

Software-defined networking (SDN) allows operators to control the behavior of a network by programatically managing the forwarding rules installed on switches. However, as is common in distributed systems, it can be difficult to ensure that…

We introduce a new family of networks, the Apollonian networks, that are simultaneously scale-free, small world, Euclidean, space-filling and matching graphs. These networks have a wide range of applications ranging from the description of…

Fixed points are fundamental states in any dynamical system. In the case of gene regulatory networks (GRNs) they correspond to stable genes profiles associated to the various cell types. We use Kauffman's approach to model GRNs with random…

Through the distinction between ``real'' and ``virtual'' links between the nodes of a graph, we develop a set of simple rules leading to scale-free networks with a tunable degree distribution exponent. Albeit sharing some similarities with…

Computer networks have become a critical infrastructure. In fact, networks should not only meet strict requirements in terms of correctness, availability, and performance, but they should also be very flexible and support fast updates,…

Evolutionary game theory is employed to study topological conditions of scale-free networks for the evolution of cooperation. We show that Apollonian Networks (ANs) are perfect scale-free networks, on which cooperation can spread to all…

We show that the error of iteratively magnitude-pruned networks empirically follows a scaling law with interpretable coefficients that depend on the architecture and task. We functionally approximate the error of the pruned networks,…

Very often, when studying topological or dynamical properties of random scale-free networks, it is tacitly assumed that degree-degree correlations are not present. However, simple constraints, such as the absence of multiple edges and…

Network models are routinely downscaled compared to nature in terms of numbers of nodes or edges because of a lack of computational resources, often without explicit mention of the limitations this entails. While reliable methods have long…

An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and is equipped with a local map defining the evolution of the state of the node depending on its neighbors. The global dynamics of the network…

We review recent results on the topological properties of two spatial scale-free networks, the inherent structure and Apollonian networks. The similarities between these two types of network suggest an explanation for the scale-free…