Over the past decades due to increasing economic pressure and rising demands by government and society, the organizational landscape of higher education is changing while university activities become more diversified. The focus of public support is shifting from funding current activities of universities towards rewarding outcomes. There are, as a result, many strategies to adapt and develop universities in this changing environment. For example, emerging typologies for structuring a network of higher education institutions (HEIs) taking into account their diversity are at the forefront in many countries of agendas for greater efficiency in higher education. We advance a typology for HEIs in Russia taking into account indicators of research and teaching activities. We present an overview of best practices for HEIs, some typologies, a set of indicators and mathematical tools for constructing a typology of Russian public HEIs. This typology is based on clustering the input (resource allocation) and output (performance) indicators that characterize academic and educational achievements of HEIs. The proposed classification differentiates types of universities and contains a decision tree that allows assigning universities to one category or another. It can be used as a basis for a comprehensive analysis of diverse Russian universities and for government policies to address each of the identified HEI types, depending on their characteristics.
The analysis of networks describing many social, economic, technological, biological and other systems has attracted a lot of attention last decades. Since most of these complex systems evolve over time, there is a need to investigate the changes, which appear in the system, in order to assess the sustainability of the network and to identify stable periods. In the literature, there have been developed a large number of models that measure the similarity among the networks. There also exist some surveys, which consider a limited number of similarity measures and then perform their correlation analysis, discuss their properties or assess their performances on synthetic benchmarks or real networks. The aim of the article is to extend these studies. The article considers 39 graph distance measures and compares them on simple graphs, random graph models and real networks. The author also evaluates the performance of the models in order to identify which of them can be applied to large networks. The results of the study reveal some important aspects of existing similarity models and provide a better understanding of their advantages and disadvantages. The major finding of the work is that many graph similarity measures of different nature are well correlated and that some comprehensive methods are well agreed with simple models. Such information can be used for the choice of appropriate similarity measure as well as for further development of new models for similarity assessment in network structures.
Identification of central elements in networks is an ill-defined problem. Hence, a large number of centrality measures have been proposed in the literature. We present a survey of existing axioms, which characterize certain properties of centralities. We also perform a perturbation analysis of centrality measures in real and artificial networks.