Related papers: Resistance Distances in Simplicial Networks
Recent years have seen the world become a closely connected society with the emergence of different types of social networks. Online social networks have provided a way to bridge long distances and establish numerous communication channels…
In Refs.[1] and [2], calculation of effective resistances on distance-regular networks was investigated, where in the first paper, the calculation was based on the stratification of the network and Stieltjes function associated with the…
We study the emergence of coherence in complex networks of mutually coupled non-identical elements. We uncover the precise dependence of the dynamical coherence on the network connectivity, on the isolated dynamics of the elements and the…
Most social, technological and biological networks are embedded in a finite dimensional space, and the distance between two nodes influences the likelihood that they link to each other. Indeed, in social systems, the chance that two…
We study the effective resistance of small-world resistor networks. Utilizing recent analytic results for the propagator of the Edwards-Wilkinson process on small-world networks, we obtain the asymptotic behavior of the disorder-averaged…
We study second order consensus dynamics with random additive disturbances. We investigate three different performance measures: the steady-state variance of pairwise differences between vertex states, the steady-state variance of the…
The measurement called accessibility has been proposed as a means to quantify the efficiency of the communication between nodes in complex networks. This article reports important results regarding the properties of the accessibility,…
The empirical study of network dynamics has been limited by the lack of longitudinal data. Here we introduce a quantitative indicator of link persistence to explore the correlations between the structure of a mobile phone network and the…
Brain areas' functional repertoires are shaped by their incoming and outgoing structural connections. In empirically measured networks, most connections are short, reflecting spatial and energetic constraints. Nonetheless, a small number of…
A certain degree of inhibition is a common trait of dynamical networks in nature, ranging from neuronal and biochemical networks, to social and technological networks. We study here the role of inhibition in a representative dynamical…
Higher-order networks, naturally described as hypergraphs, are essential for modeling real-world systems involving interactions among three or more entities. Stochastic block models offer a principled framework for characterizing mesoscale…
In this paper, we demonstrate a conflicting relationship between two crucial properties---controllability and robustness---in linear dynamical networks of diffusively coupled agents. In particular, for any given number of nodes $N$ and…
In functionally complex systems, higher-order connectivity is often revealed in the underlying geometry of networked units. Furthermore, such systems often show signatures of self-organized criticality, a specific type of non-equilibrium…
A mechanism for self-organization of the degree of connectivity in model neural networks is studied. Network connectivity is regulated locally on the basis of an order parameter of the global dynamics which is estimated from an observable…
One of the most important features of spatial networks such as transportation networks, power grids, Internet, neural networks, is the existence of a cost associated with the length of links. Such a cost has a profound influence on the…
Using a generalized random recurrent neural network model, and by extending our recently developed mean-field approach [J. Aljadeff, M. Stern, T. Sharpee, Phys. Rev. Lett. 114, 088101 (2015)], we study the relationship between the network…
Human social interactions in local settings can be experimentally detected by recording the physical proximity and orientation of people. Such interactions, approximating face-to-face communications, can be effectively represented as time…
In complex network-coupled dynamical systems, two questions of central importance are how to identify the most vulnerable components and how to devise a network making the overall system more robust to external perturbations. To address…
Networks composed from both connectivity and dependency links were found to be more vulnerable compared to classical networks with only connectivity links. Their percolation transition is usually of a first order compared to the second…
Shortest paths are not always simple. In planar networks, they can be very different from those with the smallest number of turns - the simplest paths. The statistical comparison of the lengths of the shortest and simplest paths provides a…