Finding another yourself in multiplex networks

摘要

Recently multiplex networks have attracted a great deal of attentions in the science of complex networks, since they provide more natural and reasonable way to describe realistic complex systems. However, one of the biggest challenges for this issue is the lack of real-world multiplex data, which is mainly caused by the difficulty to distinguish who the replicas of nodes in different network layers (namely, finding another yourself (FAY) problem). In this paper, we consider two kinds of epidemic spreading models named SIR-DIAL model and SIR-NIAL model, and propose methods to solve the FAY problem based on the replica similarity during the epidemic process. To acquire high accuracy, our methods need to observe the spreading information of as many epidemics as possible, and record state information of nodes at as many time steps as possible during the epidemic spreading process with SIR-DIAL model; but just the final results after the epidemic spreading process ends in SIR-NIAL model.