We study the distribution of number of neighbors, ζ, of a multifractal self-affine lattice, Qmf, defined by a single parameter ρ. ζ is neither a constant like in regular lattices nor follows a Gaussian distribution as in the Voronoi lattice. The histogram of ζ show exponential behavior for...

We discuss various aspects of the statistical formulation of the theory of random graphs, with emphasis on results obtained in a series of our recent publications.

As a representative of a complex technological system, the so-called wireless multihop ad hoc communication networks are discussed. They represent an infrastructure-less generalization of todays wireless cellular phone networks. Lacking a central control authority, the ad hoc nodes have to...

Recently, Abe and Suzuki pointed out that epicenters of earthquakes could be connected in order to generate a graph, with properties of a scale-free network. We have shown that the Olami–Feder–Christensen (OFC) model for the dynamics of earthquakes, defined both in square and cubic lattices,...

Due to their inherent complexity, engineered wireless multihop ad hoc communication networks represent a technological challenge. Having no mastering infrastructure the nodes have to selforganize themselves in such a way that for example network connectivity, good data traffic performance and...

Large-scale blackouts are an intrinsic drawback of electric power transmission grids. Here we analyze the structural vulnerability of the Italian GRTN power grid by using a model for cascading failures recently proposed in Crucitti et al. (Phys. Rev. E 69 (2004)).

The central points of communication network flow have often been identified using graph theoretical centrality measures. In real networks, the state of traffic density arises from an interplay between the dynamics of the flow and the underlying network structure. In this work we investigate the...