{"paper":{"title":"Modeling interacting dynamic networks: I. Preferred degree networks and their characteristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"Beate Schmittmann, R. K. P. Zia, Shivakumar Jolad, Wenjia Liu","submitted_at":"2013-07-26T16:52:17Z","abstract_excerpt":"We study a simple model of dynamic networks, characterized by a set preferred degree, $\\kappa$. Each node with degree $k$ attempts to maintain its $\\kappa$ and will add (cut) a link with probability $w(k;\\kappa)$ ($1-w(k;\\kappa)$). As a starting point, we consider a homogeneous population, where each node has the same $\\kappa$, and examine several forms of $w(k;\\kappa)$, inspired by Fermi-Dirac functions. Using Monte Carlo simulations, we find the degree distribution in steady state. In contrast to the well-known Erd\\H{o}s-R\\'{e}nyi network, our degree distribution is not a Poisson distributio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7094","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"}