Using graph diameter for change detection in dynamic networks

MaRDI QIDQ5480724zbMATH OpenFDO

Authors Matthew E. Gaston, Miro Kraetzl, Walter D. Wallis

Publication date 3 August 2006

zbMATH Keywords

network communicationsnetwork time series

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• Detecting changes in time series of network graphs using minimum mean squared error and cumulative summation
• The resistance perturbation distance: a metric for the analysis of dynamic networks
• A graph-theoretic approach to enterprise network dynamics.
• Bayesian anomaly detection methods for social networks
• Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)

Cited in

(6)

• Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)
• Detecting changes in time series of network graphs using minimum mean squared error and cumulative summation
• Detection and diagnosis of distribution changes of degree ratio in complex networks
• Bayesian anomaly detection methods for social networks
• Lyapunov-based anomaly detection in highly-clustered networks
• Anomaly detection in dynamic networks: a survey

This page was built for publication: Using graph diameter for change detection in dynamic networks

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