Related papers: Relations between Average Distance, Heterogeneity …

This paper investigates an expected average error for distributed averaging problems under asynchronous updates. The asynchronism in this context implies no existence of a global clock as well as random characteristics in communication…

Measuring the importance of nodes in a network with a centrality measure is a core task in any network application. There are many measures available and it is speculated that many encode similar information. We give an explicit non-linear…

We study synchronization phenomena in scale-free networks of asymetrically coupled dynamical systems featuring degree-degree correlation in the connection wiring. We show that when the interaction is dominant from the high-degree to the…

The entropy of network ensembles characterizes the amount of information encoded in the network structure, and can be used to quantify network complexity, and the relevance of given structural properties observed in real network datasets…

In this paper, we investigate the factors that affect the synchronization of coupled oscillators on networks. By using the edge-intercrossing method, we keep the degree distribution unchanged to see other statistical properties' effects on…

Degree heterogeneity and latent geometry, also referred to as popularity and similarity, are key explanatory components underlying the structure of real-world networks. The relationship between these components and the statistical…

Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Since an exact computation is prohibitive in large networks, several approximation algorithms have been…

A bridge in a graph is an edge whose removal disconnects the graph and increases the number of connected components. We calculate the fraction of bridges in a wide range of real-world networks and their randomized counterparts. We find that…

Among the several topological properties of complex networks, the shortest path represents a particularly important characteristic because of its potential impact not only on other topological properties, but mainly for its influence on…

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…

Distributed processing across a networked environment suffers from unpredictable behavior of speedup due to heterogeneous nature of the hardware and software in the remote machines. It is challenging to get a better performance from a…

A network can be analyzed at different topological scales, ranging from single nodes to motifs, communities, up to the complete structure. We propose a novel intermediate-level topological analysis that considers non-overlapping subgraphs…

Heterogeneity in the degree distribution is known to suppress global synchronization in complex networks of symmetrically coupled oscillators. Scale-free networks display a great deal of heterogeneity, containing a few nodes, termed hubs,…

Identifying an optimal set of driver nodes to achieve synchronization via pinning control is a fundamental challenge in complex network science, limited by computational intractability and the lack of general theory. Here, leveraging a…

Structure and dynamics of complex networks usually deal with degree distributions, clustering, shortest path lengths and other graph properties. Although these concepts have been analysed for graphs on abstract spaces, many networks happen…

Networks with a given degree distribution may be very resilient to one type of failure or attack but not to another. The goal of this work is to determine network design guidelines which maximize the robustness of networks to both random…

Despite the growing interest in characterizing the local geometry leading to the global topology of networks, our understanding of the local structure of complex networks, especially real-world networks, is still incomplete. Here, we…

Correlations may affect propagation processes on complex networks. To analyze their effect, it is useful to build ensembles of networks constrained to have a given value of a structural measure, such as the degree-degree correlation $r$,…

Networks in the real world do not exist as isolated entities, but they are often part of more complicated structures composed of many interconnected network layers. Recent studies have shown that such mutual dependence makes real networked…

We consider the problems of reaching average consensus and solving consensus-based optimization over unreliable communication networks wherein packets may be dropped accidentally during transmission. Existing work either assumes that the…