64 research outputs found
Self-similarity of complex networks and hidden metric spaces
We demonstrate that the self-similarity of some scale-free networks with respect to a simple degree-thresholding renormalization scheme finds a natural interpretation in the assumption that network nodes exist in hidden metric spaces. Clustering, i.e., cycles of length three, plays a crucial role in this framework as a topological reflection of the triangle inequality in the hidden geometry. We prove that a class of hidden variable models with underlying metric spaces are able to accurately reproduce the self-similarity properties that we measured in the real networks. Our findings indicate that hidden geometries underlying these real networks are a plausible explanation for their observed topologies and, in particular, for their self-similarity with respect to the degree-based renormalization
Modelling the Self-similarity in Complex Networks Based on Coulomb's Law
Recently, self-similarity of complex networks have attracted much attention.
Fractal dimension of complex network is an open issue. Hub repulsion plays an
important role in fractal topologies. This paper models the repulsion among the
nodes in the complex networks in calculation of the fractal dimension of the
networks. The Coulomb's law is adopted to represent the repulse between two
nodes of the network quantitatively. A new method to calculate the fractal
dimension of complex networks is proposed. The Sierpinski triangle network and
some real complex networks are investigated. The results are illustrated to
show that the new model of self-similarity of complex networks is reasonable
and efficient.Comment: 25 pages, 11 figure
Topicality and Social Impact: Diverse Messages but Focused Messengers
Are users who comment on a variety of matters more likely to achieve high
influence than those who delve into one focused field? Do general Twitter
hashtags, such as #lol, tend to be more popular than novel ones, such as
#instantlyinlove? Questions like these demand a way to detect topics hidden
behind messages associated with an individual or a hashtag, and a gauge of
similarity among these topics. Here we develop such an approach to identify
clusters of similar hashtags by detecting communities in the hashtag
co-occurrence network. Then the topical diversity of a user's interests is
quantified by the entropy of her hashtags across different topic clusters. A
similar measure is applied to hashtags, based on co-occurring tags. We find
that high topical diversity of early adopters or co-occurring tags implies high
future popularity of hashtags. In contrast, low diversity helps an individual
accumulate social influence. In short, diverse messages and focused messengers
are more likely to gain impact.Comment: 9 pages, 7 figures, 6 table
An Experimental Investigation of Hyperbolic Routing with a Smart Forwarding Plane in NDN
Routing in NDN networks must scale in terms of forwarding table size and
routing protocol overhead. Hyperbolic routing (HR) presents a potential
solution to address the routing scalability problem, because it does not use
traditional forwarding tables or exchange routing updates upon changes in
network topologies. Although HR has the drawbacks of producing sub-optimal
routes or local minima for some destinations, these issues can be mitigated by
NDN's intelligent data forwarding plane. However, HR's viability still depends
on both the quality of the routes HR provides and the overhead incurred at the
forwarding plane due to HR's sub-optimal behavior. We designed a new forwarding
strategy called Adaptive Smoothed RTT-based Forwarding (ASF) to mitigate HR's
sub-optimal path selection. This paper describes our experimental investigation
into the packet delivery delay and overhead under HR as compared with
Named-Data Link State Routing (NLSR), which calculates shortest paths. We run
emulation experiments using various topologies with different failure
scenarios, probing intervals, and maximum number of next hops for a name
prefix. Our results show that HR's delay stretch has a median close to 1 and a
95th-percentile around or below 2, which does not grow with the network size.
HR's message overhead in dynamic topologies is nearly independent of the
network size, while NLSR's overhead grows polynomially at least. These results
suggest that HR offers a more scalable routing solution with little impact on
the optimality of routing paths
Geometric Correlations Mitigate the Extreme Vulnerability of Multiplex Networks against Targeted Attacks
We show that real multiplex networks are unexpectedly robust against targeted attacks on high-degree nodes and that hidden interlayer geometric correlations predict this robustness. Without geometric correlations, multiplexes exhibit an abrupt breakdown of mutual connectivity, even with interlayer degree correlations. With geometric correlations, we instead observe a multistep cascading process leading into a continuous transition, which apparently becomes fully continuous in the thermodynamic limit. Our results are important for the design of efficient protection strategies and of robust interacting networks in many domains
- …