Pith. sign in

REVIEW 1 cited by

The dual-Barab\'asi-Albert model

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 1810.10538 v1 pith:GDVLIOGR submitted 2018-10-24 physics.soc-ph

classification physics.soc-ph
keywords asi-albertmodelnetworkscapturesocialattemptbarabcontact
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The ability to sample random networks that can accurately represent real social contact networks is essential to the study of viral epidemics. The Barab\'asi-Albert model and its extensions attempt to capture reality by generating networks with power-law degree distributions, but properties of the resulting distributions (e.g. minimum, average, and maximum degree) are often unrealistic of the social contacts the models attempt to capture. I propose a novel extension of the Barab\'asi-Albert model, which I call the "dual-Barab\'asi-Albert" (DBA) model, that attempts to better capture these properties of real networks of social contact.

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. Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms

    cs.ET 2025-01 conditional novelty 6.0 of 10

    The authors evolve max-cut graph instances in a graph autoencoder's latent space that are easy or hard for RQAOA relative to the Goemans-Williamson algorithm, then analyze their features.

Pith tools