Epidemic forecasts are only as good as the accuracy of epidemic measurements. Is epidemic data, particularly COVID-19 epidemic data, clean, and devoid of noise? The complexity and variability inherent in data collection and reporting suggest otherwise. While we cannot evaluate the integrity of the COVID-19 epidemic data in a holistic fashion, we can assess the data for the presence of reporting delays. In our work, through the analysis of the first COVID-19 wave, we find substantial reporting delays in the published epidemic data. Motivated by the desire to enhance epidemic forecasts, we develop a statistical framework to detect, uncover, and remove reporting delays in the infectious, recovered, and deceased epidemic time series. Using our framework, we expose and analyze reporting delays in eight regions significantly affected by the first COVID-19 wave. Further, we demonstrate that removing reporting delays from epidemic data by using our statistical framework may decrease the error in epidemic forecasts. While our statistical framework can be used in combination with any epidemic forecast method that intakes infectious, recovered, and deceased data, to make a basic assessment, we employed the classical SIRD epidemic model. Our results indicate that the removal of reporting delays from the epidemic data may decrease the forecast error by up to 50%. We anticipate that our framework will be indispensable in the analysis of novel COVID-19 strains and other existing or novel infectious diseases.@en

Emergency services play a crucial role in safeguarding human life and property within society. In this paper, we propose a network-based methodology for calculating transportation access between emergency services and the broader community. Using New York City as a case study, this study identifies ‘emergency service deserts’ based on the National Fire Protection Association (NFPA) guidelines, where accessibility to Fire, Emergency Medical Services, Police, and Hospitals are compromised. The results show that while 95% of NYC residents are well-served by emergency services, the residents of Staten Island are disproportionately underserved. By quantifying the relationship between first responder travel time, Emergency Services Sector (ESS) site density, and population density, we discovered a negative power law relationship between travel time and ESS site density. This relationship can be used directly by policymakers to determine which parts of a community would benefit the most from providing new ESS locations. Furthermore, this methodology can be used to quantify the resilience of emergency service infrastructure by observing changes in accessibility in communities facing threats.

@en

As the world faces multiple crises, lessons from humanity's past can potentially suggest ways to decrease disruptions and increase societal resilience. From 1200 to 1100 BCE, several advanced societies in the Eastern Mediterranean suffered dramatic collapse. Though the causes of the Late Bronze Age Collapse are still debated, contributing factors may include a “perfect storm” of multiple stressors: social and economic upheaval, earthquake clusters, climate change, and others. We examined how collapse might have propagated through the societies’ connections by modeling the Eastern Mediterranean Late Bronze Age trade and socio-political networks. Our model shows that the Late Bronze Age societies made a robust network, where any single node's collapse was insufficient to catalyze the regional collapse that historically transpired. However, modeled scenarios indicate that some paired node disruptions could cause cascading failure within the network. Subsequently, a holistic understanding of the region's network incentive structures and feedback loops can help societies anticipate compounding risk conditions that might lead to widespread collapse and allow them to take appropriate actions to mitigate or adapt societal dependencies. Such network analyses may be able to provide insight as to how we can prevent a collapse of socio-political, economic and trade networks similar to what occurred at the end of the Late Bronze Age. Though such data-intensive analytics were unavailable to these Bronze Age regions, modern society may be able to leverage historical lessons in order to foster improved robustness and resilience to compounding threats. Our work shows that civilization collapses are preventable; we are not necessarily destined to collapse.

@en

We consider random hyperbolic graphs in hyperbolic spaces of any dimension d+1≥2. We present a rescaling of model parameters that casts the random hyperbolic graph model of any dimension to a unified mathematical framework, leaving the degree distribution invariant with respect to the dimension. Unlike the degree distribution, clustering does depend on the dimension, decreasing to 0 at d→∞. We analyze all of the other limiting regimes of the model, and we release a software package that generates random hyperbolic graphs and their limits in hyperbolic spaces of any dimension.

@en

Dynamic processes on networks, be it information transfer in the Internet, contagious spreading in a social network, or neural signaling, take place along shortest or nearly shortest paths. Computing shortest paths is a straightforward task when the network of interest is fully known, and there are a plethora of computational algorithms for this purpose. Unfortunately, our maps of most large networks are substantially incomplete due to either the highly dynamic nature of networks, or high cost of network measurements, or both, rendering traditional path finding methods inefficient. We find that shortest paths in large real networks, such as the network of protein-protein interactions and the Internet at the autonomous system level, are not random but are organized according to latent-geometric rules. If nodes of these networks are mapped to points in latent hyperbolic spaces, shortest paths in them align along geodesic curves connecting endpoint nodes. We find that this alignment is sufficiently strong to allow for the identification of shortest path nodes even in the case of substantially incomplete networks, where numbers of missing links exceed those of observable links. We demonstrate the utility of latent-geometric path finding in problems of cellular pathway reconstruction and communication security.

