Literature DB >> 24808758

A dynamical systems view of network centrality.

Peter Grindrod1, Desmond J Higham2.   

Abstract

To gain insights about dynamic networks, the dominant paradigm is to study discrete snapshots, or timeslices, as the interactions evolve. Here, we develop and test a new mathematical framework where network evolution is handled over continuous time, giving an elegant dynamical systems representation for the important concept of node centrality. The resulting system allows us to track the relative influence of each individual. This new setting is natural in many digital applications, offering both conceptual and computational advantages. The novel differential equations approach is convenient for modelling and analysis of network evolution and gives rise to an interesting application of the matrix logarithm function. From a computational perspective, it avoids the awkward up-front compromises between accuracy, efficiency and redundancy required in the prevalent discrete-time setting. Instead, we can rely on state-of-the-art ODE software, where discretization takes place adaptively in response to the prevailing system dynamics. The new centrality system generalizes the widely used Katz measure, and allows us to identify and track, at any resolution, the most influential nodes in terms of broadcasting and receiving information through time-dependent links. In addition to the classical static network notion of attenuation across edges, the new ODE also allows for attenuation over time, as information becomes stale. This allows 'running measures' to be computed, so that networks can be monitored in real time over arbitrarily long intervals. With regard to computational efficiency, we explain why it is cheaper to track good receivers of information than good broadcasters. An important consequence is that the overall broadcast activity in the network can also be monitored efficiently. We use two synthetic examples to validate the relevance of the new measures. We then illustrate the ideas on a large-scale voice call network, where key features are discovered that are not evident from snapshots or aggregates.

Keywords:  algorithms; matrix computation; matrix logarithm; networks; online behaviour; real-time monitoring

Year:  2014        PMID: 24808758      PMCID: PMC3973397          DOI: 10.1098/rspa.2013.0835

Source DB:  PubMed          Journal:  Proc Math Phys Eng Sci        ISSN: 1364-5021            Impact factor:   2.704


  13 in total

1.  Community structure in time-dependent, multiscale, and multiplex networks.

Authors:  Peter J Mucha; Thomas Richardson; Kevin Macon; Mason A Porter; Jukka-Pekka Onnela
Journal:  Science       Date:  2010-05-14       Impact factor: 47.728

2.  Continuous-time model of structural balance.

Authors:  Seth A Marvel; Jon Kleinberg; Robert D Kleinberg; Steven H Strogatz
Journal:  Proc Natl Acad Sci U S A       Date:  2011-01-03       Impact factor: 11.205

3.  Small-world behavior in time-varying graphs.

Authors:  J Tang; S Scellato; M Musolesi; C Mascolo; V Latora
Journal:  Phys Rev E Stat Nonlin Soft Matter Phys       Date:  2010-05-17

4.  Flow graphs: interweaving dynamics and structure.

Authors:  R Lambiotte; R Sinatra; J-C Delvenne; T S Evans; M Barahona; V Latora
Journal:  Phys Rev E Stat Nonlin Soft Matter Phys       Date:  2011-07-25

5.  Dynamics of ranking processes in complex systems.

Authors:  Nicholas Blumm; Gourab Ghoshal; Zalán Forró; Maximilian Schich; Ginestra Bianconi; Jean-Philippe Bouchaud; Albert-László Barabási
Journal:  Phys Rev Lett       Date:  2012-09-17       Impact factor: 9.161

6.  Diffusion dynamics on multiplex networks.

Authors:  S Gómez; A Díaz-Guilera; J Gómez-Gardeñes; C J Pérez-Vicente; Y Moreno; A Arenas
Journal:  Phys Rev Lett       Date:  2013-01-08       Impact factor: 9.161

7.  Unfolding accessibility provides a macroscopic approach to temporal networks.

Authors:  Hartmut H K Lentz; Thomas Selhorst; Igor M Sokolov
Journal:  Phys Rev Lett       Date:  2013-03-11       Impact factor: 9.161

8.  Modeling temporal networks using random itineraries.

Authors:  Alain Barrat; Bastien Fernandez; Kevin K Lin; Lai-Sang Young
Journal:  Phys Rev Lett       Date:  2013-04-08       Impact factor: 9.161

9.  Simulation of an SEIR infectious disease model on the dynamic contact network of conference attendees.

Authors:  Juliette Stehlé; Nicolas Voirin; Alain Barrat; Ciro Cattuto; Vittoria Colizza; Lorenzo Isella; Corinne Régis; Jean-François Pinton; Nagham Khanafer; Wouter Van den Broeck; Philippe Vanhems
Journal:  BMC Med       Date:  2011-07-19       Impact factor: 8.775

10.  Dynamical models explaining social balance and evolution of cooperation.

Authors:  Vincent Antonio Traag; Paul Van Dooren; Patrick De Leenheer
Journal:  PLoS One       Date:  2013-04-25       Impact factor: 3.240

View more
  4 in total

1.  RMut: R package for a Boolean sensitivity analysis against various types of mutations.

Authors:  Hung-Cuong Trinh; Yung-Keun Kwon
Journal:  PLoS One       Date:  2019-03-19       Impact factor: 3.240

2.  EIGENVECTOR-BASED CENTRALITY MEASURES FOR TEMPORAL NETWORKS.

Authors:  Dane Taylor; Sean A Myers; Aaron Clauset; Mason A Porter; Peter J Mucha
Journal:  Multiscale Model Simul       Date:  2017-03-28       Impact factor: 1.930

3.  Laplacian Estrada and normalized Laplacian Estrada indices of evolving graphs.

Authors:  Yilun Shang
Journal:  PLoS One       Date:  2015-03-30       Impact factor: 3.240

4.  Temporal walk based centrality metric for graph streams.

Authors:  Ferenc Béres; Róbert Pálovics; Anna Oláh; András A Benczúr
Journal:  Appl Netw Sci       Date:  2018-08-14
  4 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.