The Entropy of Graph Embeddings: A Proxy of Potential Mobility in Covid19 Outbreaks

S+SSPR(2021)

引用 0|浏览1
暂无评分
摘要
In this paper, we propose a proxy of the \(R_0\) (reproductive number) of COVID-19 by computing the entropy of the mobility graph during the first peak of the pandemic. The study was performed by the COVID-19 Data Science Task Force at the Comunidad Valenciana (Spain) during 70 days. Since mobility graphs are naturally attributed, directed and become more and more disconnected as more and more non-pharmaceutical measures are implemented, we discarded spectral complexity measures and classical ones such as network efficiency. Alternatively, we turned our attention to embeddings resulting from random walks and their links with stochastic matrices. In our experiments, we show that this leads to a powerful tool for predicting the spread of the virus and to assess the effectiveness of the political interventions.
更多
查看译文
关键词
Graph embeddings,Graph complexity,COVID-19
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要