相关论文: Two-dimensional small-world networks: navigation w…

Discoveries of the scale-free and small-world features are reported on a network constructed from the seismic data. It is shown that the connectivity distribution decays as a power law, and the value of the degrees of separation, i.e., the…

In this paper we consider spatial networks that realize a balance between an infrastructure cost (the cost of wire needed to connect the network in space) and communication efficiency, measured by average shortest pathlength. A global…

We study the effective resistance of small-world resistor networks. Utilizing recent analytic results for the propagator of the Edwards-Wilkinson process on small-world networks, we obtain the asymptotic behavior of the disorder-averaged…

Small-world networks are ubiquitous in real-life systems. Most previous models of small-world networks are stochastic. The randomness makes it more difficult to gain a visual understanding on how do different nodes of networks interact with…

We find that a wide class of developing and decaying networks has scaling properties similar to those that were recently observed by Barab\'{a}si and Albert in the particular case of growing networks. The networks considered here evolve…

Networks of nanowires are currently under consideration for a wide range of electronic and optoelectronic applications. Nanowire devices are usually made by sequential deposition, which inevitably leads to stacking of the wires on top of…

Understanding how packets are routed in Internet is significantly important to Internet measurement and modeling. The conventional solution for route simulation is based on the assumption of unweighted shortest path. However, it has been…

Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…

Network flow is a powerful mathematical framework to systematically explore the relationship between structure and function in biological, social, and technological networks. We introduce a new pipelining model of flow through networks…

Most real-world networks are embedded in latent geometries. If a node in a network is found in the vicinity of another node in the latent geometry, the two nodes have a disproportionately high probability of being connected by a link. The…

In a network, the shortest paths between nodes are of great importance as they allow the fastest and strongest interaction between nodes. However measuring the shortest paths between all nodes in a large network is computationally…

Small world networks interpolate between fully regular and fully random topologies and simultaneously exhibit large local clustering as well as short average path length. Small world topology has therefore been suggested to support network…

In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small world effect. While the average shortest path length increases…

We propose a probabilistic growth model for transport networks which employs a balance between popularity of nodes and the physical distance between nodes. By comparing the degree of each node in the model network and the WAN, we observe…

We establish a relationship between the Small-World behavior found in complex networks and a family of Random Walks trajectories using, as a linking bridge, a maze iconography. Simple methods to generate mazes using Random Walks are…

In the classic model of first passage percolation, for pairs of vertices separated by a Euclidean distance $L$, geodesics exhibit deviations from their mean length $L$ that are of order $L^\chi$, while the transversal fluctuations, known as…

A small-world topology characterizes many complex systems including the structural and functional organization of brain networks. The topology allows simultaneously for local and global efficiency in the interaction of the system…

Both small world models of random networks with occasional long range connections and gossip processes with occasional long range transmission of information have similar characteristic behaviour. The long range elements appreciably reduce…

We analyze the propagation of activity in a system of mobile automata. A number r L^d of elements move as random walkers on a lattice of dimension d, while with a small probability p they can jump to any empty site in the system. We show…

We give exact relations for certain types of the hierarchic fractal structures. In the blatant distinction from regular networks of the "small world" (SW) topology [1], regular fractal networks manifests the logarithmic dependence of the…