Navigability, Walkability, and Perspicacity Associated with Canonical Ensembles of Walks in Finite Connected Undirected Graphs—Toward Information Graph Theory

Canonical ensembles of walks in a finite connected graph assign the properly normalized probability distributions to all nodes, subgraphs, and nodal subsets of the graph at all time and connectivity scales of the diffusion process. The probabilistic description of graphs allows for introducing the q...

Full description

Bibliographic Details
Main Author: Dimitri Volchenkov
Format: Article
Language:English
Published: MDPI AG 2023-06-01
Series:Information
Subjects:
Online Access:https://www.mdpi.com/2078-2489/14/6/338