A convenient trick to compute cluster sizes in a Network

TL;DR

This paper introduces a simple mathematical trick using geometric series and Markov chain fundamentals to efficiently compute cluster sizes in networks.

Contribution

The paper presents a novel, convenient method for calculating cluster sizes leveraging geometric series and Markov chain properties.

Findings

Efficient computation of cluster sizes demonstrated.

Method applicable to various network types.

Reduces computational complexity for clustering analysis.

Abstract

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.