38 citations · 464 across the 71 of their papers we have counts for
7 papers · 1 filter
Network conduciveness with application to the graph-coloring and independent-set optimization transitions
Valmir C. Barbosa
We introduce the notion of a network's conduciveness, a probabilistically interpretable measure of how the network's structure allows it to be conducive to roaming agents, in certa…
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…
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…
Reachability and recoverability of sink nodes in growing acyclic directed networks
Valmir C. Barbosa
We study the growth of networks from a set of isolated ground nodes by the addition of one new node per time step and also of a fixed number of directed edges leading from the new…
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…
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…