Oliver Cooley, Wenjie Fang, N. Giudice, Mihyun Kang
{"title":"亚临界随机超图、高阶分量和超树","authors":"Oliver Cooley, Wenjie Fang, N. Giudice, Mihyun Kang","doi":"10.1137/1.9781611975505.12","DOIUrl":null,"url":null,"abstract":"One of the central topics in the theory of random graphs deals with the phase transition in the order of the largest components. In the binomial random graph $\\mathcal{G}(n,p)$, the threshold for t...","PeriodicalId":340112,"journal":{"name":"Workshop on Analytic Algorithmics and Combinatorics","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Subcritical random hypergraphs, high-order components, and hypertrees\",\"authors\":\"Oliver Cooley, Wenjie Fang, N. Giudice, Mihyun Kang\",\"doi\":\"10.1137/1.9781611975505.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the central topics in the theory of random graphs deals with the phase transition in the order of the largest components. In the binomial random graph $\\\\mathcal{G}(n,p)$, the threshold for t...\",\"PeriodicalId\":340112,\"journal\":{\"name\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/1.9781611975505.12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Analytic Algorithmics and Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/1.9781611975505.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Subcritical random hypergraphs, high-order components, and hypertrees
One of the central topics in the theory of random graphs deals with the phase transition in the order of the largest components. In the binomial random graph $\mathcal{G}(n,p)$, the threshold for t...
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
