{"paper":{"title":"Extraordinary variability and sharp transitions in a maximally frustrated dynamic network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"B. Schmittmann, R.K.P. Zia, Wenjia Liu","submitted_at":"2012-12-03T22:29:32Z","abstract_excerpt":"Using Monte Carlo and analytic techniques, we study a minimal dynamic network involving two populations of nodes, characterized by different preferred degrees. Reminiscent of introverts and extroverts in a population, one set of nodes, labeled \\textit{introverts} ($I$), prefers fewer contacts (a lower degree) than the other, labeled \\textit{extroverts} ($E$). As a starting point, we consider an \\textit{extreme} case, in which an $I$ simply cuts one of its links at random when chosen for updating, while an $E$ adds a link to a random unconnected individual (node). The model has only two control"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0576","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"}