{"paper":{"title":"Growing Networks with Super-Joiners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"Ammerah Jabr-Hamdan, Daniel ben-Avraham, Jie Sun","submitted_at":"2014-05-27T19:11:15Z","abstract_excerpt":"We study the Krapivsky-Redner (KR) network growth model but where new nodes can connect to any number of existing nodes, $m$, picked from a power-law distribution $p(m)\\sim m^{-\\alpha}$. Each of the $m$ new connections is still carried out as in the KR model with probability redirection $r$ (corresponding to degree exponent $\\gamma_{\\rm KR}=1+1/r$, in the original KR model). The possibility to connect to any number of nodes resembles a more realistic type of growth in several settings, such as social networks, routers networks, and networks of citations. Here we focus on the in-, out-, and tot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7018","kind":"arxiv","version":2},"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"}