Through the distinction between “real” and “virtual” links between the nodes of a graph, we develop a set of simple rules leading to scale-free networks with a tunable degree distribution exponent. Albeit sharing some similarities with preferential attachment, our procedure is both...

We propose a network description of large market investments, where both stocks and shareholders are represented as vertices connected by weighted links corresponding to shareholdings. In this framework, the in-degree (kin) and the sum of incoming link weights (v) of an investor correspond to...

Due to notable discoveries in the fast evolving field of complex networks, recent research in software engineering has also focused on representing software systems with networks. Previous work has observed that these networks follow scale-free degree distributions and reveal small-world...

We study network growth from a fixed set of initially isolated nodes placed at random on the surface of a sphere. The growth mechanism we use adds edges to the network depending on strictly local gain and cost criteria. Only nodes that are not too far apart on the sphere may be considered for...

Many models of market dynamics make use of the idea of conservative wealth exchanges among economic agents. A few years ago an exchange model using extremal dynamics was developed and a very interesting result was obtained: a self-generated minimum wealth or poverty line. On the other hand, the...

We study information packet routing processes on scale-free networks by mimicking the Internet traffic delivery strategies. We incorporate both the global network structure information and local queuing information in the dynamic processes. We propose several new routing strategies to guide the...

The impact of observational noise on the analysis of scale-free networks is studied. Various noise sources are modeled as random link removal, random link exchange and random link addition. Emphasis is on the resulting modifications for the node-degree distribution and for a functional ranking...

Song et al. [Self-similarity of complex networks, Nature 433 (2005) 392–395] have recently used a version of the box-counting method, called the node-covering method, to quantify the self-similar properties of 43 cellular networks: the minimal number NV of boxes of size ℓ needed to cover all...

In this paper we study a model of synchronization process on scale free networks with degree–degree correlations. This model was already studied on this kind of networks without correlations by Pastore y Piontti et al. [A.L. Pastore y Piontti, P.A. Macri, L.A. Braunstein, Phys. Rev. E 76...

The formation of the gel structure of a finite set of inorganic particles interacting via long range potentials is studied via Monte Carlo simulations for different conditions of temperature and concentration. We found that there are certain specific conditions wherein gelation can occur....