A convenient trick to compute cluster sizes in a Network

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Hsieh, Hsun-Yi, Kao, Yu-Chun
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866916313784385536
author Hsieh, Hsun-Yi
Kao, Yu-Chun
author_facet Hsieh, Hsun-Yi
Kao, Yu-Chun
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2407_04701
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A convenient trick to compute cluster sizes in a Network
Hsieh, Hsun-Yi
Kao, Yu-Chun
Discrete Mathematics
Social and Information Networks
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.
title A convenient trick to compute cluster sizes in a Network
topic Discrete Mathematics
Social and Information Networks
url https://arxiv.org/abs/2407.04701