{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T11:56:18Z","timestamp":1766058978278,"version":"3.48.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T00:00:00Z","timestamp":1764806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000},"content-version":"vor","delay-in-days":14,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000265","name":"Medical Research Council","doi-asserted-by":"publisher","award":["MR\/W02974X\/1"],"award-info":[{"award-number":["MR\/W02974X\/1"]}],"id":[{"id":"10.13039\/501100000265","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000265","name":"Medical Research Council","doi-asserted-by":"publisher","award":["MR\/W02974X\/1"],"award-info":[{"award-number":["MR\/W02974X\/1"]}],"id":[{"id":"10.13039\/501100000265","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Hamill and Gilbert (J Artif Soc Soc Simul 12, 1\u201323, 2009) developed the Social Circles algorithm to generate synthetic networks that have properties of real social networks such as skewed degree distribution, positive clustering coefficient, degree assortativity and short path lengths. To assess the viability of Social Circles as a general network generator, we systematically examine the relationship between algorithm parameters and a broader range of structural properties of the generated networks. We varied social reaches for agents, distribution of social reaches in the population, and node density. We find that edge density and centrality measures can be controlled in a predictable way: longer reaches are associated with denser networks, shorter paths, lower degree assortativity (with some exceptions), and smaller variation in centrality measures. However, these network properties changed together and there is limited capacity to control properties separately. Further, clustering coefficient is insensitive to algorithm inputs. Thus, it cannot be used as a general network generator as it stands. If these properties are important, Social Circles could be used to generate starting networks with reasonable social structure, but further steps would be required to refine the structural properties.<\/jats:p>","DOI":"10.1007\/s41109-025-00744-5","type":"journal-article","created":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T14:16:43Z","timestamp":1764857803000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tunable network properties with Hamill and Gilbert\u2019s Social Circles generator"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7170-3067","authenticated-orcid":false,"given":"Cristina","family":"Chueca Del Cerro","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4171-3897","authenticated-orcid":false,"given":"Jennifer","family":"Badham","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,4]]},"reference":[{"key":"744_CR1","doi-asserted-by":"crossref","unstructured":"Almagor J, Picascia S (2020) Exploring the effectiveness of a Covid-19 contact tracing app using an agent-based model. Scientif Rep 10, pp.1\u201311","DOI":"10.1038\/s41598-020-79000-y"},{"issue":"2","key":"744_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1017\/nws.2013.10","volume":"1","author":"J Badham","year":"2013","unstructured":"Badham J (2013) Commentary: measuring the shape of degree distributions. Netw Sci 1(2):213\u2013225","journal-title":"Netw Sci"},{"key":"744_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tpb.2009.11.003","volume":"77","author":"J Badham","year":"2010","unstructured":"Badham J, Stocker R (2010) The impact of network clustering and assortativity on epidemic behaviour. Theor Popul Biol 77:71\u201375","journal-title":"Theor Popul Biol"},{"issue":"1","key":"744_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson J, Edelman A, Karpinski S et al (2017) Julia: a fresh approach to numerical computing. SIAM Rev 59(1):65\u201398. https:\/\/doi.org\/10.1137\/141000671","journal-title":"SIAM Rev"},{"key":"744_CR5","unstructured":"Gursoy F, Badur B (2019) A community-aware network growth model for synthetic social network generation. Proceedings of the 5th International Management Information Systems Conference (2018) pp pp. 1\u20138"},{"issue":"3","key":"744_CR6","first-page":"1","volume":"12","author":"L Hamill","year":"2009","unstructured":"Hamill L, Gilbert N (2009) Social circles: a simple structure for agent-based socialnetwork models. J Artif Soc Soc Simul 12(3):1\u201323","journal-title":"J Artif Soc Soc Simul"},{"key":"744_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevLett.89.208701","volume":"89","author":"M Newman","year":"2002","unstructured":"Newman M (2002) Assortative mixing in networks. Phys Rev Lett 89:1\u20134","journal-title":"Phys Rev Lett"},{"key":"744_CR8","doi-asserted-by":"crossref","unstructured":"Newman MEJ, Park J (2003) Why social networks are different from other types of networks. Phys Rev E 68(036122)","DOI":"10.1103\/PhysRevE.68.036122"},{"key":"744_CR9","unstructured":"R Core Team (2024) R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria, https:\/\/www.R-project.org\/"},{"issue":"1","key":"744_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1086\/211115","volume":"8","author":"G Simmel","year":"1902","unstructured":"Simmel G (1902) The number of members as determining the sociological form of the group i. Am J Sociol 8(1):1\u201346","journal-title":"Am J Sociol"},{"issue":"1","key":"744_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-017-0054-z","volume":"2","author":"CL Staudt","year":"2017","unstructured":"Staudt CL, Hamann M, Gutfraind A et al (2017) Generating realistic scaled complex networks. Appl Netw Sci 2(1):1\u201329","journal-title":"Appl Netw Sci"},{"issue":"2","key":"744_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1177\/1090198120901497","volume":"47","author":"T Valente","year":"2020","unstructured":"Valente T, Vega Yon G (2020) Diffusion\/contagion processes on social networks. Health Edu Behavior 47(2):235\u2013248","journal-title":"Health Edu Behavior"},{"key":"744_CR13","unstructured":"Wilensky U (1999) NetLogo http:\/\/ccl.northwestern.edu\/netlogo\/. Techical report, Center for connected learning and computer-based modeling, Northwestern University, Evanston, IL, http:\/\/ccl.northwestern.edu\/netlogo\/"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00744-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-025-00744-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00744-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T11:53:15Z","timestamp":1766058795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41109-025-00744-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,4]]},"references-count":13,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["744"],"URL":"https:\/\/doi.org\/10.1007\/s41109-025-00744-5","relation":{},"ISSN":["2364-8228"],"issn-type":[{"type":"electronic","value":"2364-8228"}],"subject":[],"published":{"date-parts":[[2025,12,4]]},"assertion":[{"value":"4 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"On behalf of all authors, there is no Conflict of interest.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"65"}}