{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:15:06Z","timestamp":1753888506742,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79987-8_22","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"310-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Triangle Process on Regular Graphs"],"prefix":"10.1007","author":[{"given":"Colin","family":"Cooper","sequence":"first","affiliation":[]},{"given":"Martin","family":"Dyer","sequence":"additional","affiliation":[]},{"given":"Catherine","family":"Greenhill","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Allen-Zhu, Z., Bhaskara, A., Lattanzi, S., Mirrokni, V., Orecchia, L.: Expanders via local edge flips. In: Proceedings of 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), pp. 259\u2013269 (2018)","DOI":"10.1137\/1.9781611974331.ch19"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1002\/rsa.20949","volume":"57","author":"G Amanatidis","year":"2020","unstructured":"Amanatidis, G., Kleer, P.: Rapid mixing of the switch Markov chain for strongly stable degree sequences. Random Struct. Algorithms 57, 637\u2013657 (2020)","journal-title":"Random Struct. Algorithms"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1007\/s00453-009-9340-1","volume":"58","author":"M Bayati","year":"2010","unstructured":"Bayati, M., Kim, J.H., Saberi, A.: A sequential algorithm for generating random graphs. Algorithmica 58, 860\u2013910 (2010)","journal-title":"Algorithmica"},{"key":"22_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1017\/S0963548306007978","volume":"16","author":"C Cooper","year":"2007","unstructured":"Cooper, C., Dyer, M., Greenhill, C.: Sampling regular graphs and a peer-to-peer network. Comb. Probab. Comput. 16, 557\u2013593 (2007)","journal-title":"Comb. Probab. Comput."},{"key":"22_CR6","unstructured":"Cooper, C., Dyer, M., Greenhill, C.: Triangle-creation processes on cubic graphs, arXiv:1905.04490 (2019)"},{"key":"22_CR7","unstructured":"Cooper, C., Dyer, M., Greenhill, C.: A triangle process on regular graphs, arXiv: 2012.12972 (2020)"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.dam.2018.06.019","volume":"254","author":"C Cooper","year":"2019","unstructured":"Cooper, C., Dyer, M., Greenhill, C., Handley, A.: The flip Markov chain for connected regular graphs. Discret. Appl. Math. 254, 56\u201379 (2019)","journal-title":"Discret. Appl. Math."},{"key":"22_CR9","unstructured":"Erd\u0151s, P., Gallai, T.: Graphs with prescribed degree of vertices. Matematikai Lapok 11, 264\u2013274 (1960)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Feder, T., Guetz, A., Mihail, M., Saberi, A.: A local switch Markov chain on given degree graphs with application in connectivity of peer-to-peer networks. In: Proceedings of 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 69\u201376 (2006)","DOI":"10.1109\/FOCS.2006.5"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1137\/15M1052779","volume":"46","author":"P Gao","year":"2017","unstructured":"Gao, P., Wormald, N.: Uniform generation of random regular graphs. SIAM J. Comput. 46, 1395\u20131427 (2017)","journal-title":"SIAM J. Comput."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1353\/dem.0.0045","volume":"46","author":"SM Goodreau","year":"2009","unstructured":"Goodreau, S.M., Kitts, J.A., Morris, M.: Birds of a feather, or friend of a friend? Using exponential random graph models to investigate adolescent social networks. Demography 46, 103\u2013125 (2009)","journal-title":"Demography"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.11.010","volume":"719","author":"C Greenhill","year":"2018","unstructured":"Greenhill, C., Sfragara, M.: The switch Markov chain for sampling irregular graphs and digraphs. Theoret. Comput. Sci. 719, 1\u201320 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"046132","DOI":"10.1103\/PhysRevE.64.046132","volume":"64","author":"EM Jin","year":"2001","unstructured":"Jin, E.M., Girvan, M., Newman, M.E.J.: Structure of growing social networks. Phys. Rev. E 64, 046132 (2001)","journal-title":"Phys. Rev. E"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/(SICI)1098-2418(199907)14:4<293::AID-RSA1>3.0.CO;2-G","volume":"14","author":"R Kannan","year":"1999","unstructured":"Kannan, R., Tetali, P., Vempala, S.: Simple Markov chain algorithms for generating random bipartite graphs and tournaments. Random Struct. Algorithms 14, 293\u2013308 (1999)","journal-title":"Random Struct. Algorithms"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Lowcay, C., Marsland, S., McCartin, C.: Constrained switching in graphs: a constructive proof. In: 2013 International Conference on Signal-Image Technology and Internet-Based Systems, pp. 599\u2013604 (2013)","DOI":"10.1109\/SITIS.2013.98"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Mahlmann, P., Schindelhauer, C.: Peer-to-peer networks based on random transformations of connected regular undirected graphs. In: Proceedings of 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 155\u2013164 (2005)","DOI":"10.1145\/1073970.1073992"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Miklos, I., Erd\u0151s, P., Soukup, L.: Towards random uniform sampling of bipartite graphs with given degree sequence. Electron. J. Comb. 20, #P16 (2013)","DOI":"10.37236\/3028"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"52","DOI":"10.3390\/a11040052","volume":"11","author":"N Nishimura","year":"2018","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11, 52 (2018)","journal-title":"Algorithms"},{"key":"22_CR20","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/BFb0091828","volume-title":"Combinatorial Mathematics VIII","author":"R Taylor","year":"1981","unstructured":"Taylor, R.: Contrained switchings in graphs. In: McAvaney, K.L. (ed.) Combinatorial Mathematics VIII. LNM, vol. 884, pp. 314\u2013336. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/BFb0091828"},{"key":"22_CR21","unstructured":"Tikhomirov, K., Youssef, P.: Sharp Poincar\u00e9 and log-Sobolev inequalities for the switch chain on regular bipartite graphs, arXiv:2007.02729 (2020)"},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"3513","DOI":"10.1016\/j.dam.2008.03.033","volume":"156","author":"A Tripathi","year":"2008","unstructured":"Tripathi, A., Tyagi, H.: A simple criterion on degree sequences of graphs. Discret. Appl. Math. 156, 3513\u20133517 (2008)","journal-title":"Discret. Appl. Math."},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Tsuki, T.: Transformations of cubic graphs. J. Franklin Inst. 33(B).4, 565\u2013575 (1996)","DOI":"10.1016\/0016-0032(96)00015-4"},{"key":"22_CR24","volume-title":"Introduction to Graph Theory","author":"D West","year":"2000","unstructured":"West, D.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Hoboken (2000)","edition":"2"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Wormald, N.: Models of random regular graphs. In: Surveys in Combinatorics 1999. London Mathematical Society Lecture Notes Series, vol. 267, pp. 239\u2013298 (1999)","DOI":"10.1017\/CBO9780511721335.010"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:13:37Z","timestamp":1625008417000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, 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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"107","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The workshop was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}