#### Filter Results:

#### Publication Year

2003

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

In the past years, network theory has successfully characterized the interaction among the constituents of a variety of complex systems, ranging from biological to technological, and social systems. However, up until recently, attention was almost exclusively given to networks in which all components were treated on equivalent footing, while neglecting all… (More)

Randomized network ensembles are the null models of real networks and are extensiv-elly used to compare a real system to a null hypothesis. In this paper we study network ensembles with the same degree distribution, the same degree-correlations or the same community structure of any given real network. We characterize these randomized network ensembles by… (More)

We define a minimal model of traffic flows in complex networks in order to study the trade-off between topological-based and traffic-based routing strategies. The resulting collective behavior is obtained analytically for an ensemble of uncorrelated networks and summarized in a rich phase diagram presenting second-order as well as first-order phase… (More)

We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particular, those mediated by the Internet). We use analytical and numerical solutions of these equations to examine the threshold behaviour and dynamics of the model on several models of… (More)

Loops are subgraphs responsible for the multiplicity of paths going from one to another generic node in a given network. In this paper we present an analytic approach for the evaluation of the average number of loops in random scale-free networks valid at fixed number of nodes N and for any length L of the loops. We bring evidence that the most frequent… (More)

- Daniele De Martino, Luca Dall’Asta, Ginestra Bianconi, Matteo Marsili
- 2009

We study a minimal model of traffic flows in complex networks, simple enough to get analytical results, but with a very rich phenomenology, presenting continuous, discontinuous as well as hybrid phase transitions between a free-flow phase and a congested phase, critical points and different scaling behaviors in the system size. It consists of random walkers… (More)

In this paper we calculate the average number of cliques in random scale-free networks. We consider first the hidden variable ensemble and subsequently the Molloy Reed ensemble. In both cases we find that cliques, i.e. fully connected subgraphs, appear also when the average degree is finite. This is in contrast to what happens in Erdös and Renyi graphs in… (More)

The metric structure of bosonic scale-free networks and fermionic Cayley-tree networks is analyzed, focusing on the directed distance of nodes from the origin. The topology of the networks strongly depends on the dynamical parameter T, called the temperature. At T= infinity we show analytically that the two networks have a similar behavior: the distance of… (More)

Some phenomena are characterized by a non-trivial network dynamics exhibiting self-organized criticality or discontinuous transitions, coexistence and hysteresis. After a short review, we show that a similar approach suggests that social communities stabilized by network interactions may become unstable if they grow too large. Many real systems cannot be… (More)

- ‹
- 1
- ›