{"title":"基于网络的动力学模型:图拓扑统计描述的出现","authors":"Marco Nurisso, Matteo Raviola, Andrea Tosin","doi":"10.1017/s0956792524000020","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific classes of interactions a statistical description of the graph topology, given in terms of the degree distribution embedded in a Boltzmann-type kinetic equation, is sufficient to capture the collective trends of networked interacting systems. This proves the validity of a commonly accepted heuristic assumption in statistically structured graph models, namely that the so-called connectivity of the agents is the only relevant parameter to be retained in a statistical description of the graph topology. Then, we validate our results by testing them numerically against real social network data.","PeriodicalId":51046,"journal":{"name":"European Journal of Applied Mathematics","volume":"26 1","pages":""},"PeriodicalIF":2.3000,"publicationDate":"2024-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Network-based kinetic models: Emergence of a statistical description of the graph topology\",\"authors\":\"Marco Nurisso, Matteo Raviola, Andrea Tosin\",\"doi\":\"10.1017/s0956792524000020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific classes of interactions a statistical description of the graph topology, given in terms of the degree distribution embedded in a Boltzmann-type kinetic equation, is sufficient to capture the collective trends of networked interacting systems. This proves the validity of a commonly accepted heuristic assumption in statistically structured graph models, namely that the so-called connectivity of the agents is the only relevant parameter to be retained in a statistical description of the graph topology. Then, we validate our results by testing them numerically against real social network data.\",\"PeriodicalId\":51046,\"journal\":{\"name\":\"European Journal of Applied Mathematics\",\"volume\":\"26 1\",\"pages\":\"\"},\"PeriodicalIF\":2.3000,\"publicationDate\":\"2024-02-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Applied Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1017/s0956792524000020\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1017/s0956792524000020","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Network-based kinetic models: Emergence of a statistical description of the graph topology
In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific classes of interactions a statistical description of the graph topology, given in terms of the degree distribution embedded in a Boltzmann-type kinetic equation, is sufficient to capture the collective trends of networked interacting systems. This proves the validity of a commonly accepted heuristic assumption in statistically structured graph models, namely that the so-called connectivity of the agents is the only relevant parameter to be retained in a statistical description of the graph topology. Then, we validate our results by testing them numerically against real social network data.
期刊介绍:
Since 2008 EJAM surveys have been expanded to cover Applied and Industrial Mathematics. Coverage of the journal has been strengthened in probabilistic applications, while still focusing on those areas of applied mathematics inspired by real-world applications, and at the same time fostering the development of theoretical methods with a broad range of applicability. Survey papers contain reviews of emerging areas of mathematics, either in core areas or with relevance to users in industry and other disciplines. Research papers may be in any area of applied mathematics, with special emphasis on new mathematical ideas, relevant to modelling and analysis in modern science and technology, and the development of interesting mathematical methods of wide applicability.