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...

The mathematical framework for small-world networks proposed in a seminal paper by Watts and Strogatz sparked a widespread interest in modeling complex networks in the past decade. However, most of research contributing to static models is in contrast to real-world dynamic networks, such as...

Considering the difference between the actual and expected payoffs, we bring a stochastic learning updating rule into an evolutionary Prisoners Dilemma game and the Snowdrift game on scale-free networks, and then investigate how the expectation level A and environmental noise κ influence...

We analyze the public transport networks (PTNs) of 14 major cities of the world. While the primary network topology is defined by a set of routes each servicing an ordered series of given stations, a number of different neighborhood relations may be defined both for the routes and the stations....

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.

Using the context of routing efficiency in a complex scale-free network, we study the problem of how a limited amount of resources should be distributed to the nodes in a network so as to achieve a better performance, without imposing a certain pre-determined distribution. A dynamical...

We study the influence of network topology and connectivity on the synchronization properties of chaotic logistic maps, interacting with random delay times. Four different types of topologies are investigated: two regular (a ring-type and a ring-type with a central node) and two random...

Whenever a common resource is scarce, a set of rules are needed to share it in a fairly way. However, most control schemes assume that users will behave in a cooperative way, without taking care of guaranteeing that they will not act in a selfish manner. Then, a fundamental issue is to evaluate...

The public goods game (PGG) is generally considered as a suitable paradigm to explain ubiquitous cooperative behavior. In this study, we investigated the evolutionary PGG on scale-free networks and studied the effect of individual heterogeneity by setting the cooperator x an investment value...

In this paper, we analyze statistical properties of a communication network constructed from the records of a mobile phone company. The network consists of 2.5 million customers that have placed 810 million communications (phone calls and text messages) over a period of 6 months and for whom we...