Growing Homophilic Networks Are Natural Navigable Small Worlds

  title={Growing Homophilic Networks Are Natural Navigable Small Worlds},
  author={Yu A. Malkov and Alexander Ponomarenko},
  journal={PLoS ONE},
Navigability, an ability to find a logarithmically short path between elements using only local information, is one of the most fascinating properties of real-life networks. However, the exact mechanism responsible for the formation of navigation properties remained unknown. We show that navigability can be achieved by using only two ingredients present in the majority of networks: network growth and local homophily, giving a persuasive answer how the navigation appears in real-life networks. A… 

Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs

The proposed general metric space search index is able to strongly outperform previous opensource state-of-the-art vector-only approaches and similarity of the algorithm to the skip list structure allows straightforward balanced distributed implementation.

Geometric explanation of the rich-club phenomenon in complex networks

A simple yet powerful geometry-based growing model which can generate realistic complex networks with high rich club diversity by controlling a single geometric parameter is proposed and validated against the Internet, protein-protein interaction, airport and power grid networks.

Modeling spatial social complex networks for dynamical processes

A spatial social complex network (SSCN) model is developed that captures not only essential connectivity features of real-life social networks, including a heavy-tailed degree distribution and high clustering, but also the spatial location of individuals, reproducing Zipf's law for the distribution of city populations as well as other observed hallmarks.

Homophilic wiring principles underpin neuronal network topology in vitro

Using rodent and human monolayer and organoid cultures, it is shown that homophilic generative mechanisms account for the topology of emerging cellular functional connectivity, representing an important wiring principle and determining factor of neuronal network formation in vitro.

A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search

This study provides a thorough comparative analysis and experimental evaluation of 13 representative graph-based ANNS algorithms via a new taxonomy and fine-grained pipeline, and designs an optimized method that outperforms the state-of-the-art algorithms.

Summary of SWFC-ART: A Cost-effective Approach for Fixed-Size-Candidate-Set Adaptive Random Testing through Small World Graphs

Towards Similarity Graphs Constructed by Deep Reinforcement Learning

This paper introduces a new principled algorithm, based on adjacency matrix optimization, which explicitly maximizes search efficiency and proposes a probabilistic model of a similarity graph defined in terms of its edge probabilities and shows how to learn these probabilities from data as a reinforcement learning task.



Self-organized emergence of navigability on small-world networks

It is found that navigability can naturally emerge from self-organization in the absence of prior knowledge about the underlying reference frames of networks to provide profound insights into scalable routing on the Internet due to its distributed and localized requirements.

Networks Become Navigable as Nodes Move and Forget

The first formal proof that navigability in small worlds can emerge from a dynamic process for network evolution is presented, based on the combination of two dynamics: a random walk (spatial) process, and an harmonic forgetting (temporal) process.

The evolution of navigable small-world networks

This paper introduces, analyzes and test a randomized algorithm which successively rewires a graph with every application, and gives a model for the evolution of small-world networks with properties similar to those studied by Kleinberg.

A Game Theoretic Model for the Formation of Navigable Small-World Networks

  • Zhi YangWei Chen
  • Computer Science, Economics
  • 2015
It is proved that the navigable small-world equilibrium tolerates collusions of any size and arbitrary deviations of a large random set of nodes, while non-navigable equilibria do not tolerate small group collusions or random perturbations.

Popularity versus similarity in growing networks

It is shown that popularity is just one dimension of attractiveness; another dimension is similarity, and a framework in which new connections optimize certain trade-offs between popularity and similarity is developed, instead of simply preferring popular nodes.

Self-similarity of complex networks

A power-law relation is identified between the number of boxes needed to cover the network and the size of the box, defining a finite self-similar exponent to explain the scale-free nature of complex networks and suggest a common self-organization dynamics.

Optimal transport exponent in spatially embedded networks.

The results clearly indicate that cost constraint in the navigation problem provides a proper theoretical framework to justify the evolving topologies of real complex network structures, as recently demonstrated for the networks of the US airports and the human brain activity.

Navigable networks as Nash equilibria of navigation games

It is shown that minimalistic networks designed to maximize the navigation efficiency at minimal cost share basic structural properties with real networks and these skeletons are present in the Internet, metabolic, English word, US airport, Hungarian road networks, and in a structural network of the human brain.

Navigation in a Small World

This paper finds that short paths exist on Euclidean networks for all δ < 2d and shows that these paths can be efficiently found by a local search algorithm only when δ = d, and sketches how the structure of the small-world network increases its effective dimensionality, altering the behavior of spin systems placed on it.