{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T17:06:52Z","timestamp":1779988012309,"version":"3.53.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032271921","type":"print"},{"value":"9783032271938","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-27193-8_4","type":"book-chapter","created":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T16:58:43Z","timestamp":1779987523000},"page":"49-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Iterated Local Model for\u00a0Tournaments"],"prefix":"10.1007","author":[{"given":"Anthony","family":"Bonato","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"MacKenzie","family":"Carr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ketan","family":"Chaudhary","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Trent","family":"Marbach","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Teddy","family":"Mishura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,29]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs. Springer-Verlag, London Ltd, London (2009)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A., Albert, R.: Emergence of scaling in random networks. Science 286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.dam.2023.04.006","volume":"337","author":"N Behague","year":"2023","unstructured":"Behague, N., Bonato, A., Huggan, M., Malik, R., Marbach, T.: The iterated local transitivity model for hypergraphs. Discret. Appl. Math. 337, 106\u2013119 (2023)","journal-title":"Discret. Appl. Math."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jctb.2012.08.003","volume":"103","author":"E Berger","year":"2013","unstructured":"Berger, E., et al.: Tournaments and coloring. J. Comb. Theory, Ser. B 103, 1\u201320 (2013)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/rsa.1009","volume":"18","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B., Riordan, O., Spencer, J., Tusn\u00e1dy, G.: The degree sequence of a scale-free random graph process. Random Structures & Algorithms 18, 279\u2013290 (2001)","journal-title":"Random Structures & Algorithms"},{"key":"4_CR6","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/089","volume-title":"A Course on the Web Graph","author":"A Bonato","year":"2008","unstructured":"Bonato, A.: A Course on the Web Graph. American Mathematical Society, Providence, Rhode Island (2008)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Bonato, A., Chaudhary, K.: The iterated local transitivity model for tournaments. In: Proceedings of WAW\u201923 (2023)","DOI":"10.1007\/978-3-031-32296-9_12"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.dam.2020.04.018","volume":"284","author":"A Bonato","year":"2020","unstructured":"Bonato, A., Chuangpishit, H., English, S., Kay, B., Meger, E.: The iterated local model for social networks. Discret. Appl. Math. 284, 556\u2013571 (2020)","journal-title":"Discret. Appl. Math."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Bonato, A., Cranston, D.W., Huggan, M.A., Marbach, T., Mutharasan, R.: The iterated local directed transitivity model for social networks. In: Proceedings of WAW\u201920 (2020)","DOI":"10.1007\/978-3-030-48478-1_8"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Bonato, A., Cushman, R., Marbach, T., Zhang, Z.: The frustum network model based on clique extension. J. Comb. Optim. 47 (2024)","DOI":"10.1007\/s10878-024-01178-y"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1080\/15427951.2009.10390642","volume":"6","author":"A Bonato","year":"2011","unstructured":"Bonato, A., Hadi, N., Pralat, P., Wang, C.: Models of on-line social networks. Internet Math. 6, 285\u2013313 (2011)","journal-title":"Internet Math."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Bonato, A., Infeld, E., Pokhrel, H., Pralat, P.: Common adversaries form alliances: modelling complex networks via anti-transitivity. In: Proceedings of WAW\u201917 (2017)","DOI":"10.1007\/978-3-319-67810-8_2"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Bonato, A., Meger, E.: Iterated global models for complex networks. In: International Workshop on Algorithms and Models for the Web-Graph, pp. 135\u2013144 (2020)","DOI":"10.1007\/978-3-030-48478-1_10"},{"key":"4_CR14","doi-asserted-by":"publisher","DOI":"10.1090\/stml\/061","volume-title":"The Game of Cops and Robbers on Graphs","author":"A Bonato","year":"2011","unstructured":"Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence, Rhode Island (2011)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Bonato, A., Tian, A.: Complex networks and social networks. In: Kranakis, E. (ed.) Social Networks (2011)","DOI":"10.1007\/978-3-642-30904-5_12"},{"key":"4_CR16","unstructured":"Chaudhary, K.: The iterated local transitivity model for tournaments. Master\u2019s Thesis (2023)"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/jgt.3190150206","volume":"15","author":"FRK Chung","year":"1991","unstructured":"Chung, F.R.K., Graham, R.L.: Quasi-random tournaments. J. Graph Theory 15, 173\u2013198 (1991)","journal-title":"J. Graph Theory"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511761942"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Guha, R., Kumar, R., Raghavan, P., Tomkins, A.: Propagation of trust and distrust. In: Proceedings of the 13th International Conference on World Wide Web (2004)","DOI":"10.1145\/988672.988727"},{"key":"4_CR20","unstructured":"Halliday, F.: Cops, robbers and pre-calculus skills. Masters Thesis (2019)"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"103632","DOI":"10.1016\/j.ejc.2022.103632","volume":"108","author":"R Hancock","year":"2023","unstructured":"Hancock, R., et al.: No additional tournaments are quasirandom-forcing. Eur. J. Comb. 108, 103632 (2023)","journal-title":"Eur. J. Comb."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Heider, F.: The Psychology of Interpersonal Relations. Wiley (1958)","DOI":"10.1037\/10628-000"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (2010)","DOI":"10.1145\/1753326.1753532"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.dam.2023.08.015","volume":"341","author":"E Meger","year":"2023","unstructured":"Meger, E., Raz, A.: The iterative independent model. Discret. Appl. Math. 341, 242\u2013256 (2023)","journal-title":"Discret. Appl. Math."},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Privault, N.: Long-run behavior of markov chains. In: Understanding Markov Chains: Examples And Applications, pp. 163\u2013188. Springer, Singapore (2018). https:\/\/doi.org\/10.1007\/978-981-4451-51-2_8","DOI":"10.1007\/978-981-4451-51-2_8"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298, 824\u2013827 (2002)","journal-title":"Science"},{"key":"4_CR27","volume-title":"Social Network Analysis: A Handbook","author":"JP Scott","year":"2000","unstructured":"Scott, J.P.: Social Network Analysis: A Handbook. Sage Publications Ltd., London (2000)"},{"key":"4_CR28","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall (2001)"}],"container-title":["Lecture Notes in Computer Science","Modelling and Mining Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27193-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T16:58:46Z","timestamp":1779987526000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27193-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032271921","9783032271938"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27193-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"29 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Modelling and Mining Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waw2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/math.torontomu.ca\/waw2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}