The aim of the paper is to provide an analysis of news and financial data using their network representation. The formation of network structures from data sources is carried out using two different approaches: by building the so-called market graph in which nodes represent financial assets (e.g., stocks) and the edges between nodes stand for the correlation between the corresponding assets, by constructing a company co-mention network in which any two companies are connected by an edge if a news item mentioning both companies has been published in a certain period of time. Topological changes of the networks over the period 2005–2010 are investigated using the sliding window of six-month duration. We study the stability of the market graph and the company co-mention network over time and establish which of the two networks was more stable during the period. In addition, we examine the impact of the crisis of 2008 on the stability of the market graph as well as the company co-mention network. The networks that are considered in this paper and that are the objects of our study (the market graph and the company co-mention network) have a non-changing set of nodes (companies), and can change over time by adding/removing links between these nodes. Different graph similarity measures are used to evaluate these changes. If a network is stable over time, a measure of similarity between two graphs constructed for two different time windows should be close to zero. If there was a sharp change between the graphs constructed for two adjacent periods, then this should lead to a sharp increase in the value of the similarity measure between these two graphs. This paper uses the graph similarity measures which were proposed relatively recently. In addition, to estimate how the networks evolve over time we exploit QAP (Quadratic Assignment Procedure). While there is a sufficient amount of works studying the dynamics of graphs (including the use of graph similarity metrics), in this paper the company co-mention network dynamics is examined both individually and in comparison with the dynamics of market graphs for the first time.
1 June 2023 in Chaos: An Interdisciplinary Journal of Nonlinear Science
We examine the dynamics for the average degree of a node’s neighbors in complex networks. It is a Markov stochastic process, and at each moment of time, this quantity takes on its values in accordance with some probability distribution. We are interested in some characteristics of this distribution: its expectation and its variance, as well as its coefficient of variation. First, we look at several real communities to understand how these values change over time in social networks. The empirical analysis of the behavior of these quantities for real networks shows that the coefficient of variation remains at high level as the network grows. This means that the standard deviation and the mean degree of the neighbors are comparable. Then, we examine the evolution of these three quantities over time for networks obtained as simulations of one of the well-known varieties of the Barabási–Albert model, the growth model with nonlinear preferential attachment (NPA) and a fixed number of attached links at each iteration. We analytically show that the coefficient of variation for the average degree of a node’s neighbors tends to zero in such networks (albeit very slowly). Thus, we establish that the behavior of the average degree of neighbors in Barabási–Albert networks differs from its behavior in real networks. In this regard, we propose a model based on the NPA mechanism with the rule of random number of edges added at each iteration in which the dynamics of the average degree of neighbors is comparable to its dynamics in real networks.
We studied the evolution of complex social networks over time. The elements of the networks are users, and the connections correspond to the interactions between them. At a particular moment in time, each node of a complex network has such characteristics as its degree, as well as the total degree of its neighbors. Obviously, in the process of network growth, these characteristics are constantly changing due to the fact that new edges are attached to this node or its neighbors. In this paper, we study the dynamics of these characteristics over time for networks generated on the basis of a nonlinear preferential attachment mechanism, and we find both the asymptotics of their expected values and the characteristics of their spread around the mean. In addition, we analyze the behavior of these local characteristics for three real social networks. The applicability of the findings to actual problems in the study of social media in the digital humanities is discussed.
We study the evolution of the friendship index in complex social networks over time. The elements of the networks are the users, and the connections correspond to the interactions between them. The friendship index of a node is defined as the ratio of the average degree of its neighbors to the degree of the node itself. Obviously, in the process of network growth, the value of the friendship index for any node in the network may change due to the fact that new edges can be attached to this node or its neighbors. In this paper, we study the dynamics of the friendship index of a single node over time for growth networks generated on the basis of the preferential attachment mechanism. We find both the asymptotics of their expected values and the variances over time. In addition, we analyze the behavior of the friendship index for five real networks.