Modelling Complex Networks: Cameo Graphs And Transport Processes
arXiv:0711.2176
Abstract
We discuss a model accounting for the creation and development of transport networks based on the Cameo principle which refers to the idea of distribution of resources, including land, water, minerals, fuel and wealth. We also give an outlook of the use of random walks as an effective tool for the investigation of network structures and its functional segmentation. In particular, we have studied the complex transport network of Venetian canals by means of random walks.
24 pages, 7 figures, a contribution for the book of servey papers, Stochastic Networks and Internet Technology, edited by Scuola Normale Superiore, Pisa (Italy)
References in corpus (10)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Random Walks Along the Streets and Canals in Compact Cities: Spectral analysis, Dynamical Modularity, Information, and Statistical Mechanics
- Epidemic thresholds on scale-free graphs: the interplay between exponent and preferential choice
- Small World Graphs by the iterated "My Friends are Your Friends'' Principle
- The Epidemics of Corruption
- Minimal volume entropy on graphs
- Nonlinear Diffusion Through Large Complex Networks Containing Regular Subgraphs
- An Algorithm Generating Scale Free Graphs
- On random Cameo graphs with independent edges Part I: path connectivity and essential diameter