SSSergey Shvydun

Sergey Shvydun

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Sergey Shvydun has a total of 32 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Centrality in complex networks under incomplete data

    by Sergey Shvydun

    The concept of centrality is one of the essential tools for analyzing complex systems. Over the years, a large number of centrality indices have been proposed that account for different aspects of a network. Unfortunately, most real networks are substantially incomplete, which affects the results of the centrality measures. This article aims to evaluate the sensitivity of 16 centrality measures to the presence of errors or incomplete information about the structure of a complex network. Our experiments are performed across 113 empirical networks. As a result, we identify centrality indices that are highly vulnerable to incomplete data.


  • Temporal Graph Reproduction With RWIG

    by Sergey Shvydun, Anton-David Almasan, Piet Van Mieghem

    We examine the Random Walkers Induced temporal Graph (RWIG) model, which generates temporal graphs based on the co-location principle of $M$ independent walkers that traverse the underlying Markov graph with different transition probabilities. Given the assumption that each random walker is in the steady state, we determine the steady-state vector $\tilde{s}$ and the Markov transition matrix $P_{i}$ of each walker $w_{i}$ that can reproduce the observed temporal network $G_{0},{{\ldots }},G_{K\text{--}1}$ with the lowest mean squared error. We also examine the performance of RWIG for periodic temporal graph sequences.


  • Generating Temporal Contact Graphs Using Random Walkers

    by Anton-David Almasan, Sergey Shvydun, Ingo Scholtes, Piet Van Mieghem

    We study human mobility networks through timeseries of contacts between individuals. Our proposed Random Walkers Induced temporal Graph (RWIG) model generates temporal graph sequences based on independent random walkers that traverse an underlying graph in discrete time steps. Co-location of walkers at a given node and time defines an individual-level contact. RWIG is shown to be a realistic model for temporal human contact graphs, which may place RWIG on a same footing as the Erdos–Renyi (ER) and Barabasi–Albert (BA) models for fixed graphs. Moreover, RWIG is analytically feasible: we derive closed form solutions for the probability distribution of contact graphs.


  • SRAVNITEL'NYY ANALIZ MER TsENTRAL'NOSTI V SETEVYKh STRUKTURAKh

    by N. G MEShchERYaKOVA, S. V ShVYDUN, Мещерякова Н. Г

    Рассматривается задача нахождения центральных элементов в сетевых структурах. Поскольку концепция центральности не имеет четкого определения, в литературе известно большое число моделей определения наиболее важных элементов сети. Приведен обзор существующих подходов для сравнения мер центральности, осуществлен сравнительный анализ чувствительности известных индексов центральности к различным изменениям в структуре сети.

  • Open Access

    Generating Temporal Contact Graphs Using Random Walkers

    by Anton-David Almasan, Sergey Shvydun, Ingo Scholtes, Piet Van Mieghem

    We study human mobility networks through timeseries of contacts between individuals. Our proposed Random Walkers Induced temporal Graph (RWIG) model generates temporal graph sequences based on independent random walkers that traverse an underlying graph in discrete time steps. Co-location of walkers at a given node and time defines an individual-level contact. RWIG is shown to be a realistic model for temporal human contact graphs, which may place RWIG on a same footing as the Erdos-Renyi (ER) and Barabasi-Albert (BA) models for fixed graphs. Moreover, RWIG is analytically feasible: we derive closed form solutions for the probability distribution of contact graphs.

  • A Comparative Analysis of Centrality Measures in Complex Networks

    by N. Meshcheryakova, S. Shvydun

    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.


  • System Identification for Temporal Networks

    by Sergey Shvydun, Piet Van Mieghem

    Modelling temporal networks is an open problem that has attracted researchers from a diverse range of fields. Currently, the existing modelling solutions of time-evolving graphs do not allow us to provide an accurate graph sequence. In this paper, we examine the network dynamics from a system identification perspective. We prove that any periodic graph sequence can be accurately modelled as a linear process. We propose two algorithms, called Subspace Graph Generator (SG-gen) and Linear Periodic Graph Generator (LPG-gen), for modelling periodic graph sequences and provide their performance on artificial graph sequences. We further propose a novel model, called Linear Graph Generator (LG-gen), that can be applied to non-periodic graph sequences. Our experiments on artificial and real networks demonstrate that many temporal networks can be accurately approximated by periodic graph sequences.


  • Open Access

    Perturbation Analysis of Centrality Measures

    by Natalia Meshcheryakova, Sergey Shvydun

    In recent decades, a large number of centrality measures have been proposed to assess the importance of nodes in complex networks. The choice of the most appropriate centrality index for specific applications is one of the biggest challenges. This paper performs the perturbation analysis of 8 centrality measures. Since most real networks are incomplete and prone to bias, we compare centrality measures in order to evaluate their sensitivity to small changes in a graph structure. Our experiments are performed on 8 classical graph structures ranging from a simple path graph to a Watts-Strogatz graph model. As a result, we provide a sensitivity of centrality measures on different graph structures.


  • Open Access

    Models of similarity in complex networks

    by Sergey Shvydun

    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.