Using core-periphery structure to predict high centrality nodes in time-varying networks

Abstract

Vertices with high betweenness and closeness centrality represent influential entities in a network. An important problem for time varying networks is to know a-priori, using minimal computation, whether the influential vertices of the current time step will retain their high centrality, in the future time steps, as the network evolves.In this paper, based on empirical evidences from several large real world time varying networks, we discover a certain class of networks where the highly central vertices are part of the innermost core of the network and this property is maintained over time. As a key contribution of this work, we propose novel heuristics to identify these networks in an optimal fashion and also develop a two-step algorithm for predicting high centrality vertices. Consequently, we show for the first time that for such networks, expensive shortest path computations in each time step as the network changes can be completely avoided; instead we can use time series models (e.g., ARIMA as used here) to predict the overlap between the high centrality vertices in the current time step to the ones in the future time steps. Moreover, once the new network is available in time, we can find the high centrality vertices in the top core simply based on their high degree.To measure the effectiveness of our framework, we perform prediction task on a large set of diverse time-varying networks. We obtain F 1-scores as high as 0.81 and 0.72 in predicting the top m closeness and betweenness centrality vertices respectively for real networks where the highly central vertices Soumya Sarkar 2 Sarkar et al mostly reside in the innermost core. For synthetic networks that conform to this property we achieve F 1-scores of 0.94 and 0.92 for closeness and betweenness respectively. We validate our results by showing that the practical effects of our predicted vertices match the effects of the actual high centrality vertices. Finally, we also provide a formal sketch demonstrating why our method works.

When the Umpire is also a Player: Bias in Private Label Product Recommendations on E-commerce Marketplaces

“…The core number of a given node 𝑖 is the largest value 𝑘 of a 𝑘-core containing that node [58]. The nodes in the inner cores are often very strongly connected [57], and therefore a large fraction of the shortest paths connecting pairs of nodes pass through the inner cores; the nodes in the periphery (and the outer cores) of the network are mostly connected via the vertices residing in the innermost core of the network [57,58]. Hence, being in the innermost core is analogous to being visited multiple times as users traverse the network.…”

Time‐Varying Spatial Memory Model and Its Impact on Virus Spreading

“…erefore, it is more appropriate to use time-varying networks to simulate the structure of real networks [16]. Timevarying networks are widely used [17][18][19]. According to characteristics of social networks, N perra et al verified degree distribution and weight distribution of nodes in the aggregated static network met the power-law distribution.…”

Clustering of temporal nodes profiles in dynamic networks of contacts

“…At the mesoscopic level, the notion of community and community detection algorithms are defined as a function of time, with communities that change over time [13]. Several authors have also adapted the notions of Core-Periphery [14,15,16].…”