Node similarity as a basic principle behind connectivity in complex networks

@article{Scholz2010NodeSA,
  title={Node similarity as a basic principle behind connectivity in complex networks},
  author={Matthias Scholz},
  journal={ArXiv},
  year={2010},
  volume={abs/1010.0803}
}
How are people linked in a highly connected society? Since in many networks a power-law (scale-free) node-degree distribution can be observed, power-law might be seen as a universal characteristics of networks. But this study of communication in the Flickr social online network reveals that power-law node-degree distributions are restricted to only sparsely connected networks. More densely connected networks, by contrast, show an increasing divergence from power-law. This work shows that this… 
[PDF] Semantic Reader
26 Citations
Highly Influential Citations
2
Background Citations
11
Methods Citations
1

Figures from this paper

26 Citations

Network motifs: A key variable in the equation of dynamic flow between macro and micro layers in Complex Networks

Detection of Overlapping Communities in Social Network

A novel approach has been introduced which overcomes the shortfalls of clique percolation method, an overlapping community detection algorithm mostly used in this area, which efficiently detect overlapping communities.

Link Prediction from Partial Observation in Scale-Free Networks

Estimates of scaling parameter of the power-law distribution based on the observed node degrees and approximate solutions to a transcendental equation with Hurwitz-zeta function are given to obtain a local sub-network similarity measure of node pairs that do not have available observation information.

Linked by Dynamics: Wavelet-Based Mutual Information Rate as a Connectivity Measure and Scale-Specific Networks

It is demonstrated that a computationally accessible estimation method, derived for Gaussian processes and adapted by using the wavelet transform, can be effective for nonlinear, nonstationary, and multiscale processes.

Learning Hidden Influences in Large-Scale Dynamical Social Networks: A Data-Driven Sparsity-Based Approach, in Memory of Roberto Tempo

This work aims at qualitatively and quantitatively infer social influence from data using a systems and control viewpoint and introduces some definitions and models of opinions dynamics and some structural constraints of online social networks, based on the notion of sparsity.

Consensus dynamics in online collaboration systems

The findings reveal that when users are guided by their similarity to other users, the process of consensus building in online collaboration systems is delayed, and suggests that achieving an optimal consensus building process in collaboration systems requires an appropriate balance between those two factors.

Community detection algorithm evaluation with ground-truth data

Global tourist flows under the Belt and Road Initiative: A complex network analysis

This study applies complex network analysis to examine global tourist flows network in the context of Belt and Road Initiative (BRI). Using tourist flows data between 221 countries/regions over…

A two-stage algorithm for network reconstruction

Versioning and advertising in social networks: uniform distributions of valuations

This note studies second-degree discrimination by a platform that sells a two-version (online) service to consumers engaged in a social network and derives close form expressions for the platform's profits in most prominent real-world social networks where online platforms operate.

References

SHOWING 1-10 OF 17 REFERENCES

Emergence of scaling in random networks

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Scale-free networks from varying vertex intrinsic fitness.

A new mechanism leading to scale-free networks is proposed, which is called a good-get-richer mechanism, in which sites with larger fitness are more likely to become hubs (i.e., to be highly connected).

Link Creation and Profile Alignment in the aNobii Social Network

An in-depth analysis of the aNobii system's social network and its interplay with users' profiles, which describes the relation of geographic and interest-based factors to social linking and reports a reciprocal causal connection.

Geographical dispersal of mobile communication networks

Classes of small-world networks.

Evidence of the occurrence of three classes of small-world networks, characterized by a vertex connectivity distribution that decays as a power law law, and the nature of such constraints may be the controlling factor for the emergence of different classes of networks are presented.

Epidemic spreading in scale-free networks.

A dynamical model for the spreading of infections on scale-free networks is defined, finding the absence of an epidemic threshold and its associated critical behavior and this new epidemiological framework rationalizes data of computer viruses and could help in the understanding of other spreading phenomena on communication and social networks.

Vertex intrinsic fitness: how to produce arbitrary scale-free networks.

It is found that, irrespective of the particular choices, the generation of scale-free networks is straightforward and the general conditions under which scale- free behavior appears are derived.

The structure of scientific collaboration networks.

  • M. Newman
  • Physics
    Proceedings of the National Academy of Sciences of the United States of America
  • 2001
It is shown that these collaboration networks form "small worlds," in which randomly chosen pairs of scientists are typically separated by only a short path of intermediate acquaintances.

The Web as a Graph: Measurements, Models, and Methods

This paper describes two algorithms that operate on the Web graph, addressing problems from Web search and automatic community discovery, and proposes a new family of random graph models that point to a rich new sub-field of the study of random graphs, and raises questions about the analysis of graph algorithms on the Internet.

A general theory of bibliometric and other cumulative advantage processes

  • D. Price
  • Mathematics
    J. Am. Soc. Inf. Sci.
  • 1976
It is shown that such a stochastic law is governed by the Beta Function, containing only one free parameter, and this is approximated by a skew or hyperbolic distribution of the type that is widespread in bibliometrics and diverse social science phenomena.