Models, Algorithms, and Technologies for Network Analysis. Springer Proceedings in Mathematics & Statistics
A new approach to network decomposition problems (and, hence, to classification problems, presented in network form) is suggested. Opposite to the conventional approach, consisting in construction of one, “the most correct” decomposition (classification), the suggested approach is focused on construction of a family of classifications. Basing on this family, two numerical indices are introduced and calculated. The suggested indices describe the complexity of the initial classification problem as whole. The expedience and applicability of the elaborated approach are illustrated by two well-known and important cases: political voting body and stock market. In both cases the presented results cannot be obtained by other known methods. It confirms the perspectives of the suggested approach.
Our study employs the network approach to the problem of international migration. During the last years, migration has attracted a lot of attention and has been examined from many points of view. However, very few studies considered it from the network perspective. The international migration can be represented as a network (or weighted directed graph) where the nodes correspond to countries and the edges correspond to migration flows. The main focus of our study is to reveal a set of critical or central elements in the network. To do it, we calculated different existing and new centrality measures. In our research the United Nations International Migration Flows Database (version 2015) was used. As a result, we obtained information on critical elements for the migration process in 2013.
We consider an application of power indices, which take into account preferences of agents for coalition formation proposed for an analysis of power distribution in elected bodies to reveal most powerful (central) nodes in networks. These indices take into account the parameters of the nodes in networks, a possibility of group influence from the subset of nodes to single nodes, and intensity of short and long interactions among the nodes.
Modern bibliographic databases contain significant amount of information on publication activities of research communities. Researchers regularly encounter challenging task of selecting a co-author for joint research publication or searching for authors, whose papers are worth reading. We propose a new recommender system for finding possible collaborator with respect to research interests. The recommendation problem is formulated as a link prediction within the co-authorship network. The network is derived from the bibliographic database and enriched by the information on research papers obtained from Scopus and other publication ranking systems.
Изучается проблема проверки гипотезы однородности для распределения степени вершин в графе рынка. Процедура тестирования нескольких гипотез предлагается и применяется для фондовых рынков Китая и Индии. Процедура построена с использованием бутстрэпа для отдельных гипотез и коррекции Бонферрони для множественного тестирования. Показано, что гипотеза однородности распределения степеней для фондовых рынков на период 2003-2014 гг. не принимается.