اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTransportation Network Stability: a Case Study of City Traffic
94
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The goals of this paper are to present criteria, that allow to a priori quantify the attack stability of real world correlated networks of finite size and to check how these criteria correspond to analytic results available for infinite uncorrelated networks. As a case study, we consider public transportation networks (PTN) of several major cities of the world. To analyze their resilience against attacks either the network nodes or edges are removed in specific sequences (attack scenarios). During each scenario the size S(c) of the largest remaining network component is observed as function of the removed share c of nodes or edges. To quantify the PTN stability with respect to different attack scenarios we use the area below the curve described by S(c) for c in [0,1] recently introduced (Schneider, C. M, et al., PNAS 108 (2011) 3838) as a numerical measure of network robustness. This measure captures the network reaction over the whole attack sequence. We present results of the analysis of PTN stability against node and link-targeted attacks.
قيم البحث
اقرأ أيضاً
We analyze the stability of the networks giant connected component under impact of adverse events, which we model through the link percolation. Specifically, we quantify the extent to which the largest connected component of a network consists of the
same nodes, regardless of the specific set of deactivated links. Our results are intuitive in the case of single-layered systems: the presence of large degree nodes in a single-layered network ensures both its robustness and stability. In contrast, we find that interdependent networks that are robust to adverse events have unstable connected components. Our results bring novel insights to the design of resilient network topologies and the reinforcement of existing networked systems.
We evaluate the rating system of Heroes of Newerth (HoN), a multiplayer online action role-playing game, by using statistical analysis and comparison of a players in-game performance metrics and the player rating assigned by the rating system. The da
tasets for the analysis have been extracted from the web sites that record the players ratings and a number of empirical metrics. Results suggest that the HoNs Matchmaking rating algorithm, while generally capturing the skill level of the player well, also has weaknesses, which have been exploited by players to achieve a higher placement on the ranking ladder than deserved by actual skill. In addition, we also illustrate the effects of the choice of the business model (from pay-to-play to free-to-play) on player population.
Public urban mobility systems are composed by several transportation modes connected together. Most studies in urban mobility and planning often ignore the multi-layer nature of transportation systems considering only aggregate
Multimodal transportation systems can be represented as time-resolved multilayer networks where different transportation modes connecting the same set of nodes are associated to distinct network layers. Their quantitative description became possible
recently due to openly accessible datasets describing the geolocalised 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, our aim is to provide a novel user-based methodological framework to represent public transportation systems considering the total travel time, its variability across the schedule, and taking into account the number of transfers necessary. Using this framework we analyse public transportation systems in several French municipal areas. We incorporate travel routes and times over multiple transportation modes to identify efficient transportation connections and non-trivial connectivity patterns. The proposed method enables us to quantify the networks overall efficiency as compared to the specific demand and to the car alternative.
Probability distributions of human displacements has been fit with exponentially truncated Levy flights or fat tailed Pareto inverse power law probability distributions. Thus, people usually stay within a given location (for example, the city of resi
dence), but with a non-vanishing frequency they visit nearby or far locations too. Herein, we show that an important empirical distribution of human displacements (range: from 1 to 1000 km) can be well fit by three consecutive Pareto distributions with simple integer exponents equal to 1, 2 and ($gtrapprox$) 3. These three exponents correspond to three displacement range zones of about 1 km $lesssim Delta r lesssim$ 10 km, 10 km $lesssim Delta r lesssim$ 300 km and 300 km $lesssim Delta r lesssim $ 1000 km, respectively. These three zones can be geographically and physically well determined as displacements within a city, visits to nearby cities that may occur within just one-day trips, and visit to far locations that may require multi-days trips. The incremental integer values of the three exponents can be easily explained with a three-scale mobility cost/benefit model for human displacements based on simple geometrical constrains. Essentially, people would divide the space into three major regions (close, medium and far distances) and would assume that the travel benefits are randomly/uniformly distributed mostly only within specific urban-like areas.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
