A multi-modal transportation system of a city can be modeled as a multiplex network with different layers corresponding to different transportation modes. These layers include, but are not limited to, bus network, metro network, and road network. Formally, a multiplex network is a multilayer graph in which the same set of nodes are connected by different types of relationships. Intra-layer relationships denote the road segments connecting stations of the same transportation mode, whereas inter-layer relationships represent connections between different transportation modes within the same station. Given a multi-modal transportation system of a city, we are interested in assessing its quality or efficiency by estimating the coverage i.e., a portion of the city that can be covered by a random walker who navigates through it within a given time budget, or steps. We are also interested in the robustness of the whole transportation system which denotes the degree to which the system is able to withstand a random or targeted failure affecting one or more parts of it. Previous approaches proposed a mathematical framework to numerically compute the coverage in multiplex networks. However solutions are usually based on eigenvalue decomposition, known to be time consuming and hard to obtain in the case of large systems. In this work, we propose MUME, an efficient algorithm for Multi-modal Urban Mobility Estimation, that takes advantage of the special structure of the supra-Laplacian matrix of the transportation multiplex, to compute the coverage of the system. We conduct a comprehensive series of experiments to demonstrate the effectiveness and efficiency of MUME on both synthetic and real transportation networks of various cities such as Paris, London, New York and Chicago. A future goal is to use this experience to make projections for a fast growing city like Doha.

Resilience analytics: coverage and robustness in multi-modal transportation networks

Abdelkader Baggag, Sofiane Abbar, Tahar Zanouda and Jaideep Srivastava
EPJ Data Science 2018 7:14
https://doi.org/10.1140/epjds/s13688-018-0139-7

Source: epjdatascience.springeropen.com

Social media often goes very wrong. Making it right requires a vision for how social media can help, not harm, society.

Six or Seven Things Social Media Can Do For Democracy

Ethan Zuckerman

Source: medium.com

The utilisation of the ecospace and the change in diversity through time has been suggested to be due to the effect of niche partitioning, as a global long-term pattern in the fossil record. However, niche partitioning, as a way to coexist, could be a limited means to share the environmental resources and condition during evolutionary time. In fact, a physical limit impedes a high partitioning without a high restriction of the niche’s variables. Here, we propose that niche emergence, rather than niche partitioning, is what mostly drives ecological diversity. In particular, we view ecosystems in terms of autocatalytic sets: catalytically closed and self-sustaining reaction (or interaction) networks. We provide some examples of such ecological autocatalytic networks, how this can give rise to an expanding process of niche emergence (both in time and space), and how these networks have evolved over time (so-called evoRAFs). Furthermore, we use the autocatalytic set formalism to show that it can be expected to observe a power-law in the size distribution of extinction events in ecosystems. In short, we elaborate on our earlier argument that new species create new niches, and that biodiversity is therefore an autocatalytic process.

Niche emergence as an autocatalytic process in the evolution of ecosystems

Roberto Cazzolla Gatti, Brian Fath, Wim Hordijk, Stuart Kauffman, Robert Ulanowicz

Journal of Theoretical Biology

Source: www.sciencedirect.com