Enhanced Flow in Small-World Networks

@article{Oliveira2014EnhancedFI,
  title={Enhanced Flow in Small-World Networks},
  author={Cl{\'a}udio L. N. Oliveira and Pablo A. Morais and Andr{\'e} A. Moreira and Jos{\'e} S. Andrade},
  journal={Physical review letters},
  year={2014},
  volume={112 14},
  pages={
          148701
        }
}
The proper addition of shortcuts to a regular substrate can lead to the formation of a complex network with a highly efficient structure for navigation [J. M. Kleinberg, Nature 406, 845 (2000)]. Here we show that enhanced flow properties can also be observed in these small-world topologies. Precisely, our model is a network built from an underlying regular lattice over which long-range connections are randomly added according to the probability, Pij ∼ r−α ij , where rij is the Manhattan… 
Properties of a new small-world network with spatially biased random shortcuts
This paper introduces a small-world (SW) network with a power-law distance distribution that differs from conventional models in that it uses completely random shortcuts. By incorporating spatial
Biased random walks on Kleinberg’s spatial networks
We investigate the problem of the particle or message that travels as a biased random walk toward a target node in Kleinberg’s spatial network which is built from a d-dimensional (d=2) regular
Optimal temporal path on spatial decaying networks
We introduce temporal effect to the classical Kleinberg model and study how it affects the spatial structure of optimal transport network. The initial network is built from a regular d-dimensional
A planar network between short and long range behaviour
We study the Projection of Lucena Network PLN: a planar network whose nodes coincide with the sites of the square lattice. The PLN has one internal parameter ρ, for ρ→1 the network resembles a
Transport optimization on complex gradient networks
Abstract We present a strategy of the optimization of transport on complex gradient networks by introducing the correlations between the gradient field and the local topology of networks. In this
Decentralized navigation of multiple packages on transportation networks
We investigate by numerical simulation and finite-size analysis the impact of long-range shortcuts on a spatially embedded transportation network. Our networks are built from two-dimensional ($d=2$)
Correlations between communicability sequence entropy and transport performance in spatially embedded networks.
TLDR
The results show that the transport performance is strongly correlated with the communicability sequence entropy, which can provide an effective strategy for designing a power network with high transmission efficiency, that is, the transportperformance can be optimized by improving the communicity sequence entropy of the network.
The second will be first: competition on directed networks
TLDR
Supervised placing of absorbing traps on a asymmetric disordered and complex graph is hence possible, as follows a robust optimization protocol, which is here discussed and successfully tested against synthetic data.
Small-World Propensity and Weighted Brain Networks
TLDR
This work develops a standardized procedure for generating weighted small-world networks, a weighted extension of the SWP, and a method for mapping observed brain network data onto the theoretical model, and uncovers the surprising fact that the canonical biological small- world network, the C. elegans neuronal network, has strikingly low SWP.
Examining network properties using breadth-first sampling
Many real life complex networks consists of a tremendous amount of nodes and edges which make them difficult to extract and analyze. This thesis aims to examine what network properties that can be
...
1
2
3
4
...

References

SHOWING 1-10 OF 59 REFERENCES
Random walks and electric networks
TLDR
The goal will be to interpret Polya’s beautiful theorem that a random walker on an infinite street network in d-dimensional space is bound to return to the starting point when d = 2, but has a positive probability of escaping to infinity without returning to the Starting Point when d ≥ 3, and to prove the theorem using techniques from classical electrical theory.
Nature
  • R. Rosenfeld
  • Medicine
    Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery
  • 2009
TLDR
I am writing with a simple plea to balance the voluminous articles about treatment in your journal with a modicum of information about nature and caring effects to rekindle the perception of physicians as healers, not only treaters, who relish the gifts of nature, and foster the humanistic aspect of medicine that has thrived for millennia.
Nature in London
The article tells about the diversity of green spaces in London, the citizens’ attitude toward these spaces, and what Russian cities can learn from this experience.
Nature 406
  • 845
  • 2000
Europhys. Lett
  • Europhys. Lett
  • 2008
Phys
  • Rev. Lett. 104, 018701 (2010); Phys. Rev. E 87, 042810
  • 2013
Béla Bollobás, Modern Graph Theory (Graduate Texts in Mathematics)
  • Béla Bollobás, Modern Graph Theory (Graduate Texts in Mathematics)
  • 2012
Eur
  • Phys. Lett. 100, 36006
  • 2012
Eur. Phys. Lett
  • Eur. Phys. Lett
  • 2012
Europhys
  • Lett. 100, 36006
  • 2012
...
1
2
3
4
5
...