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
Signed reviews
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.
Forward citations
Cited by 1 Pith paper
-
Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms
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.
Discussion (0). Continue with ORCID to comment.