{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/learning-the-mechanisms-of-network-growth","title":"Learning the mechanisms of network growth","arxiv_id":"2404.00793","date":"2024-03-31","proceeding":null,"authors":["Lourens Touwen","Doina Bucur","Remco van der Hofstad","Alessandro Garavaglia","Nelly Litvak"],"abstract":"We propose a novel model-selection method for dynamic networks. Our approach involves training a classifier on a large body of synthetic network data. The data is generated by simulating nine state-of-the-art random graph models for dynamic networks, with parameter range chosen to ensure exponential growth of the network size in time. We design a conceptually novel type of dynamic features that count new links received by a group of vertices in a particular time interval. The proposed features are easy to compute, analytically tractable, and interpretable. Our approach achieves a near-perfect classification of synthetic networks, exceeding the state-of-the-art by a large margin. Applying our classification method to real-world citation networks gives credibility to the claims in the literature that models with preferential attachment, fitness and aging fit real-world citation networks best, although sometimes, the predicted model does not involve vertex fitness.","url_abs":"https://arxiv.org/abs/2404.00793v3","url_pdf":"https://arxiv.org/pdf/2404.00793v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"learning-the-mechanisms-of-network-growth","repo_url":"https://github.com/LourensT/DynamicNetworkSimulation","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"model-selection","task_name":"Model Selection"}],"methods":[],"datasets_introduced":[{"slug":"synthetic-dynamic-networks","name":"Synthetic Dynamic Networks","full_name":"from Aging, Fitness Preferential Attachment mechanisms"}],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-classification-on-synthetic-dynamic","task":"Graph Classification","dataset":"Synthetic Dynamic Networks","model":"Time-cohort Dynamic Features + Static Features","rank_in_archive_order":1,"of":3,"metrics":{"Accuracy":"98.4"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-synthetic-dynamic","task":"Graph Classification","dataset":"Synthetic Dynamic Networks","model":"Size-cohort Dynamic Features + Static Features","rank_in_archive_order":2,"of":3,"metrics":{"Accuracy":"98.06"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-synthetic-dynamic","task":"Graph Classification","dataset":"Synthetic Dynamic Networks","model":"Static Features","rank_in_archive_order":3,"of":3,"metrics":{"Accuracy":"92.81%"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"LourensT/DynamicNetworkSimulation","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"5f8c33bb8209d139dbce259090fc288a167345044c3a09c9817c45cc6f339d42","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}