{"title":"面向平面递归树的子树大小轮廓","authors":"Michael Fuchs","doi":"10.1137/1.9781611973013.10","DOIUrl":null,"url":null,"abstract":"In this extended abstract, we outline how to derive limit theorems for the number of subtrees of size k on the fringe of random plane-oriented recursive trees. Our proofs are based on the method of moments, where a complex-analytic approach is used for constant k and an elementary approach for k which varies with n. Our approach is of some generality and can be applied to other simple classes of increasing trees as well.","PeriodicalId":340112,"journal":{"name":"Workshop on Analytic Algorithmics and Combinatorics","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"The Subtree Size Profile of Plane-oriented Recursive Trees\",\"authors\":\"Michael Fuchs\",\"doi\":\"10.1137/1.9781611973013.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this extended abstract, we outline how to derive limit theorems for the number of subtrees of size k on the fringe of random plane-oriented recursive trees. Our proofs are based on the method of moments, where a complex-analytic approach is used for constant k and an elementary approach for k which varies with n. Our approach is of some generality and can be applied to other simple classes of increasing trees as well.\",\"PeriodicalId\":340112,\"journal\":{\"name\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-01-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/1.9781611973013.10\",\"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.9781611973013.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Subtree Size Profile of Plane-oriented Recursive Trees
In this extended abstract, we outline how to derive limit theorems for the number of subtrees of size k on the fringe of random plane-oriented recursive trees. Our proofs are based on the method of moments, where a complex-analytic approach is used for constant k and an elementary approach for k which varies with n. Our approach is of some generality and can be applied to other simple classes of increasing trees as well.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
