Influence and Connectivity in Networks: A Generating Function Approach

Yang Sun, Wei Zhao and Junjie Zhou

Papers from arXiv.org

Abstract: Many widely used network centralities are based on counting walks that meet specific criteria. This paper introduces a systematic framework for walk enumeration using generating functions. We introduce a first-passage decomposition that uniquely divides any walk passing through specified nodes or links into two components: a first-reaching walk and a subsequent walk. This decomposition yields a system of interconnected equations that relate three disjoint categories of walks: unrestricted walks, walks that avoid specific elements, and walks that pass through designated sets. The framework offers a range of applications, including evaluating the effects of structural interventions, such as node or link modifications, on network walks, generalizing target centrality to multi-receiver scenarios in information networks, and comparing different strategies for adding links.

Date: 2025-08
New Economics Papers: this item is included in nep-net
References: Add references at CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2508.09492 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2508.09492

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().