Modality distance between graphs

Authors

  • Kraetzl M.
  • Wallis W.D.

Abstract

In this paper an application of tournament matrices and sequences of strength vectors to analysis of communication networks is given. Snapshot matrices of individual members of time series of weighted digraphs are defined and used for the implementation of a generalization of tournament scoring. A measure called the modality of a node is defined; modality distance between snapshots is then defined and used to measure distance between consecutive members of the time series of digraphs.

Published

2006-05-09

How to Cite

Kraetzl M., & Wallis W.D. (2006). Modality distance between graphs. Utilitas Mathematica, 69. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/444

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.