Search

Inspired by the generation power of generative adversarial networks (GANs) in image domains, we introduce a novel hierarchical architecture for learning characteristic topological features from a single arbitrary input graph via GANs. The hierarchical architecture consisting of multiple GANs preserves both local and global topological features and automatically partitions the input graph into representative “stages” for feature learning. The stages facilitate reconstruction and can be used as indicators of the importance of the associated topological structures. The experiments show that our method produces subgraphs retaining a wide range of topological features, even in early reconstruction stages (unlike a single GAN, which cannot easily identify such features, let alone reconstruct the original graph). This paper is the firstline research on combining the use of GANs and graph topological analysis.

The COVID-19 pandemic is changing the world in unprecedented and unpredictable ways. Human mobility, being the greatest facilitator for the spread of the virus, is at the epicenter of this change. In order to study mobility under COVID-19, to evaluate the efficiency of mobility restriction policies, and to facilitate a better response to future crisis, we need to understand all possible mobility data sources at our disposal. Our work studies private mobility sources, gathered from mobile-phones and released by large technological companies. These data are of special interest because, unlike most public sources, it is focused on individuals rather than on transportation means. Furthermore, the sample of society they cover is large and representative. On the other hand, these data are not directly accessible for anonymity reasons. Thus, properly interpreting its patterns demands caution. Aware of that, we explore the behavior and inter-relations of private sources of mobility data in the context of Spain. This country represents a good experimental setting due to both its large and fast pandemic peak and its implementation of a sustained, generalized lockdown. Our work illustrates how a direct and naive comparison between sources can be misleading, as certain days (e.g., Sundays) exhibit a directly adverse behavior. After understanding their particularities, we find them to be partially correlated and, what is more important, complementary under a proper interpretation. Finally, we confirm that mobile-data can be used to evaluate the efficiency of implemented policies, detect changes in mobility trends, and provide insights into what new normality means in Spain.

Finding communities in multilayer networks is a vital step in understanding the structure and dynamics of these layers, where each layer represents a particular type of relationship between nodes in the natural world. However, most community discovery methods for multilayer networks may ignore the interplay between layers or the unique topological structure in a layer. Moreover, most of them can only detect non-overlapping communities. In this paper, we propose a new community discovery method for multilayer networks, which leverages the interplay between layers and the unique topology in a layer to reveal overlapping communities. Through a comprehensive analysis of edge behaviors within and across layers, we first calculate the similarities for edges from the same layer and the cross layers. Then, by leveraging these similarities, we can construct a dendrogram for the multilayer networks that takes both the unique topological structure and the important interplay into consideration. Finally, by introducing a new community density metric for multilayer networks, we can cut the dendrogram to get the overlapping communities for these layers. By applying our method on both synthetic and real-world datasets, we demonstrate that our method has an accurate performance in discovering overlapping communities in multilayer networks.

The authors have inadvertently left out three coauthors from the above paper [1]. The names of the three authors are Hal Cooper, Min-Hwan Oh, and Sailung Yeung.