Pith. sign in

REVIEW 2 cited by

Statistical mechanics of complex networks

Not yet reviewed by Pith; the record is open.

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/0106096 v1 pith:NN6ZFHIR submitted 2001-06-06 cond-mat.stat-mech cond-mat.dis-nncs.NImath-phmath.MPnlin.AOphysics.data-an

classification cond-mat.stat-mechcond-mat.dis-nncs.NImath-phmath.MPnlin.AOphysics.data-an
keywords networksnetworkcomplextopologygraphsmechanicsrandomrecent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as random graphs, it is increasingly recognized that the topology and evolution of real networks is governed by robust organizing principles. Here we review the recent advances in the field of complex networks, focusing on the statistical mechanics of network topology and dynamics. After reviewing the empirical data that motivated the recent interest in networks, we discuss the main models and analytical tools, covering random graphs, small-world and scale-free networks, as well as the interplay between topology and the network's robustness against failures and attacks.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Sandpile Models on complex networks

    cond-mat.stat-mech 2026-07 unverdicted novelty 5.0 of 10

    A dissipative branching-process model for sandpile dynamics on complex networks predicts exponential cutoffs in avalanche sizes and shows that clustering lowers the avalanche exponent.

  2. Synthetic Tabular Data: Methods, Attacks and Defenses

    cs.LG 2025-06 conditional novelty 1.0 of 10

    A review of tabular synthetic data generation, privacy attacks, and defenses, whose central message is that synthetic data alone does not guarantee privacy.

Pith tools