Browse
Submit Data
Databases
API
Help

Dataset Information

32 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Dynamical efficiency for multimodal time-varying transportation networks.

ABSTRACT: Spatial systems that experience congestion can be modeled as weighted networks whose weights dynamically change over time with the redistribution of flows. This is particularly true for urban transportation networks. The aim of this work is to find appropriate network measures that are able to detect critical zones for traffic congestion and bottlenecks in a transportation system. We propose for both single and multi-layered networks a path-based measure, called dynamical efficiency, which computes the travel time differences under congested and free-flow conditions. The dynamical efficiency quantifies the reachability of a location embedded in the whole urban traffic condition, in lieu of a myopic description based on the average speed of single road segments. In this way, we are able to detect the formation of congestion seeds and visualize their evolution in time as well-defined clusters. Moreover, the extension to multilayer networks allows us to introduce a novel measure of centrality, which estimates the expected usage of inter-modal junctions between two different transportation means. Finally, we define the so-called dilemma factor in terms of number of alternatives that an interconnected transportation system offers to the travelers in exchange for a small increase in travel time. We find macroscopic relations between the percentage of extra-time, number of alternatives and level of congestion, useful to quantify the richness of trip choices that a city offers. As an illustrative example, we show how our methods work to study the real network of a megacity with probe traffic data.

SUBMITTER: Bellocchi L

PROVIDER: S-EPMC8630039 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

User-based representation of time-resolved multimodal public transportation networks.

Project description:Multimodal transportation systems, with several coexisting services like bus, tram and metro, can be represented as time-resolved multilayer networks where the different transportation modes connecting the same set of nodes are associated with distinct network layers. Their quantitative description became possible recently due to openly accessible datasets describing the geo-localized transportation dynamics of large urban areas. Advancements call for novel analytics, which combines earlier established methods and exploits the inherent complexity of the data. Here, we provide a novel user-based representation of public transportation systems, which combines representations, accounting for the presence of multiple lines and reducing the effect of spatial embeddedness, while considering the total travel time, its variability across the schedule, and taking into account the number of transfers necessary. After the adjustment of earlier techniques to the novel representation framework, we analyse the public transportation systems of several French municipal areas and identify hidden patterns of privileged connections. Furthermore, we study their efficiency as compared to the commuting flow. The proposed representation could help to enhance resilience of local transportation systems to provide better design policies for future developments.

| S-EPMC4968465 | biostudies-literature

Resilience and efficiency in transportation networks.

Project description:Urban transportation systems are vulnerable to congestion, accidents, weather, special events, and other costly delays. Whereas typical policy responses prioritize reduction of delays under normal conditions to improve the efficiency of urban road systems, analytic support for investments that improve resilience (defined as system recovery from additional disruptions) is still scarce. In this effort, we represent paved roads as a transportation network by mapping intersections to nodes and road segments between the intersections to links. We built road networks for 40 of the urban areas defined by the U.S. Census Bureau. We developed and calibrated a model to evaluate traffic delays using link loads. The loads may be regarded as traffic-based centrality measures, estimating the number of individuals using corresponding road segments. Efficiency was estimated as the average annual delay per peak-period auto commuter, and modeled results were found to be close to observed data, with the notable exception of New York City. Resilience was estimated as the change in efficiency resulting from roadway disruptions and was found to vary between cities, with increased delays due to a 5% random loss of road linkages ranging from 9.5% in Los Angeles to 56.0% in San Francisco. The results demonstrate that many urban road systems that operate inefficiently under normal conditions are nevertheless resilient to disruption, whereas some more efficient cities are more fragile. The implication is that resilience, not just efficiency, should be considered explicitly in roadway project selection and justify investment opportunities related to disaster and other disruptions.

| S-EPMC5744464 | biostudies-literature

Population-weighted efficiency in transportation networks.

Project description:Transportation efficiency is critical for the operation of cities and is attracting great attention worldwide. Improving the transportation efficiency can not only decrease energy consumption, reduce carbon emissions, but also accelerate people's interactions, which will become more and more important for sustainable urban living. Generally, traffic conditions in less-developed countries are not so good due to the undeveloped economy and road networks, while this issue is rarely studied before, because traditional survey data in these areas are scarce. Nowadays, with the development of ubiquitous mobile phone data, we can explore the transportation efficiency in a new way. In this paper, based on users' call detailed records (CDRs), we propose an indicator named population-weighted efficiency (PWE) to quantitatively measure the efficiency of the transportation networks. PWE can provide insights into transportation infrastructure development, according to which we identify dozens of inefficient routes at both the intra- and inter-city levels, which are verified by several ongoing construction projects in Senegal. In addition, we compare PWE with excess commuting indices, and the fitting result of PWE is better than excess commuting index, which also proves the validity of our method.

| S-EPMC4882487 | biostudies-literature

Comparative analysis of quantitative efficiency evaluation methods for transportation networks.

Project description:An effective evaluation of transportation network efficiency could offer guidance for the optimal control of urban traffic. Based on the introduction and related mathematical analysis of three quantitative evaluation methods for transportation network efficiency, this paper compares the information measured by them, including network structure, traffic demand, travel choice behavior and other factors which affect network efficiency. Accordingly, the applicability of various evaluation methods is discussed. Through analyzing different transportation network examples it is obtained that Q-H method could reflect the influence of network structure, traffic demand and user route choice behavior on transportation network efficiency well. In addition, the transportation network efficiency measured by this method and Braess's Paradox can be explained with each other, which indicates a better evaluation of the real operation condition of transportation network. Through the analysis of the network efficiency calculated by Q-H method, it can also be drawn that a specific appropriate demand is existed to a given transportation network. Meanwhile, under the fixed demand, both the critical network structure that guarantees the stability and the basic operation of the network and a specific network structure contributing to the largest value of the transportation network efficiency can be identified.

