Related papers: Betweenness centrality correlation in social netwo…
Two concepts of centrality have been defined in complex networks. The first considers the centrality of a node and many different metrics for it has been defined (e.g. eigenvector centrality, PageRank, non-backtracking centrality, etc). The…
We study social learning in which agents weight neighbors' opinions differently based on their degrees, capturing situations in which agents place more trust in well-connected individuals or, conversely, discount their influence. We derive…
Several centrality measures have been formulated to quantify the notion of 'importance' of actors in social networks. Current measures scrutinize either local or global connectivity of the nodes and have been found to be inadequate for…
Estimating influential nodes in large scale networks including but not limited to social networks, biological networks, communication networks, emerging smart grids etc. is a topic of fundamental interest. To understand influences of nodes…
In this paper, we analyze the behavior of the global clustering coefficient in scale free graphs. We are especially interested in the case of degree distribution with an infinite variance, since such degree distribution is usually observed…
The origin of scale-free degree distributions in the context of networks is addressed through an analogous non-network model in which the node degree corresponds to the number of balls in a box and the rewiring of links to balls moving…
Many real networks feature the property of nestedness, i.e. the neighbours of nodes with a few connections are hierarchically nested within the neighbours of nodes with more connections. Despite the abstract simplicity of this notion,…
We discuss the behavior of large ensembles of phase oscillators networking via scale-free topologies in the presence of a positive correlation between the oscillators' natural frequencies and network's degrees. In particular, we show that…
Identifying influential nodes in a network is a major issue due to the great deal of applications concerned, such as disease spreading and rumor dynamics. That is why, a plethora of centrality measures has emerged over the years in order to…
We performed a large-scale crawl of the World Wide Web, covering 6.9 Million domains and 57 Million subdomains, including all high-traffic sites of the Internet. We present a study of the correlations found between quantities measuring the…
Nowadays there is a multitude of measures designed to capture different aspects of network structure. To be able to say if the structure of certain network is expected or not, one needs a reference model (null model). One frequently used…
Knowledge graphs play a central role for linking different data which leads to multiple layers. Thus, they are widely used in big data integration, especially for connecting data from different domains. Few studies have investigated the…
People choose friendships with people similar to themselves, i.e. they sort by resemblence. Economic studies have shown when sorting is optimal and constitute an equilibrium, however, this presumes lack of beneficial spillovers. We…
Many real networks such as the World Wide Web, financial, biological, citation and social networks have a power-law degree distribution. Networks with this feature are also called scale-free. Several models for producing scale-free networks…
Collaboration networks are studied as an example of growing bipartite networks. These have been previously observed to have structure such as positive correlations between nearest-neighbour degrees. However, a detailed understanding of the…
In this paper, we present a detailed analysis of the global clustering coefficient in scale-free graphs. Many observed real-world networks of diverse nature have a power-law degree distribution. Moreover, the observed degree distribution…
Node centrality is one of the integral measures in network analysis with wide range of applications from socio-economic to personalized recommendation. We argue that an effective centrality measure should undertake stability even under…
In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that…
The study of the topological structure of complex networks has fascinated researchers for several decades, and today we have a fairly good understanding of the types and reoccurring characteristics of many different complex networks.…
Topological heterogeneities of social networks have a strong impact on the individuals embedded in those networks. One of the interesting phenomena driven by such heterogeneities is the friendship paradox (FP), stating that the mean degree…