乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T05:22:20Z","timestamp":1731993740466,"version":"3.28.0"},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"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":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1016\/j.dam.2024.04.025","type":"journal-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T23:29:35Z","timestamp":1715210975000},"page":"46-56","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Second-order moments of the size of randomly induced subgraphs of given order"],"prefix":"10.1016","volume":"355","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-6089-1333","authenticated-orcid":false,"given":"Nicola","family":"Apollonio","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.dam.2024.04.025_b1","first-page":"43","article-title":"The graphs with all induced subgraphs isomorphic","volume":"2","author":"Akiyama","year":"1979","journal-title":"Bull. Malaysian Math. Soc."},{"key":"10.1016\/j.dam.2024.04.025_b2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1002\/jgt.10117","article-title":"Induced subgraphs of prescribed size","volume":"43","author":"Alon","year":"2003","journal-title":"J. Graph Theory"},{"issue":"6","key":"10.1016\/j.dam.2024.04.025_b3","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1016\/j.dam.2012.10.001","article-title":"A new lower bound on the independence number of graphs","volume":"161","author":"Angel","year":"2013","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2024.04.025_b4","doi-asserted-by":"crossref","first-page":"btac763","DOI":"10.1093\/bioinformatics\/btac763","article-title":"Evaluating homophily in networks via HONTO (HOmophily Network TOol): a case study of chromosomal interactions in human PPI networks","volume":"39","author":"Apollonio","year":"2023","journal-title":"Bioinformatics"},{"key":"10.1016\/j.dam.2024.04.025_b5","doi-asserted-by":"crossref","first-page":"9757","DOI":"10.1038\/s41598-022-12710-7","article-title":"A novel method for assessing and measuring homophily in networks through second-order statistics","volume":"12","author":"Apollonio","year":"2022","journal-title":"Sci. Rep."},{"issue":"1","key":"10.1016\/j.dam.2024.04.025_b6","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/05064357X","article-title":"Graphs having small number of sizes on induced k-subgraphs","volume":"21","author":"Axenovich","year":"2007","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"10.1016\/j.dam.2024.04.025_b7","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1137\/1016082","article-title":"Asymptotic methods in enumeration","volume":"16","author":"Bender","year":"1974","journal-title":"SIAM Rev."},{"issue":"4","key":"10.1016\/j.dam.2024.04.025_b8","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1080\/00029890.2000.12005203","article-title":"A better bound on the variance","volume":"107","author":"Bhatia","year":"2000","journal-title":"Amer. Math. Monthly (Math. Assoc. America)"},{"key":"10.1016\/j.dam.2024.04.025_b9","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1287\/moor.14.2.317","article-title":"Closed form two-sided bounds for probabilities that exactly r and at least r out of n events occur","volume":"14","author":"Boros","year":"1989","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.dam.2024.04.025_b10","first-page":"105","article-title":"Induced subgraphs with the same order and size","volume":"33","author":"Bos\u00e1k","year":"1983","journal-title":"Math. Slovaca"},{"key":"10.1016\/j.dam.2024.04.025_b11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1017\/S0963548300000146","article-title":"On subgraph sizes in random graphs","volume":"1","author":"Calkin","year":"1992","journal-title":"Combin. Probab. Comput."},{"issue":"1","key":"10.1016\/j.dam.2024.04.025_b12","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1090\/S0002-9947-1952-0045327-5","article-title":"On the application of the Borel\u2013Cantelli lemma","volume":"72","author":"Chung","year":"1952","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.dam.2024.04.025_b13","doi-asserted-by":"crossref","first-page":"230","DOI":"10.2307\/2371834","article-title":"The asymptotic number of Latin rectangles","volume":"68","author":"Erd\u0151s","year":"1946","journal-title":"Amer. J. Math."},{"issue":"3","key":"10.1016\/j.dam.2024.04.025_b14","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/s004530010050","article-title":"The dense k-subgraph problem","volume":"29","author":"Feige","year":"2001","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/j.dam.2024.04.025_b15","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1111\/j.1751-5823.2011.00174.x","article-title":"Gumbels\u2019s identity, binomial moments, and Bonferroni sums","volume":"80","author":"Hoppe","year":"2012","journal-title":"Int. Stat. Rev."},{"issue":"4","key":"10.1016\/j.dam.2024.04.025_b16","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1137\/S0097539705447037","article-title":"Ruling out PTAS for graph min-bisection, dense k-subgraph, and bipartite clique","volume":"36","author":"Khot","year":"2006","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2024.04.025_b17","series-title":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","first-page":"692","article-title":"On choosing a dense subgraph","author":"Kortsarz","year":"1993"},{"issue":"3","key":"10.1016\/j.dam.2024.04.025_b18","first-page":"199","article-title":"Trees and forests with large and small independent indices","volume":"23","author":"Lin","year":"1995","journal-title":"Chin. J. Math."},{"key":"10.1016\/j.dam.2024.04.025_b19","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","article-title":"Maxima for graphs and a new proof of a theorem of Tur\u00e1n","volume":"17","author":"Motzkin","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/j.dam.2024.04.025_b20","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1090\/S0002-9904-1969-12393-1","article-title":"Asymptotics and random matrices with row-sum and column sum-restrictions","volume":"75","author":"O\u2019Neil","year":"1964","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/j.dam.2024.04.025_b21","doi-asserted-by":"crossref","first-page":"6932","DOI":"10.1007\/s10958-007-0517-3","article-title":"A generalization of the Chung-Erd\u0151s inequality for the probability of a union of events","volume":"147","author":"Petrov","year":"2007","journal-title":"J. Math. Sci."},{"issue":"8","key":"10.1016\/j.dam.2024.04.025_b22","doi-asserted-by":"crossref","first-page":"2703","DOI":"10.1016\/j.jspi.2006.02.015","article-title":"On lower bounds for tail probabilities","volume":"137","author":"Petrov","year":"2007","journal-title":"J. Statist. Plann. Inference"},{"issue":"1","key":"10.1016\/j.dam.2024.04.025_b23","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1080\/00150517.1982.12430021","article-title":"Fibonacci numbers of graphs","volume":"20","author":"Prodinger","year":"1982","journal-title":"Fibonacci Quart."},{"key":"10.1016\/j.dam.2024.04.025_b24","article-title":"Probabilistic methods in combinatorial analysis","volume":"vol. 56","author":"Sachov","year":"1997"},{"key":"10.1016\/j.dam.2024.04.025_b25","first-page":"267","article-title":"On graphs containing many subgraphs with the same number of edges","volume":"30","author":"\u0160ir\u00e1\u0148","year":"1980","journal-title":"Math. Slovaca"},{"issue":"1","key":"10.1016\/j.dam.2024.04.025_b26","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s00224-014-9568-2","article-title":"Approximating the sparsest k-subgraph in Chordal graphs","volume":"58","author":"Watrigant","year":"2016","journal-title":"Theory Comput. Syst."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X24001732?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X24001732?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T11:10:48Z","timestamp":1731928248000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X24001732"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":26,"alternative-id":["S0166218X24001732"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2024.04.025","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2024,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Second-order moments of the size of randomly induced subgraphs of given order","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2024.04.025","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}