| S-EPMC5388484 | biostudies-literature

Activity driven modeling of time varying networks.

Project description:Network modeling plays a critical role in identifying statistical regularities and structural principles common to many systems. The large majority of recent modeling approaches are connectivity driven. The structural patterns of the network are at the basis of the mechanisms ruling the network formation. Connectivity driven models necessarily provide a time-aggregated representation that may fail to describe the instantaneous and fluctuating dynamics of many networks. We address this challenge by defining the activity potential, a time invariant function characterizing the agents' interactions and constructing an activity driven model capable of encoding the instantaneous time description of the network dynamics. The model provides an explanation of structural features such as the presence of hubs, which simply originate from the heterogeneous activity of agents. Within this framework, highly dynamical networks can be described analytically, allowing a quantitative discussion of the biases induced by the time-aggregated representations in the analysis of dynamical processes.

| S-EPMC3384079 | biostudies-other

Epidemic spreading in modular time-varying networks.

Project description:We investigate the effects of modular and temporal connectivity patterns on epidemic spreading. To this end, we introduce and analytically characterise a model of time-varying networks with tunable modularity. Within this framework, we study the epidemic size of Susceptible-Infected-Recovered, SIR, models and the epidemic threshold of Susceptible-Infected-Susceptible, SIS, models. Interestingly, we find that while the presence of tightly connected clusters inhibits SIR processes, it speeds up SIS phenomena. In this case, we observe that modular structures induce a reduction of the threshold with respect to time-varying networks without communities. We confirm the theoretical results by means of extensive numerical simulations both on synthetic graphs as well as on a real modular and temporal network.

| S-EPMC5799280 | biostudies-literature

Data of cryocooler temperature dynamical response to time-varying power inputs at 4?K.

Project description:Data presented here deal with the measurement of a two-stage Gifford-McMahon cryocooler dynamical thermal response to programmed square wave and sine wave power inputs around 4?K. Square response data report the raw temperature data points measured by the sensor. Properly filtered data are also presented and results of exponential decays fitting analyses are shown as well. Sine response data were acquired with two different experimental setups and at several frequencies; data report the frequencies of the input stimulus, the measured temperature variation and the phase between input and output signals for both setups. More details about the experimental background can be found in the related research article, "Experimental analysis of the thermal behavior of a GM cryocooler based on linear system theory" (Sosso and Durandetto, in press).

| S-EPMC6153357 | biostudies-literature

Renormalization group theory for percolation in time-varying networks.

Project description:Motivated by multi-hop communication in unreliable wireless networks, we present a percolation theory for time-varying networks. We develop a renormalization group theory for a prototypical network on a regular grid, where individual links switch stochastically between active and inactive states. The question whether a given source node can communicate with a destination node along paths of active links is equivalent to a percolation problem. Our theory maps the temporal existence of multi-hop paths on an effective two-state Markov process. We show analytically how this Markov process converges towards a memoryless Bernoulli process as the hop distance between source and destination node increases. Our work extends classical percolation theory to the dynamic case and elucidates temporal correlations of message losses. Quantification of temporal correlations has implications for the design of wireless communication and control protocols, e.g. in cyber-physical systems such as self-organized swarms of drones or smart traffic networks.

| S-EPMC5964206 | biostudies-literature

Time varying networks and the weakness of strong ties.

Project description:In most social and information systems the activity of agents generates rapidly evolving time-varying networks. The temporal variation in networks' connectivity patterns and the ongoing dynamic processes are usually coupled in ways that still challenge our mathematical or computational modelling. Here we analyse a mobile call dataset and find a simple statistical law that characterize the temporal evolution of users' egocentric networks. We encode this observation in a reinforcement process defining a time-varying network model that exhibits the emergence of strong and weak ties. We study the effect of time-varying and heterogeneous interactions on the classic rumour spreading model in both synthetic, and real-world networks. We observe that strong ties severely inhibit information diffusion by confining the spreading process among agents with recurrent communication patterns. This provides the counterintuitive evidence that strong ties may have a negative role in the spreading of information across networks.

| S-EPMC3918922 | biostudies-literature

Synchronization in time-varying random networks with vanishing connectivity.

Project description:A sufficiently connected topology linking the constituent units of a complex system is usually seen as a prerequisite for the emergence of collective phenomena such as synchronization. We present a random network of heterogeneous phase oscillators in which the links mediating the interactions are constantly rearranged with a characteristic timescale and, possibly, an extremely low instantaneous connectivity. We show that with strong coupling and sufficiently fast rewiring the network reaches partial synchronization even in the vanishing connectivity limit. In particular, we provide an approximate analytical argument, based on the comparison between the different characteristic timescales of our system in the low connectivity regime, which is able to predict the transition to synchronization threshold with satisfactory precision beyond the formal fast rewiring limit. We interpret our results as a qualitative mechanism for emergence of consensus in social communities. In particular, our result suggest that groups of individuals are capable of aligning their opinions under extremely sparse exchanges of views, which is reminiscent of fast communications that take place in the modern social media. Our results may also be relevant to characterize the onset of collective behavior in engineered systems of mobile units with limited wireless capabilities.

| S-EPMC6629696 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data