A convenient trick to compute cluster sizes in a Network

Autor:	Hsieh, Hsun-Yi, Kao, Yu-Chun
Rok vydání:	2024
Předmět:	Computer Science - Discrete Mathematics Computer Science - Social and Information Networks
Druh dokumentu:	Working Paper
Popis:	We present a convenient trick for computing the sizes of clusters within a network. The rationale relies on the mathematics of the geometric series and the fundamental matrix of a Markov Chain.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2407.04701 Zobrazit plný text záznamu View this record from Arxiv