@en

Interpreting natural language is an increasingly important task in computer algorithms due to the growing availability of unstructured textual data. Natural Language Processing (NLP) applications rely on semantic networks for structured knowledge representation. The fundamental properties of semantic networks must be taken into account when designing NLP algorithms, yet they remain to be structurally investigated. We study the properties of semantic networks from ConceptNet, defined by 7 semantic relations from 11 different languages. We find that semantic networks have universal basic properties: they are sparse, highly clustered, and many exhibit power-law degree distributions. Our findings show that the majority of the considered networks are scale-free. Some networks exhibit language-specific properties determined by grammatical rules, for example networks from highly inflected languages, such as e.g. Latin, German, French and Spanish, show peaks in the degree distribution that deviate from a power law. We find that depending on the semantic relation type and the language, the link formation in semantic networks is guided by different principles. In some networks the connections are similarity-based, while in others the connections are more complementarity-based. Finally, we demonstrate how knowledge of similarity and complementarity in semantic networks can improve NLP algorithms in missing link inference.@en

Despite many studies on the transmission mechanism of the Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), it remains still challenging to efficiently reduce mortality. In this work, we apply a two-population Susceptible-Infected-Removed (SIR) model to investigate the COVID-19 spreading when contacts between elderly and non-elderly individuals are reduced due to the high mortality risk of elderly people. We discover that the reduction of connections between two populations can delay the death curve but cannot reduce the final mortality. We propose a merged SIR model, which advises elderly individuals to interact less with their non-elderly connections at the initial stage but interact more with their non-elderly relationships later, to reduce mortality. Finally, immunizing elderly hub individuals can also significantly decrease mortality.

@en

Researchers from various scientific disciplines have attempted to forecast the spread of coronavirus disease 2019 (COVID-19). The proposed epidemic prediction methods range from basic curve fitting methods and traffic interaction models to machine-learning approaches. If we combine all these approaches, we obtain the Network Inference-based Prediction Algorithm (NIPA). In this paper, we analyse a diverse set of COVID-19 forecast algorithms, including several modifications of NIPA. Among the algorithms that we evaluated, the original NIPA performed best at forecasting the spread of COVID-19 in Hubei, China and in the Netherlands. In particular, we show that network-based forecasting is superior to any other forecasting algorithm.

@en

Background: The COVID-19 pandemic has a significant impact on economy. Decisions regarding the reopening of businesses should account for infection risks. Objective: This paper describes a novel model for COVID-19 infection risks and policy evaluations. Methods: The model combines the best principles of the agent-based, microexposure, and probabilistic modeling approaches. It takes into account specifics of a workplace, mask efficiency, and daily routines of employees, but does not require specific inter-agent rules for simulations. Likewise, it does not require knowledge of microscopic disease related parameters. Instead, the risk of infection is aggregated into the probability of infection, which depends on the duration and distance of every contact. The probability of infection at the end of a workday is found using rigorous probabilistic rules. Unlike previous models, this approach requires only a few reference data points for calibration, which are more easily collected via empirical studies. Results: The application of the model is demonstrated for a typical office environment and for a real-world case. Conclusion: The proposed model allows for effective risk assessment and policy evaluation when there are large uncertainties about the disease, making it particularly suitable for COVID-19 risk assessments.

@en

State governments in the U.S. have been facing difficult decisions involving tradeoffs between economic and health-related outcomes during the COVID-19 pandemic. Despite evidence of the effectiveness of government-mandated restrictions mitigating the spread of contagion, these orders are stigmatized due to undesirable economic consequences. This tradeoff resulted in state governments employing mandates at widely different ways. We compare the different policies states implemented during periods of restriction (“lockdown”) and reopening with indicators of COVID-19 spread and consumer card spending at each state during the first “wave” of the pandemic in the U.S. between March and August 2020. We find that while some states enacted reopening decisions when the incidence rate of COVID-19 was minimal or sustained in its relative decline, other states relaxed socioeconomic restrictions near their highest incidence and prevalence rates experienced so far. Nevertheless, all states experienced similar trends in consumer card spending recovery, which was strongly correlated with reopening policies following the lockdowns and relatively independent from COVID-19 incidence rates at the time. Our findings suggest that consumer card spending patterns can be attributed to government mandates rather than COVID-19 incidence in the states. We estimate the recovery in states that reopened in late April was more than the recovery in states that did not reopen in the same period– 15% for consumer card spending and 18% for spending by high income households. This result highlights the important role of state policies in minimizing health impacts while promoting economic recovery and helps planning effective interventions in subsequent waves and immunization efforts.

