Related papers: Synchronization in scale-free network with asymmet…
We propose a novel paradigm for modeling real-world scale-free networks, where the integration of new nodes is driven by the combined attractiveness of degree and betweenness centralities, the competition of which (expressed by a parameter…
In this article, we study algorithms for dynamic networks with asynchronous start, i.e., each node may start running the algorithm in a different round. Inactive nodes transmit only heartbeats, which contain no information but can be…
Many real-world complex networks simultaneously exhibit topological features of scale-free behaviour and hierarchical organization. In this regard, deterministic scale-free [A.-L. Barab\'asi \etal, Physica A, 299, 3 (2001)] and…
We confront a network model of human aging and mortality in which nodes represent health attributes that interact within a scale-free network topology, with observational data that uses both clinical and laboratory (pre-clinical) health…
We analyze the evolution of Sznajd Model with synchronous updating in several complex networks. Similar to the model on square lattice, we have found a transition between the state with no-consensus and the state with complete consensus in…
We show how scale-free degree distributions can emerge naturally from growing networks by using random walks for selecting vertices for attachment. This result holds for several variants of the walk algorithm and for a wide range of…
Complex networks are now being studied in a wide range of disciplines across science and technology. In this paper we propose a method by which one can probe the properties of experimentally obtained network data. Rather than just measuring…
Oscillator networks display intricate synchronization patterns. Determining their stability typically requires incorporating the symmetries of the network coupling. Going beyond analyses that appeal only to a network's automorphism group,…
We study mixing patterns in networks, meaning the propensity for nodes of different kinds to connect to one another. The phenomenon of assortative mixing, whereby nodes prefer to connect to others that are similar to themselves, has been…
In a recent article [1] we surveyed advances related to adaptation, learning, and optimization over synchronous networks. Various distributed strategies were discussed that enable a collection of networked agents to interact locally in…
Traditionally, the evolution of cooperation has been studied on single, isolated networks. Yet a player, especially in human societies, will typically be a member of many different networks, and those networks will play a different role in…
Inter-layer synchronization is a dynamical state occurring in multi-layer networks composed of identical nodes. The state corresponds to have all layers synchronized, with nodes in each layer which do not necessarily evolve in unison. So…
In complex scale-free networks, ranking the individual nodes based upon their importance has useful applications, such as the identification of hubs for epidemic control, or bottlenecks for controlling traffic congestion. However, in most…
We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the…
We study the percolation phase transition in hierarchical scale-free nets. Depending on the method of construction, the nets can be fractal or small-world (the diameter grows either algebraically or logarithmically with the net size),…
A network is scale-free if its connectivity density function is proportional to a power-law distribution. Scale-free networks may provide an explanation for the robustness observed in certain physical and biological phenomena, since the…
Preferential attachment is one possible way to obtain a scale-free network. We develop a self-consistent method to determine whether preferential attachment occurs during the growth of a network, and to extract the preferential attachment…
We consider complete synchronization of identical maps coupled through a general interaction function and in a general network topology where the edges may be directed and may carry both positive and negative weights. We define mixed…
We consider the coupling between two networks, each having N nodes whose individual dynamics is modeled by a two-state master equation. The intra-network interactions are all to all, whereas the inter-network interactions involve only a…
Scale-free (SF) network structures observed in many complex systems affect the size of epidemic spreading and the efficiency of communication, statistical properties of the degree-degree correlations are important for studying the average…