相关论文: Physical realizability of small-world networks

Small-world architectures may be implicated in a range of phenomena from disease propagation to networks of neurons in the cerebral cortex. While most of the recent attention on small-world networks has focussed on the effect of introducing…

We propose a generalization of small world networks, in which the reconnection of links is governed by a function that depends on the distance between the elements to be linked. An adequate choice of this function lets us control the…

Real-world networks such as the Internet and WWW have many common traits. Until now, hundreds of models were proposed to characterize these traits for understanding the networks. Because different models used very different mechanisms, it…

Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared with the ones in a random graph. Examples of small-world…

Networks are useful for describing systems of interacting objects, where the nodes represent the objects and the edges represent the interactions between them. The applications include chemical and metabolic systems, food webs as well as…

Recent progress in network topology modeling [1], [2] has shown that it is possible to create smaller-scale replicas of large complex networks, like the Internet, while simultaneously preserving several important topological properties.…

The small-world network model is a simple model of the structure of social networks, which simultaneously possesses characteristics of both regular lattices and random graphs. The model consists of a one-dimensional lattice with a low…

Networks with long-range connections obeying a distance-dependent power law of sufficiently small exponent display superdiffusion, L\'evy flights and robustness properties very different from the scale-free networks. It has been proposed…

Empirical complex systems must differentially respond to external perturbations and, at the same time, internally distribute information to coordinate their components. While networked backbones help with the latter, they limit the…

We quantify the dynamical implications of the small-world phenomenon. We consider the generic synchronization of oscillator networks of arbitrary topology, and link the linear stability of the synchronous state to an algebraic condition of…

Complex network formalism allows to explain the behavior of systems composed by interacting units. Several prototypical network models have been proposed thus far. The small-world model has been introduced to mimic two important features…

Recently, Watts and Strogatz introduced the so-called small-world networks in order to describe systems which combine simultaneously properties of regular and of random lattices. In this work we study diffusion processes defined on such…

Inspired by studies on the airports' network and the physical Internet, we propose a general model of weighted networks via an optimization principle. The topology of the optimal network turns out to be a spanning tree that minimizes a…

We study the Kleinberg problem of navigation in Small World networks when the underlying lattice is stretched along a preferred direction. Extensive simulations confirm that maximally efficient navigation is attained when the length $r$ of…

Efficiency in passage times is an important issue in designing networks, such as transportation or computer networks. The small-world networks have structures that yield high efficiency, while keeping the network highly clustered. We show…

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…

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 consider a wireless network with a set of transmitter-receiver pairs, or links, that share a common channel, and address the problem of emptying finite traffic volume from the transmitters in minimum time. This, so called, minimum-time…

Small-world networks, known for high local clustering and short path lengths, are a fundamental structure in many real-world systems, including social, biological, and technological networks. We apply the theory of (marked) local…

We present an exact description of a crossover between two different regimes of simple analogies of small-world networks. Each of the sites chosen with a probability $p$ from $n$ sites of an ordered system defined on a circle is connected…