Efficiency of Navigation in Indexed Networks

  title={Efficiency of Navigation in Indexed Networks},
  author={Petter Holme},
  • P. Holme
  • Published 7 July 2007
  • Computer Science
We investigate efficient methods for packets to navigate in complex networks. The packets are assumed to have memory, but no previous knowledge of the graph. We assume the graph to be indexed, i.e. every vertex is associated with a number (accessible to the packets) between one and the size of the graph. We test different schemes to assign indices and utilize them in packet navigation. Four different network models with very different topological characteristics are used for testing the schemes… 
Local-Based Semantic Navigation on a Networked Representation of Information
This paper presents a Markov chain based algorithm to tag networked terms according only to their topological features, which is used to compute similarity between terms, providing a map of the networked information.
Coupling a meshless front-tracking method with a hybrid model of wildfire spread across heterogeneous landscapes
The objective of the study is to present a method for improving the capability of a semi-physical network model to predict large fire patterns in heterogeneous landscapes. The method, which can be
Forest Fire reseArch
The objective of the study is to present a method for improving the capability of a semi-physical network model to predict large fire patterns in heterogeneous landscapes. The method, which can be


A novel approach for studying realistic navigations on networks
In this new approach, a dynamic small world (DSW) effect is said to exist when δ≈0.5 and it is shown that such a DSW does indeed exist in social networks in which the linking probability is dependent on social distances.
Growing distributed networks with arbitrary degree distributions
It is shown that, with some mild constraints, it is possible by a suitable choice of rules to arrange for the network to have any degree distribution the authors desire, and a mechanism based on biased random walks is described by which appropriate rules could be implemented in practice.
Path finding strategies in scale-free networks.
Numerically investigate the scale-free network model of Barabási and Albert through the use of various path finding strategies and a simple strategy, which utilizes only local information on the connectivity, is suggested and shown to yield small-world behavior.
Design and Analysis of a Bio-inspired Search Algorithm for Peer to Peer Networks
Experimental results show message packets undergoing proliferation spread much faster in the network and consequently proliferation algorithms produce better search output in p2p networks than random walk algorithms.
Navigation in a small world with local information.
The navigation process of launching messages toward designated targets is investigated on a variant of the one-dimensional small-world network (SWN), and the central finding is that the dynamic SW effect exists for 0</=alpha</=2 .
Search in Power-Law Networks
A number of local search strategies that utilize high degree nodes in power-law graphs and that have costs scaling sublinearly with the size of the graph are introduced and demonstrated on the GNUTELLA peer-to-peer network.
Finding and evaluating community structure in networks.
  • M. Newman, M. Girvan
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.
Ad Hoc and Sensor Networks: Theory and Applications
This book provides a comprehensive yet easy coverage of ad hoc and sensor networks and fills the gap of existing literature in this growing field. It emphasizes that there is a major interdependence
Growing scale-free networks with tunable clustering.
The standard scale-free network model is extended to include a "triad formation step" and the clustering coefficient is shown to be tunable simply by changing a control parameter---the average number of triad formation trials per time step.
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.