Related papers: Navigating ultrasmall worlds in ultrashort time
We report on parallel observations in two seemingly unrelated areas of dynamical network research. The one is the so-called small world phenomenon and/or the observation of scale freeness in certain types of large (empirical) networks and…
A scale-free network is grown in the Euclidean space with a global directional bias. On a vertical plane, nodes are introduced at unit rate at randomly selected points and a node is allowed to be connected only to the subset of nodes which…
Greedy navigation/routing plays an important role in geometric routing of networks because of its locality and simplicity. This can operate in geometrically embedded networks in a distributed manner, distances are calculated based on…
We study navigation with limited information in networks and demonstrate that many real-world networks have a structure which can be described as favoring communication at short distance at the cost of constraining communication at long…
Connections in complex networks are inherently fluctuating over time and exhibit more dimensionality than analysis based on standard static graph measures can capture. Here, we introduce the concepts of temporal paths and distance in…
We define a small world model over the octahedron surface and relate its distances with those of embedded spheres, preserving constant bounded distortions. The model builds networks with both number of vertices and size…
We propose a simple algorithm which produces a new category of networks, high dimensional random Apollonian networks, with small-world and scale-free characteristics. We derive analytical expressions for their degree distributions and…
The topology of city street networks (SNs) is constrained by spatial embedding, requiring non-crossing links and preventing random node placement or overlap. Here, we analyzed SNs of $33$ Indian cities to explore how the spatial embedding…
Performance of standard processes over large distributed networks typically scales with the size of the network. For example, in planar topologies where nodes communicate with their natural neighbors, the scaling factor is $O(n)$, where $n$…
One of the challenges for future infrastructures is how to design a network with high efficiency and strong connectivity at low cost. We propose self-organized geographical networks beyond the vulnerable scale-free structure found in many…
Hierarchical networks actually have many applications in the real world. Firstly, we propose a new class of hierarchical networks with scale-free and fractal structure, which are the networks with triangles compared to traditional…
A simple and accurate relationship is demonstrated that links the average shortest path, nodes, and edges in a complex network. This relationship takes advantage of the concept of link density and shows a large improvement in fitting…
Several fundamental properties of real complex networks, such as the small-world effect, the scale-free degree distribution, and recently discovered topological fractal structure, have presented the possibility of a unique growth mechanism…
We study localization of information on scale free networks with communication constraints when, for some reason, information can propagate only between ``mutually trusted nodes'' (MTN). We propose an algorithm to construct the MTN network…
Temporal networks are a class of time-varying networks, which change their topology according to a given time-ordered sequence of static networks (known as subsystems). This paper investigates the reachability and controllability of…
We study the statistical properties of the sampled scale-free networks, deeply related to the proper identification of various real-world networks. We exploit three methods of sampling and investigate the topological properties such as…
Delay Tolerant Networking (DTN) aims to address a myriad of significant networking challenges that appear in time-varying settings, such as mobile and satellite networks, wherein changes in network topology are frequent and often subject to…
Random networks with complex topology are common in Nature, describing systems as diverse as the world wide web or social and business networks. Recently, it has been demonstrated that most large networks for which topological information…
Many real-world networks have properties of small-world networks, with clustered local neighborhoods and low average-shortest path (ASP). They may also show a scale-free degree distribution, which can be generated by growth and preferential…
Finding the optimal embedding of networks into low-dimensional hyperbolic spaces is a challenge that received considerable interest in recent years, with several different approaches proposed in the literature. In general, these methods…