网络演化的枚举方法

IF 0.9 4区数学 Q1 Mathematics

Miskolc Mathematical Notes Pub Date : 2023-01-01 DOI:10.18514/mmn.2023.4133

G. Bacsó, J. Túri

{"title":"网络演化的枚举方法","authors":"G. Bacsó, J. Túri","doi":"10.18514/mmn.2023.4133","DOIUrl":null,"url":null,"abstract":". A simple theoretical model of network evolution is discussed here. In each step, we add a new vertex to the graph and it is allowed to connect it to maximum degree vertices (hubs) only. Given a constant p , the probability of such a connection is p for any hub. The initial (non-random) graph G 1 is arbitrary but here we investigate mostly the case when G 1 has one vertex. We solve here some particular cases of the problem, using enumeration methods. We obtain not limit theorems but exact results for the parameters discussed.","PeriodicalId":49806,"journal":{"name":"Miskolc Mathematical Notes","volume":"1 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An enumeration approach to network evolution\",\"authors\":\"G. Bacsó, J. Túri\",\"doi\":\"10.18514/mmn.2023.4133\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". A simple theoretical model of network evolution is discussed here. In each step, we add a new vertex to the graph and it is allowed to connect it to maximum degree vertices (hubs) only. Given a constant p , the probability of such a connection is p for any hub. The initial (non-random) graph G 1 is arbitrary but here we investigate mostly the case when G 1 has one vertex. We solve here some particular cases of the problem, using enumeration methods. We obtain not limit theorems but exact results for the parameters discussed.\",\"PeriodicalId\":49806,\"journal\":{\"name\":\"Miskolc Mathematical Notes\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Miskolc Mathematical Notes\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.18514/mmn.2023.4133\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Miskolc Mathematical Notes","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.18514/mmn.2023.4133","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 0

摘要

．本文讨论了一个简单的网络演化理论模型。在每一步中，我们向图中添加一个新顶点，并且只允许将它连接到最大度顶点(枢纽)。给定一个常数p，对于任何集线器，这种连接的概率为p。初始(非随机)图g1是任意的，但这里我们主要研究g1只有一个顶点的情况。我们在这里用枚举方法来解决这个问题的一些特殊情况。对于所讨论的参数，我们得到的不是极限定理，而是精确的结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An enumeration approach to network evolution

. A simple theoretical model of network evolution is discussed here. In each step, we add a new vertex to the graph and it is allowed to connect it to maximum degree vertices (hubs) only. Given a constant p , the probability of such a connection is p for any hub. The initial (non-random) graph G 1 is arbitrary but here we investigate mostly the case when G 1 has one vertex. We solve here some particular cases of the problem, using enumeration methods. We obtain not limit theorems but exact results for the parameters discussed.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Miskolc Mathematical Notes Mathematics-Algebra and Number Theory

CiteScore

2.00

自引率

0.00%

发文量

期刊介绍： Miskolc Mathematical Notes, HU ISSN 1787-2405 (printed version), HU ISSN 1787-2413 (electronic version), is a peer-reviewed international mathematical journal aiming at the dissemination of results in many fields of pure and applied mathematics.