Pith. sign in

REVIEW 1 cited by

Analytic solution of the two-star model with correlated degrees

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 2102.09629 v2 pith:KWV4KSKG submitted 2021-02-18 cond-mat.stat-mech cond-mat.dis-nnphysics.soc-ph

classification cond-mat.stat-mechcond-mat.dis-nnphysics.soc-ph
keywords degreemodeldegreesnearestneighborsphasecondensedcorrelations
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Exponential random graphs are important to model the structure of real-world complex networks. Here we solve the two-star model with degree-degree correlations in the sparse regime. The model constraints the average correlation between the degrees of adjacent nodes (nearest neighbors) and between the degrees at the end-points of two-stars (next nearest neighbors). We compute exactly the network free energy and show that this model undergoes a first-order transition to a condensed phase. For non-negative degree correlations between next nearest neighbors, the degree distribution inside the condensed phase has a single peak at the largest degree, while for negative degree correlations between next nearest neighbors the condensed phase is characterized by a bimodal degree distribution. We calculate the degree assortativities and show they are non-monotonic functions of the model parameters, with a discontinuous behavior at the first-order transition. The first-order critical line terminates at a second-order critical point, whose location in the phase diagram can be accurately determined. Our results can help to develop more detailed models of complex networks with correlated degrees.

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. Missing links prediction: comparing machine learning with physics-rooted approaches

    physics.soc-ph 2026-01 conditional novelty 4.0 of 10

    On two economic networks, maximum-entropy network models predict missing links about as accurately as gradient-boosting machine learning, and adding geographic distance makes the physics-style model the better performer.

Pith tools