当前位置: X-MOL 学术arXiv.cs.DM › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Generating random bigraphs with preferential attachment
arXiv - CS - Discrete Mathematics Pub Date : 2020-02-18 , DOI: arxiv-2002.07448
Dominik Grzelak (1 and 2), Barbara Priwitzer (3) and Uwe A{\ss}mann (1 and 2) ((1) Software Technology Group at Technische Universit\"at Dresden, (2) Centre for Tactile Internet with Human-in-the-Loop (CeTI) at Technische Universit\"at Dresden, (3) Fakult\"at Technik at Hochschule Reutlingen)

The bigraph theory is a relatively young, yet formally rigorous, mathematical framework encompassing Robin Milner's previous work on process calculi, on the one hand, and provides a generic meta-model for complex systems such as multi-agent systems, on the other. A bigraph $F = \langle F^P, F^L\rangle$ is a superposition of two independent graph structures comprising a place graph $F^P$ (i.e., a forest) and a link graph $F^L$ (i.e., a hypergraph), sharing the same node set, to express locality and communication of processes independently from each other. In this paper, we take some preparatory steps towards an algorithm for generating random bigraphs with preferential attachment feature w.r.t. $F^P$ and assortative (disassortative) linkage pattern w.r.t. $F^L$. We employ parameters allowing one to fine-tune the characteristics of the generated bigraph structures. To study the pattern formation properties of our algorithmic model, we analyze several metrics from graph theory based on artificially created bigraphs under different configurations. Bigraphs provide a quite useful and expressive semantic for process calculi for mobile and global ubiquitous computing. So far, this subject has not received attention in the bigraph-related scientific literature. However, artificial models may be particularly useful for simulation and evaluation of real-world applications in ubiquitous systems necessitating random structures.

中文翻译:

生成具有优先附件的随机双图

双图理论是一个相对年轻但形式严谨的数学框架,一方面包含了 Robin Milner 之前在过程演算方面的工作,另一方面为复杂系统(如多智能体系统)提供了通用元模型。双图$F = \langle F^P, F^L\rangle$ 是两个独立图结构的叠加,包括位置图$F^P$(即森林)和链接图$F^L$(即超图),共享相同的节点集,以相互独立地表达进程的局部性和通信。在本文中,我们采取了一些准备步骤,用于生成具有优先附件特征 wrt $F^P$ 和同种(非同种)链接模式 wrt $F^L$ 的随机双图的算法。我们采用允许微调生成的双图结构特征的参数。为了研究我们算法模型的模式形成特性,我们分析了基于不同配置下人工创建的双图的图论中的几个指标。双图为移动和全球普适计算的过程演算提供了非常有用和富有表现力的语义。到目前为止,这个主题在与bigraph相关的科学文献中还没有受到关注。然而,人工模型对于在需要随机结构的无处不在的系统中模拟和评估现实世界的应用可能特别有用。我们分析了基于不同配置下人工创建的双图的图论中的几个指标。双图为移动和全球普适计算的过程演算提供了非常有用和富有表现力的语义。到目前为止,这个主题在与bigraph相关的科学文献中还没有受到关注。然而,人工模型对于在需要随机结构的无处不在的系统中模拟和评估现实世界的应用可能特别有用。我们分析了基于不同配置下人工创建的双图的图论中的几个指标。双图为移动和全球普适计算的过程演算提供了非常有用和富有表现力的语义。到目前为止,这个主题在与bigraph相关的科学文献中还没有受到关注。然而,人工模型对于在需要随机结构的无处不在的系统中模拟和评估现实世界的应用可能特别有用。
更新日期:2020-02-19
down
wechat
bug