Article
Distant-Reading Showcase. 200 Years of Literary Network Data at a Glance
Triclustering is an outgrowth of Formal Concept Analysis intented to detect groups of objects with similar properties (clusters) in a context of three sets of entities. In case of social network analysis, for instance, these sets might be users, their interests and events they take part in. Triclustering here can help to detect users with similar interests and make them recommendations on events. This article describes a specific triclustering algorithm and a prototype of visual analytics platform for working with obtained clusters.
Using network approach, we propose a new method of identifying key food exporters based on the long-range (LRIC) and short-range interaction indices (SRIC). These indices allow to detect several groups of economies with direct as well as indirect influence on the routes of different levels in the food network.
Trading processes is a vital part of human life and any unstable situation results in the change of living conditions of individuals. We study the power of each country in terms of produce trade. Trade relations between countries are represented as a network, where vertices are territories and edges are export flows. As flows of products between participants are heterogeneous we consider various groups of substitute goods (cereals, fish, vegetables). We detect key participants affecting food retail with the use of classical centrality measures. We also perform clustering procedure in order to find communities in networks.
A “Network Analysis” section was arranged at the XVIIIth Interna- tional Academic Conference on Economic and Social Development at the Higher School of Economics on 11–12 April 2017. For the third year, this section invited scholars from sociology, political science, management, mathematics, and linguistics who use network analysis in their research projects. During the sessions, speakers discussed the development of mathematical models used in network analysis, studies of collaboration and communication networks, networks’ in- uence on individual attributes, identifcation of latent relationships and regularities, and application of network analysis for the study of concept networks.
The speakers in this section were E. V. Artyukhova (HSE), G. V. Gra- doselskaya (HSE), M. Е. Erofeeva (HSE), D. G. Zaitsev (HSE), S. A. Isaev (Adidas), V. A. Kalyagin (HSE), I. A. Karpov (HSE), A. P. Koldanov (HSE), I. I. Kuznetsov (HSE), S. V. Makrushin (Fi- nancial University), V. D. Matveenko (HSE), A. A. Milekhina (HSE), S. P. Moiseev (HSE), Y. V. Priestley (HSE), A. V. Semenov (HSE), I. B. Smirnov (HSE), D. A. Kharkina (HSE, St. Petersburg), C. F. Fey (Aalto University School of Business), and F. López-Iturriaga (Uni- versity of Valladolid).
In this article, our ultimate goal is to transform a graph’s adjacency matrix into a distance matrix. Because cluster density is not observable prior to the actual clustering, our goal is to find a distance whose pairwise minimisation will lead to densely connected clusters. Our thesis is centred on the widely accepted notion that strong clusters are sets of vertices with high induced subgraph density. We posit that vertices sharing more connections are closer to each other than vertices sharing fewer connections. This definition of distance differs from the usual shortest-path distance. At the cluster level, our thesis translates into low mean intra-cluster distances, which reflect high densities. We compare three distance measures from the literature. Our benchmark is the accuracy of each measure’s reflection of intra-cluster density, when aggregated (averaged) at the cluster level. We conduct our tests on synthetic graphs, where clusters and intra-cluster density are known in advance. In this article, we restrict our attention to unweighted graphs with no self-loops or multiple edges. We examine the relationship between mean intra-cluster distances and intra-cluster densities. Our numerical experiments show that Jaccard and Otsuka-Ochiai offer very accurate measures of density, when averaged over vertex pairs within clusters.
Contributions in this volume focus on computationally efficient algorithms and rigorous mathematical theories for analyzing large-scale networks. Researchers and students in mathematics, economics, statistics, computer science and engineering will find this collection a valuable resource filled with the latest research in network analysis. Computational aspects and applications of large-scale networks in market models, neural networks, social networks, power transmission grids, maximum clique problem, telecommunication networks, and complexity graphs are included with new tools for efficient network analysis of large-scale networks.
This proceeding is a result of the 7th International Conference in Network Analysis, held at the Higher School of Economics, Nizhny Novgorod in June 2017. The conference brought together scientists, engineers, and researchers from academia, industry, and government.
The paper is focused on the study of reaction of italian literature critics on the publication of the Boris Pasternak's novel "Doctor Jivago". The analysys of the book ""Doctor Jivago", Pasternak, 1958, Italy" (published in Russian language in "Reka vremen", 2012, in Moscow) is given. The papers of italian writers, critics and historians of literature, who reacted immediately upon the publication of the novel (A. Moravia, I. Calvino, F.Fortini, C. Cassola, C. Salinari ecc.) are studied and analised.
In the article the patterns of the realization of emotional utterances in dialogic and monologic speech are described. The author pays special attention to the characteristic features of the speech of a speaker feeling psychic tension and to the compositional-pragmatic peculiarities of dialogic and monologic text.