{"title":"仁慈模型的限制行为","authors":"Nicolas Lanchier , Max Mercer","doi":"10.1016/j.spl.2024.110205","DOIUrl":null,"url":null,"abstract":"<div><p>This paper is concerned with a stochastic model for the spread of kindness across a social network. Individuals are located on the vertices of a general finite connected graph, and are characterized by their kindness belief. Each individual, say <span><math><mi>x</mi></math></span>, interacts with each of its neighbors, say <span><math><mi>y</mi></math></span>, at rate one. The interactions can be kind or unkind, with kind interactions being more likely when the kindness belief of the sender <span><math><mi>x</mi></math></span> is high. In addition, kind interactions increase the kindness belief of the recipient <span><math><mi>y</mi></math></span>, whereas unkind interactions decrease its kindness belief. The system also depends on two parameters modeling the impact of kind and unkind interactions, respectively. We prove that, when kind interactions have a larger impact than unkind interactions, the system converges to the purely kind configuration with probability tending to one exponentially fast in the large population limit.</p></div>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Limiting behavior of a kindness model\",\"authors\":\"Nicolas Lanchier , Max Mercer\",\"doi\":\"10.1016/j.spl.2024.110205\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper is concerned with a stochastic model for the spread of kindness across a social network. Individuals are located on the vertices of a general finite connected graph, and are characterized by their kindness belief. Each individual, say <span><math><mi>x</mi></math></span>, interacts with each of its neighbors, say <span><math><mi>y</mi></math></span>, at rate one. The interactions can be kind or unkind, with kind interactions being more likely when the kindness belief of the sender <span><math><mi>x</mi></math></span> is high. In addition, kind interactions increase the kindness belief of the recipient <span><math><mi>y</mi></math></span>, whereas unkind interactions decrease its kindness belief. The system also depends on two parameters modeling the impact of kind and unkind interactions, respectively. We prove that, when kind interactions have a larger impact than unkind interactions, the system converges to the purely kind configuration with probability tending to one exponentially fast in the large population limit.</p></div>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167715224001743\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167715224001743","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
本文关注的是一个关于善良在社交网络中传播的随机模型。个体位于一般有限连通图的顶点上,以其善良信念为特征。每个个体,比如 x,都会与其每个邻居(比如 y)进行互动,互动率为 1。互动可以是善意的,也可以是不善意的,当发送者 x 的善意信念高时,善意互动的可能性更大。此外,善意的互动会增加接收者 y 的善意信念,而不善意的互动则会降低其善意信念。该系统还依赖于两个参数,分别模拟善意互动和不善意互动的影响。我们证明,当善意互动的影响大于非善意互动时,系统会收敛到纯粹的善意配置,其概率在大群体极限中以指数速度趋向于1。
This paper is concerned with a stochastic model for the spread of kindness across a social network. Individuals are located on the vertices of a general finite connected graph, and are characterized by their kindness belief. Each individual, say , interacts with each of its neighbors, say , at rate one. The interactions can be kind or unkind, with kind interactions being more likely when the kindness belief of the sender is high. In addition, kind interactions increase the kindness belief of the recipient , whereas unkind interactions decrease its kindness belief. The system also depends on two parameters modeling the impact of kind and unkind interactions, respectively. We prove that, when kind interactions have a larger impact than unkind interactions, the system converges to the purely kind configuration with probability tending to one exponentially fast in the large population limit.