Random Walk Fundamental Tensor and its Applications to Network Analysis

Golshan Golnari,Zhi-Li Zhang,Daniel Boley

Published 2018 in arXiv.org

ABSTRACT

We first present a comprehensive review of various random walk metrics used in the literature and express them in a consistent framework. We then introduce fundamental tensor -- a generalization of the well-known fundamental matrix -- and show that classical random walk metrics can be derived from it in a unified manner. We provide a collection of useful relations for random walk metrics that are useful and insightful for network studies. To demonstrate the usefulness and efficacy of the proposed fundamental tensor in network analysis, we present four important applications: 1) unification of network centrality measures, 2) characterization of (generalized) network articulation points, 3) identification of network most influential nodes, and 4) fast computation of network reachability after failures.

PUBLICATION RECORD

  • Publication year

    2018

  • Venue

    arXiv.org

  • Publication date

    2018-01-25

  • Fields of study

    Mathematics, Computer Science

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-65 of 65 references · Page 1 of 1

CITED BY