{"title":"随机竞赛中子图计数的渐近分布","authors":"Pontus Andersson","doi":"10.1002/(SICI)1098-2418(199810/12)13:3/4%3C249::AID-RSA4%3E3.0.CO;2-V","DOIUrl":null,"url":null,"abstract":"A random tournament T-n is obtained by independently orienting the edges of the complete graph on n vertices, with probability 1/2 far each direction. We study the asymptotic distribution, as n ten ...","PeriodicalId":303496,"journal":{"name":"Random Struct. Algorithms","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On the asymptotic distributions of subgraph counts in a random tournament\",\"authors\":\"Pontus Andersson\",\"doi\":\"10.1002/(SICI)1098-2418(199810/12)13:3/4%3C249::AID-RSA4%3E3.0.CO;2-V\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A random tournament T-n is obtained by independently orienting the edges of the complete graph on n vertices, with probability 1/2 far each direction. We study the asymptotic distribution, as n ten ...\",\"PeriodicalId\":303496,\"journal\":{\"name\":\"Random Struct. Algorithms\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Struct. Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/(SICI)1098-2418(199810/12)13:3/4%3C249::AID-RSA4%3E3.0.CO;2-V\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Struct. Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/(SICI)1098-2418(199810/12)13:3/4%3C249::AID-RSA4%3E3.0.CO;2-V","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the asymptotic distributions of subgraph counts in a random tournament
A random tournament T-n is obtained by independently orienting the edges of the complete graph on n vertices, with probability 1/2 far each direction. We study the asymptotic distribution, as n ten ...
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