@en

Disruptions to transportation networks are inevitable. When road networks are not resilient, or in other words, do not recover rapidly from disruptions, unpredictable events can cause significant delays that may be disproportionately greater than the extent of the disruption. Enhancing transportation system resilience can help mitigate the consequences of disruptions; however, required investments are difficult to justify given the low probability of such events. This paper calculates economic implications of unmitigated random disruptions in urban road systems. We modeled delays in transportation networks and demonstrated how resilience can be integrated into macroeconomic modeling via the transportation planning model, REMI TranSight. The model was applied to 10 cities in the United States to forecast the impact of disruptions on gross domestic product (GDP). Different disruption scenarios were modeled and the magnitude of disruption was used to calculate additional delays in transportation networks, which were then integrated into the TranSight model. The results were compared to a baseline case, where economic impact was assumed to be proportional to the magnitude of disruptions. Results show that losses in GDP were far more pronounced in the case scenario as compared to the baseline. The losses tended to be higher in wealthier and more economically productive cities. The economic output tends to rebound one to two years after a disruptive event. We conclude that different topology in transportation networks in different cities requires explicit consideration and quantification of resilience to support investment decisions designed to improve transportation networks in cities.

@en

Link prediction is a paradigmatic problem in network science with a variety of applications. In latent space network models this problem boils down to ranking pairs of nodes in the order of increasing latent distances between them. The network model with hyperbolic latent spaces has a number of attractive properties suggesting it must be a powerful tool to predict links, but the past work in this direction reported mixed results. Here we perform a systematic investigation of the utility of latent hyperbolic geometry for link prediction in networks. We first show that some measures of link prediction accuracy are extremely sensitive with respect to inaccuracies in the inference of latent hyperbolic coordinates of nodes. This observation leads us to the development of a hyperbolic network embedding method, the hyperlink embedder, which we show maximizes the accuracy of such inference, compared to existing hyperbolic embedding methods. Applying this method to synthetic and real networks, we then find that when it comes to predicting obvious missing links hyperbolic link prediction—for short, hyperlink—is rarely the best but often competitive, compared to a multitude of other methods. However, hyperlink appears to be at its best, maximizing its competitive power, when the task is to predict less obvious missing links that are really hard to predict. These links include missing links in incomplete networks with large fractions of missing links, missing links between nodes that do not have any common neighbors, and missing links between dissimilar nodes at large latent distances. Overall these results suggest that the harder a specific link prediction task the more seriously one should consider using hyperbolic geometry.@en

Maximum entropy null models of networks come in different flavors that depend on the type of constraints under which entropy is maximized. If the constraints are on degree sequences or distributions, we are dealing with configuration models. If the degree sequence is constrained exactly, the corresponding microcanonical ensemble of random graphs with a given degree sequence is the configuration model per se. If the degree sequence is constrained only on average, the corresponding grand-canonical ensemble of random graphs with a given expected degree sequence is the soft configuration model. If the degree sequence is not fixed at all but randomly drawn from a fixed distribution, the corresponding hypercanonical ensemble of random graphs with a given degree distribution is the hypersoft configuration model, a more adequate description of dynamic real-world networks in which degree sequences are never fixed but degree distributions often stay stable. Here, we introduce the hypersoft configuration model of weighted networks. The main contribution is a particular version of the model with power-law degree and strength distributions, and superlinear scaling of strengths with degrees, mimicking the properties of some real-world networks. As a byproduct, we generalize the notions of sparse graphons and their entropy to weighted networks.@en

Many cities are adopting increasingly advanced Intelligent Transportation Systems (ITS). These systems combine connectivity, coordination, adaptivity, and automated response for transportation policy optimization, thus increasing “smartness” and efficiency. However, the control and sensing systems of implemented ITS can open new vulnerabilities, especially to cyber-attacks. Currently vulnerability is managed within the framework of traditional risk assessment that assesses potential failures of the system in response to specified threats. Emerging technologies by their nature have threats that are not fully known, therefore, resilience, defined as the system's ability to recover and adapt to both known and unknown threats, is an emerging area that holds promise for assessing threats to ITS. To illustrate the applicability of resilience to ITS, we conducted a study of network efficiency and resilience in response to random and targeted disruptions of ITS systems in 10 urban areas. Disruptions were generated to affect either intersections or roadways controlled by ITS under different threat scenarios. Modeled attacks, under worst case scenarios, disrupted 20% of intersections causing on average 14.6% more additional delays than the same severity attacks on roadways. Additionally, locking traffic signal states was found to cause more disruption than fully disabling signals. Thus, as cities adopt ITS and other smart systems resulting in potentially unknown vulnerabilities, it is important to consider resilience of transportation infrastructure affected by potential cyber-attacks.

@en