Pith. sign in

REVIEW 1 cited by

Nonextensive information entropy for stochastic networks

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cond-mat/0212056 v4 pith:KZIBJNZS submitted 2002-12-03 cond-mat hep-phnucl-th

G.Wilk , Z.Wlodarczyk This is my paper · ORCID
classification cond-mathep-phnucl-th
keywords informationentropycharacteristiccomplexdistributionsnetworksnonextensivescale-free
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Black Hole Thermodynamics via Tsallis Statistical Mechanics

    gr-qc 2025-02 conditional novelty 6.0 of 10

    The authors derive a q-modified black hole entropy from Tsallis statistics applied to a near-horizon gas and show that a negative non-extensive parameter can stabilize a Schwarzschild black hole.

Pith tools