{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T17:23:47Z","timestamp":1719941027672},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T00:00:00Z","timestamp":1728086400000},"content-version":"am","delay-in-days":247,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1016\/j.ejc.2023.103859","type":"journal-article","created":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T11:39:37Z","timestamp":1696505977000},"page":"103859","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Graph sequences sampled from Robinson graphons"],"prefix":"10.1016","volume":"116","author":[{"given":"Mahya","family":"Ghandehari","sequence":"first","affiliation":[]},{"given":"Jeannette","family":"Janssen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2023.103859_b1","first-page":"1","article-title":"Community detection and stochastic block models: recent developments","volume":"18","author":"Abbe","year":"2017","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"10.1016\/j.ejc.2023.103859_b2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1080\/15427951.2012.687243","article-title":"Monotone graph limits and quasimonotone graphs","volume":"8","author":"Bollob\u00e1s","year":"2012","journal-title":"Internet Math."},{"issue":"7","key":"10.1016\/j.ejc.2023.103859_b3","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejc.2011.03.015","article-title":"Limits of randomly grown graph sequences","volume":"32","author":"Borgs","year":"2011","journal-title":"European J. Combin."},{"issue":"3","key":"10.1016\/j.ejc.2023.103859_b4","first-page":"1277","article-title":"A popularity-scaled latent space model for large-scale directed social network","volume":"29","author":"Chang","year":"2019","journal-title":"Statist. Sinica"},{"issue":"4","key":"10.1016\/j.ejc.2023.103859_b5","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s00453-009-9319-y","article-title":"Seriation in the presence of errors: a factor 16 approximation algorithm for l\u221e-fitting Robinson structures to distances","volume":"59","author":"Chepoi","year":"2011","journal-title":"Algorithmica"},{"key":"10.1016\/j.ejc.2023.103859_b6","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.jctb.2015.02.002","article-title":"Linear embeddings of graphs and graph limits","volume":"113","author":"Chuangpishit","year":"2015","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2023.103859_b7","series-title":"A Course in Functional Analysis","volume":"vol. 96","author":"Conway","year":"1990"},{"key":"10.1016\/j.ejc.2023.103859_b8","first-page":"2008","article-title":"Threshold graph limits and random threshold graphs","author":"Diaconis","year":"2009","journal-title":"Internet Math."},{"issue":"1","key":"10.1016\/j.ejc.2023.103859_b9","doi-asserted-by":"crossref","first-page":"623","DOI":"10.3150\/17-BEJ1000","article-title":"Optimal rates of statistical seriation","volume":"25","author":"Flammarion","year":"2019","journal-title":"Bernoulli"},{"key":"10.1016\/j.ejc.2023.103859_b10","article-title":"Spectral ranking using seriation","volume":"45","author":"Fogel","year":"2016","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"10.1016\/j.ejc.2023.103859_b11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s004930050052","article-title":"Quick approximation to matrices and applications","volume":"19","author":"Frieze","year":"1999","journal-title":"Combinatorica"},{"issue":"2","key":"10.1016\/j.ejc.2023.103859_b12","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1137\/18M1174544","article-title":"An optimization parameter for seriation of noisy data","volume":"33","author":"Ghandehari","year":"2019","journal-title":"SIAM J. Discrete Math."},{"issue":"460","key":"10.1016\/j.ejc.2023.103859_b13","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1198\/016214502388618906","article-title":"Latent space approaches to social network analysis","volume":"97","author":"Hoff","year":"2002","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/j.ejc.2023.103859_b14","article-title":"A structural characterization for certifying Robinsonian matrices","volume":"22","author":"Laurent","year":"2017","journal-title":"Electron. J. Combin."},{"issue":"2","key":"10.1016\/j.ejc.2023.103859_b15","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1002\/sam.10071","article-title":"Seriation and matrix reordering methods: An historical overview","volume":"3","author":"Liiv","year":"2010","journal-title":"Stat. Anal. Data Min."},{"key":"10.1016\/j.ejc.2023.103859_b16","series-title":"Large Networks and Graph Limits","author":"Lov\u00e1sz","year":"2012"},{"issue":"6","key":"10.1016\/j.ejc.2023.103859_b17","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1016\/j.jctb.2006.05.002","article-title":"Limits of dense graph sequences","volume":"96","author":"Lov\u00e1sz","year":"2006","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"10.1016\/j.ejc.2023.103859_b18","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s00357-014-9150-2","article-title":"An optimal algorithm to recognize Robinsonian dissimilarities","volume":"31","author":"Pr\u00e9a","year":"2014","journal-title":"J. Classif."},{"issue":"3","key":"10.1016\/j.ejc.2023.103859_b19","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1214\/19-STS702","article-title":"The geometry of continuous latent space models for network data","volume":"34","author":"Smith","year":"2019","journal-title":"Statist. Sci."},{"key":"10.1016\/j.ejc.2023.103859_b20","series-title":"Asymptopia","volume":"vol. 71","author":"Spencer","year":"2014"},{"key":"10.1016\/j.ejc.2023.103859_b21","series-title":"High-Dimensional Statistics","volume":"vol. 48","author":"Wainwright","year":"2019"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669823001774?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669823001774?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T22:21:23Z","timestamp":1701296483000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669823001774"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":21,"alternative-id":["S0195669823001774"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2023.103859","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2024,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Graph sequences sampled from Robinson graphons","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2023.103859","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"103859"}}