most citedDescents and nodal load in scale-free networks

8 citations · 9 across the 2 of their papers we have counts for

collaborators
Showing cond-mat.stat-mechShow all

5 papers · 1 filter

cond-mat.stat-mech20078 cited

Descents and nodal load in scale-free networks

Elias Bareinboim, Valmir C. Barbosa

The load of a node in a network is the total traffic going through it when every node pair sustains a uniform bidirectional traffic between them on shortest paths. We show that nod…

cond-mat.stat-mech20071 cited

Emergence of scale-free behavior in networks from limited-horizon linking and cost trade-offs

Valmir C. Barbosa, Raul Donangelo, Sergio R. Souza

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…

cond-mat.stat-mech2005

Emergence of scale-free networks from local connectivity and communication trade-offs

Valmir C. Barbosa, Raul Donangelo, Sergio R. Souza

We introduce a new mechanism of connectivity evolution in networks to account for the emergence of scale-free behavior. The mechanism works on a fixed set of nodes and promotes gro…

cond-mat.stat-mech2003

On the phase transitions of graph coloring and independent sets

V. C. Barbosa, R. G. Ferreira

We study combinatorial indicators related to the characteristic phase transitions associated with coloring a graph optimally and finding a maximum independent set. In particular, w…

cond-mat.stat-mech2003

Directed cycles and related structures in random graphs: II--Dynamic properties

Valmir C. Barbosa, Raul Donangelo, Sergio R. Souza

We study directed random graphs (random graphs whose edges are directed) as they evolve in discrete time by the addition of nodes and edges. For two distinct evolution strategies,…