arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.04388math.PR
收藏

社交网络测度值过程的Weak convergence

Weak convergence of a measure-valued process for social networks

Khader Khadraoui, Ahmed Sid-Ali

摘要:

本文将社交网络建模问题形式化为随机几何图上的相互作用粒子系统。图的每个顶点都与潜在空间中的几何位置相关联,该潜在空间描述了网络成员之间未观察到的亲和力,并表征了它们之间相互作用的强度。我们赋予系统两个招聘机制,依赖于潜在空间中的粒子的位置和一个独立的潜在位置的离开机制。我们的特点是每个空间位置的狄拉克措施和系统状态的一个测量值的过程,这是所有狄拉克质量的总和。因此,我们研究了系统的大尺度行为。特别是,使用重整化技术,我们研究系统的行为时,初始粒子数趋于无穷大。因此,我们证明了弱收敛的重新标度的测度值过程对确定性积分微分方程的解决方案。最后,我们提出了一些不同的参数设置的Monte Carlo模拟,以说明我们的方法在模拟现实世界中遇到的一些现象的优点网络。

英文摘要:

This article formalizes the problem of modeling social networks into an interacting particle system on random geometric graphs. Each vertex of the graph is associated with a geometric position in a latent space describing the unobserved affinity between the network members and characterizes the strength of the interaction between them. We endow the system with two recruitment mechanisms that depend on the positions of the particles in the latent space and one departure mechanism independent of the latent position. We characterize each spatial position by a Dirac measure and the system state by a measure-valued process which is the sum of all Dirac masses. Therefore, we investigate the large-scale behavior of the system. In particular, using a renormalization technique, we study the system's behavior when the initial number of particles goes to infinity. We thus show the weak convergence of the rescaled measure-valued process towards the solution of a deterministic integrodifferential equation. Finally, we present some Monte Carlo simulations with different parameter sets to illustrate the merit of our approach in modeling some phenomena encountered in real-world networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