Sharif Digital Repository

Real networks often exhibit nontrivial topological features that do not occur in random graphs. The need for synthesizing realistic networks has resulted in development of various network models. In this paper, we address the problem of selecting and calibrating the model that best fits a given target network. The existing model fitting approaches mostly suffer from sensitivity to network perturbations, lack of the parameter estimation component, dependency on the size of the networks, and low accuracy. To overcome these limitations, we considered a broad range of network features and employed machine learning techniques such as genetic algorithms, distance metric learning, nearest neighbor... 

Real networks show nontrivial topological properties such as community structure and long-tail degree distribution. Moreover, many network analysis applications are based on topological comparison of complex networks. Classification and clustering of networks, model selection, and anomaly detection are just some applications of network comparison. In these applications, an effective similarity metric is needed which, given two complex networks of possibly different sizes, evaluates the amount of similarity between the structural features of the two networks. Traditional graph comparison approaches, such as isomorphism-based methods, are not only too time consuming but also inappropriate to...