Giacomo Como

TL;DR: In large-scale societies, which are highly fluid, the product of the mixing time of the Markov chain on the graph describing the social network and the relative size of the linkages to stubborn agents vanishes as the population size grows large, a condition of homogeneous influence emerges.

TL;DR: In this paper, the authors analyzed strong resilience properties of dynamical networks and proposed a class of distributed routing policies that yield the maximum possible strong resilience under local information constraints for an acyclic dynamical network with a single origin-destination pair.

TL;DR: The weak resilience of a dynamical network with arbitrary routing policy is shown to be upper bounded by the network's min-cut capacity and, hence, is independent of the initial flow conditions, implying that locality constraints on the information available to the routing policies do not cause loss of weak resilience.

TL;DR: The main result consists in the characterization of a stability region such that if the inflow vector in the network lies strictly inside the stability region and a certain graph theoretical condition is satisfied, then a globally asymptotically stable equilibrium exists.

TL;DR: In this paper, the throughput behavior of single-commodity dynamical flow networks governed by monotone distributed routing policies is investigated, and it is shown that if the external inflow at the origin nodes does not violate any cut capacity constraints, then there exists a globally asymptotically stable equilibrium, and the network achieves maximal throughput.