The Expected Number of Pairwise Stable Networks

P. Jean-Jacques Herings, Christian Seel and Arkadi Predtetchinski

Papers from arXiv.org

Abstract: This paper studies probabilistic properties of pairwise stability for a network model where individual utilities are random variables. We study the probability that a given network is pairwise stable and the expected number of pairwise stable networks. We provide a closed-form solution for the latter number. As the evaluation of the exact expression is computationally challenging for large populations, we provide tractable lower and upper bounds for this expression which allow us to pin down the asymptotic behavior of the expected number of pairwise stable networks up to a multiplicative constant. This asymptotic behavior is described by the number of networks $ 2^{n(n-1)/2} $ times $ (2/n+1)^{n} $, a sequence that tends to infinity fast. We normalize the number of pairwise stable networks by this sequence and show that the variance of the normalized number of pairwise stable networks converges to zero as $ n $ tends to infinity. We conclude that almost surely the number of pairwise stable networks tends to infinity, while the fraction of pairwise stable networks tends to $ 0 $ as $ n $ goes to infinity.

Date: 2026-06
References: Add references at CitEc
Citations:

Downloads: (external link)
https://arxiv.org/pdf/2606.23440 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:2606.23440

Access Statistics for this paper

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