Nonextensive aspects of small-world networks
Hideo Hasegawa (Tokyo Gakugei Univ.)

TL;DR
This paper explores the nonextensive statistical properties of degree distributions in Watts-Strogatz small-world networks using a generalized Gaussian framework derived through multiple approaches, providing a unified description of network degree behavior.
Contribution
It introduces a $Q$-Gaussian model for degree distributions in small-world networks, derived via maximum-entropy, stochastic differential equations, and hidden-variable methods, unifying their descriptions.
Findings
$Q$-Gaussian accurately fits main parts of degree distributions with ~1% error.
Incorporating $k$-dependence into the entropic index improves tail behavior modeling.
The model captures 96-99% of all degree states in small-world networks.
Abstract
Nonextensive aspects of the degree distribution in Watts-Strogatz (WS) small-world networks, , have been discussed in terms of a generalized Gaussian (referred to as {\it -Gaussian}) which is derived by the three approaches: the maximum-entropy method (MEM), stochastic differential equation (SDE), and hidden-variable distribution (HVD). In MEM, the degree distribution in complex networks has been obtained from -Gaussian by maximizing the nonextensive information entropy with constraints on averages of and in addition to the normalization condition. In SDE, -Gaussian is derived from Langevin equations subject to additive and multiplicative noises. In HVD, -Gaussian is made by a superposition of Gaussians for random networks with fluctuating variances, in analogy to superstatistics. Interestingly, {\it a single} may describe, with an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
