arXiv · cond-mat/0212056
Nonextensive information entropy for stochastic networks
Abstract
Nature is full of random networks of complex topology describing such apparently disparate systems as biological, economical or informatical ones. Their most characteristic feature is the apparent scale-free character of interconnections between nodes. Using an information theory approach, we show that maximalization of information entropy leads to a wide spectrum of possible types of distributions including, in the case of nonextensive information entropy, the power-like scale-free distributions characteristic of complex systems.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
G. Wilk, Z. Wlodarczyk. 2003-12-03. Nonextensive information entropy for stochastic networks. https://arxiv.org/abs/cond-mat/0212056
Cite the original work for its findings. Save a collection to share your selection of sources.