Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantifying Community Resilience Based on Fluctuations in Visits to Point-of-Interest from Digital Trace Data
74
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
This study aims to quantify community resilience based on fluctuations in the visits to various Point-of-Interest (POIs) locations. Visit to POIs is an essential indicator of human activities and captures the combined effects of perturbations in people lifestyles, built environment conditions, and businesses status. The study utilized digital trace data of unique visits to POIs in the context of the 2017 Hurricane Harvey in Houston (Texas, USA) to examine spatial patterns of impact and total recovery effort and utilized these measures to quantify community resilience. The results showed that certain POI categories such as building materials and supplies dealers and grocery stores were the most resilient elements of the community compared to the other POI categories. On the other hand, categories such as medical facilities and entertainment were found to have lower resilience values. This result suggests that these categories were either not essential for community recovery or that the community was not able to access these services at normal levels immediately after the hurricane. In addition, the spatial analyses revealed that many areas in the community with lower levels of resilience experienced extensive flooding. However, some areas with low resilience were not flooded extensively, suggesting that spatial reach of the impacts goes beyond flooded areas. The results demonstrate the importance of the approach proposed in our study. While this study focused on Houston and only analysed one natural hazard, the approach can be applied to other communities and disaster contexts. Applying this approach, emergency managers and public officials can efficiently monitor the patterns of disaster impacts and recovery across different spatial areas and POI categories and also identify POI categories and areas of their community that need to be prioritized for resource allocation.
rate research
Read More
Epidemic propagation on complex networks has been widely investigated, mostly with invariant parameters. However, the process of epidemic propagation is not always constant. Epidemics can be affected by various perturbations, and may bounce back to its original state, which is considered resilient. Here, we study the resilience of epidemics on networks, by introducing a different infection rate ${lambda_{2}}$ during SIS (susceptible-infected-susceptible) epidemic propagation to model perturbations (control state), whereas the infection rate is ${lambda_{1}}$ in the rest of time. Through simulations and theoretical analysis, we find that even for ${lambda_{2}<lambda_{c}}$, epidemics eventually could bounce back if control duration is below a threshold. This critical control time for epidemic resilience, i.e., ${cd_{max}}$ can be predicted by the diameter (${d}$) of the underlying network, with the quantitative relation ${cd_{max}sim d^{alpha}}$. Our findings can help to design a better mitigation strategy for epidemics.
In cerebrovascular networks, some vertices are more connected to each other than with the rest of the vasculature, defining a community structure. Here, we introduce a class of model networks built by rewiring Random Regular Graphs, which enables to reproduce this community structure and other topological properties of cerebrovascular networks. We use these model networks to study the global flow reduction induced by the removal of a single edge. We analytically show that this global flow reduction can be expressed as a function of the initial flow rate in the removed edge and of a topological quantity, both of which display probability distributions following Cauchy laws, i.e. with large tails. As a result, we show that the distribution of blood flow reductions is strongly influenced by the community structure. In particular, the probability of large flow reductions increases substantially when the community structure is stronger, weakening the network resilience to single capillary occlusions. We discuss the implications of these findings in the context of Alzheimers Disease, in which the importance of vascular mechanisms, including capillary occlusions, is beginning to be uncovered.
Community detection or clustering is a crucial task for understanding the structure of complex systems. In some networks, nodes are permitted to be linked by either positive or negative edges; such networks are called signed networks. Discovering communities in signed networks is more challenging than that in unsigned networks. In this study, we innovatively develop a non-backtracking matrix of signed networks, theoretically derive a detectability threshold for this matrix, and demonstrate the feasibility of using the matrix for community detection. We further improve the developed matrix by considering the balanced paths in the network (referred to as a balanced non-backtracking matrix). Simulation results demonstrate that the algorithm based on the balanced nonbacktracking matrix significantly outperforms those based on the adjacency matrix and the signed non-backtracking matrix. The proposed (improved) matrix shows great potential for detecting communities with or without overlap.
Human behaviors are often driven by human interests. Despite intense recent efforts in exploring the dynamics of human behaviors, little is known about human-interest dynamics, partly due to the extreme difficulty in accessing the human mind from observations. However, the availability of large-scale data, such as those from e-commerce and smart-phone communications, makes it possible to probe into and quantify the dynamics of human interest. Using three prototypical big data sets, we investigate the scaling behaviors associated with human-interest dynamics. In particular, from the data sets we uncover power-law scaling associated with the three basic quantities: (1) the length of continuous interest, (2) the return time of visiting certain interest, and (3) interest ranking and transition. We argue that there are three basic ingredients underlying human-interest dynamics: preferential return to previously visited interests, inertial effect, and exploration of new interests. We develop a biased random-walk model, incorporating the three ingredients, to account for the observed power-law scaling relations. Our study represents the first attempt to understand the dynamical processes underlying human interest, which has significant applications in science and engineering, commerce, as well as defense, in terms of specific tasks such as recommendation and human-behavior prediction.
Grouping objects into clusters based on similarities or weights between them is one of the most important problems in science and engineering. In this work, by extending message passing algorithms and spectral algorithms proposed for unweighted community detection problem, we develop a non-parametric method based on statistical physics, by mapping the problem to Potts model at the critical temperature of spin glass transition and applying belief propagation to solve the marginals corresponding to the Boltzmann distribution. Our algorithm is robust to over-fitting and gives a principled way to determine whether there are significant clusters in the data and how many clusters there are. We apply our method to different clustering tasks and use extensive numerical experiments to illustrate the advantage of our method over existing algorithms. In the community detection problem in weighted and directed networks, we show that our algorithm significantly outperforms existing algorithms. In the clustering problem when the data was generated by mixture models in the sparse regime we show that our method works to the theoretical limit of detectability and gives accuracy very close to that of the optimal Bayesian inference. In the semi-supervised clustering problem, our method only needs several labels to work perfectly in classic datasets. Finally, we further develop Thouless-Anderson-Palmer equations which reduce heavily the computation complexity in dense-networks but gives almost the same performance as belief propagation.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
