We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...
We analyse a suite of Boolean networks which have been evolved to exhibit limit cycle-type dynamics in terms of the distribution of small network motifs and feedback loops. We find...
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
In this paper, we present our ongoing work on developing a framework for detecting time-varying communities on human mobile networks. We define the term community in environments ...