Giant Catalytic Effect of Altruists in Schelling's Segregation Model.

We study the effect of introducing altruistic agents in a Schelling-like model of residential segregation. We find that even an infinitesimal proportion of altruists has dramatic catalytic effects on the collective utility of the system. Altruists provide pathways that move the system away from the suboptimal equilibrium it would reach if the system included only egoist agents, allowing it to reach the optimal steady state.

Who benefits most from Lyon's bike sharing system?

Bike sharing systems (BSS) have been growing fast all over the world, along with the number of articles analyzing such systems. However the lack of databases at the individual level and covering several years has limited the analysis of BSS users' behavior in the long term. This article gives a first detailed description of the temporal evolution of individual customers. Using a 5-year dataset covering 120,827 distinct year-long subscribers, we show the heterogeneous individual trajectories masked by the overall system stability. Users follow two main trajectories: about half remain in the system for at most one year, showing a low median activity (47 trips); the remaining half corresponds to more active users (median activity of 91 trips in their first year) that remain continuously active for several years (mean time = 2.9 years). We show that users from urban cores, middle-aged and male are over represented among these long-term users, which profit most from the BSS. This provides further support for the view that BSS mostly benefit the already privileged.

Mapping temporal-network percolation to weighted, static event graphs.

The dynamics of diffusion-like processes on temporal networks are influenced by correlations in the times of contacts. This influence is particularly strong for processes where the spreading agent has a limited lifetime at nodes: disease spreading (recovery time), diffusion of rumors (lifetime of information), and passenger routing (maximum acceptable time between transfers). We introduce weighted event graphs as a powerful and fast framework for studying connectivity determined by time-respecting paths where the allowed waiting times between contacts have an upper limit. We study percolation on the weighted event graphs and in the underlying temporal networks, with simulated and real-world networks. We show that this type of temporal-network percolation is analogous to directed percolation, and that it can be characterized by multiple order parameters.