{"paper":{"title":"Modeling epidemics on d-cliqued graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"q-bio.PE","authors_text":"Anlin Zhang, Laura P. Schaposnik","submitted_at":"2018-01-31T23:35:04Z","abstract_excerpt":"Since social interactions have been shown to lead to symmetric clusters, we propose here that symmetries play a key role in epidemic modeling. Mathematical models on d-ary tree graphs were recently shown to be particularly effective for modeling epidemics in simple networks [Seibold & Callender, 2016]. To account for symmetric relations, we generalize this to a new type of networks modeled on d-cliqued tree graphs, which are obtained by adding edges to regular d-trees to form d-cliques. This setting gives a more realistic model for epidemic outbreaks originating, for example, within a family o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00102","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}