Semirings for temporal network analysis

MaRDI QIDQ6271906zbMATH OpenFDO

Authors Selena Praprotnik, Vladimir Batagelj

Publication date 27 March 2016

Has companion code repository https://github.com/bavla/TQ

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Social networks; opinion dynamics (91D30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Semirings (16Y60)

Abstract: In the article, we describe a new algebraic approach to the temporal network analysis based on the notion of temporal quantities. We define the semiring for computing the foremost journey and the traveling semirings for the analysis of temporal networks where the latency is given, the waiting times are arbitrary, and some other information on the links are known. We use the operations in the traveling semiring to compute a generalized temporal betweenness centrality of the nodes that corresponds to the importance of the nodes with respect to the ubiquitous foremost journeys in a temporal network.

This page was built for publication: Semirings for temporal network analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6271906)