{"title":"关于指数递归树中的受保护节点","authors":"M. Javanian, Rafik Aguech","doi":"10.46298/dmtcs.10524","DOIUrl":null,"url":null,"abstract":"The exponential recursive trees model several kinds of networks. At each step of growing of these trees, each node independently attracts a new node with probability p, or fails to do with probability 1 − p. Here, we investigate the number of protected nodes, total path length of protected nodes, and a mean study of the protected node profile of such trees.","PeriodicalId":412397,"journal":{"name":"Discrete Mathematics & Theoretical Computer Science","volume":" 7","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the protected nodes in exponential recursive trees\",\"authors\":\"M. Javanian, Rafik Aguech\",\"doi\":\"10.46298/dmtcs.10524\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The exponential recursive trees model several kinds of networks. At each step of growing of these trees, each node independently attracts a new node with probability p, or fails to do with probability 1 − p. Here, we investigate the number of protected nodes, total path length of protected nodes, and a mean study of the protected node profile of such trees.\",\"PeriodicalId\":412397,\"journal\":{\"name\":\"Discrete Mathematics & Theoretical Computer Science\",\"volume\":\" 7\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics & Theoretical Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46298/dmtcs.10524\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics & Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46298/dmtcs.10524","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
指数递归树是几种网络的模型。在这些树的每一步生长过程中，每个节点都会以概率 p 独立吸引一个新节点，或者以概率 1 - p 独立吸引一个新节点。在此，我们将研究受保护节点的数量、受保护节点的总路径长度以及此类树的受保护节点轮廓的平均值。
On the protected nodes in exponential recursive trees
The exponential recursive trees model several kinds of networks. At each step of growing of these trees, each node independently attracts a new node with probability p, or fails to do with probability 1 − p. Here, we investigate the number of protected nodes, total path length of protected nodes, and a mean study of the protected node profile of such trees.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
