Lyapunov–based Anomaly Detection in Preferential Attachment Networks

Network models aim to explain patterns of empirical relationships based on mechanisms that operate under various principles for establishing and removing links. The principle of preferential attachment forms a basis for the well-known Barabási–Albert model, which describes a stochastic preferential...

Full description

Bibliographic Details
Main Authors: Ruiz Diego, Finke Jorge
Format: Article
Language:English
Published: Sciendo 2019-06-01
Series:International Journal of Applied Mathematics and Computer Science
Subjects:
Online Access:https://doi.org/10.2478/amcs-2019-0027
id doaj-e40e5cc113944341a163c7f718d63707
record_format Article
spelling doaj-e40e5cc113944341a163c7f718d637072021-09-06T19:41:09ZengSciendoInternational Journal of Applied Mathematics and Computer Science2083-84922019-06-0129236337310.2478/amcs-2019-0027amcs-2019-0027Lyapunov–based Anomaly Detection in Preferential Attachment NetworksRuiz Diego0Finke Jorge1Department of Mathematics, University of Cauca, Calle 5 # 4-70, Popayán, ColombiaDepartment of Electrical Engineering and Computer Science, Pontifical Xavierian University, Calle 18 # 118-250, Cali, ColombiaNetwork models aim to explain patterns of empirical relationships based on mechanisms that operate under various principles for establishing and removing links. The principle of preferential attachment forms a basis for the well-known Barabási–Albert model, which describes a stochastic preferential attachment process where newly added nodes tend to connect to the more highly connected ones. Previous work has shown that a wide class of such models are able to recreate power law degree distributions. This paper characterizes the cumulative degree distribution of the Barabási–Albert model as an invariant set and shows that this set is not only a global attractor, but it is also stable in the sense of Lyapunov. Stability in this context means that, for all initial configurations, the cumulative degree distributions of subsequent networks remain, for all time, close to the limit distribution. We use the stability properties of the distribution to design a semi-supervised technique for the problem of anomalous event detection on networks.https://doi.org/10.2478/amcs-2019-0027network formation modelsdiscrete event systemsstabilityanomalous event detection
collection DOAJ
language English
format Article
sources DOAJ
author Ruiz Diego
Finke Jorge
spellingShingle Ruiz Diego
Finke Jorge
Lyapunov–based Anomaly Detection in Preferential Attachment Networks
International Journal of Applied Mathematics and Computer Science
network formation models
discrete event systems
stability
anomalous event detection
author_facet Ruiz Diego
Finke Jorge
author_sort Ruiz Diego
title Lyapunov–based Anomaly Detection in Preferential Attachment Networks
title_short Lyapunov–based Anomaly Detection in Preferential Attachment Networks
title_full Lyapunov–based Anomaly Detection in Preferential Attachment Networks
title_fullStr Lyapunov–based Anomaly Detection in Preferential Attachment Networks
title_full_unstemmed Lyapunov–based Anomaly Detection in Preferential Attachment Networks
title_sort lyapunov–based anomaly detection in preferential attachment networks
publisher Sciendo
series International Journal of Applied Mathematics and Computer Science
issn 2083-8492
publishDate 2019-06-01
description Network models aim to explain patterns of empirical relationships based on mechanisms that operate under various principles for establishing and removing links. The principle of preferential attachment forms a basis for the well-known Barabási–Albert model, which describes a stochastic preferential attachment process where newly added nodes tend to connect to the more highly connected ones. Previous work has shown that a wide class of such models are able to recreate power law degree distributions. This paper characterizes the cumulative degree distribution of the Barabási–Albert model as an invariant set and shows that this set is not only a global attractor, but it is also stable in the sense of Lyapunov. Stability in this context means that, for all initial configurations, the cumulative degree distributions of subsequent networks remain, for all time, close to the limit distribution. We use the stability properties of the distribution to design a semi-supervised technique for the problem of anomalous event detection on networks.
topic network formation models
discrete event systems
stability
anomalous event detection
url https://doi.org/10.2478/amcs-2019-0027
work_keys_str_mv AT ruizdiego lyapunovbasedanomalydetectioninpreferentialattachmentnetworks
AT finkejorge lyapunovbasedanomalydetectioninpreferentialattachmentnetworks
_version_ 1717766938925465600