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...

Descrizione completa

Dettagli Bibliografici

Autore principale:	Dimitri Volchenkov
Natura:	Artigo
Lingua:	Inglês
Pubblicazione:	MDPI AG 2023-06-01
Serie:	Information
Soggetti:	statistical ensembles of walks information graph theory navigability, walkability, and perspicacity in networking systems
Accesso online:	https://www.mdpi.com/2078-2489/14/6/338
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!