Generating random bigraphs with preferential attachment

02/18/2020
by   Dominik Grzelak, et al.
0

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 = 〈 F^P, F^L〉 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.

READ FULL TEXT
research
12/04/2021

Order in the chaos with examples from graph theory

In randomly created structures (be they natural or artificial) very ofte...
research
07/12/2018

Self-Assembly of 3-D Structures Using 2-D Folding Tiles

Self-assembly is a process which is ubiquitous in natural, especially bi...
research
06/07/2019

On Pattern Setups and Pattern Multistructures

Modern order and lattice theory provides convenient mathematical tools f...
research
06/29/2021

Generating the Graph Gestalt: Kernel-Regularized Graph Representation Learning

Recent work on graph generative models has made remarkable progress towa...
research
08/03/2020

On The Plurality of Graphs

We conduct a series of experiments designed to empirically demonstrate t...
research
06/22/2021

Graph coarsening: From scientific computing to machine learning

The general method of graph coarsening or graph reduction has been a rem...
research
06/28/2019

Variance reduction for effective energies of random lattices in the Thomas-Fermi-von Weizsäcker model

In the computation of the material properties of random alloys, the meth...

Please sign up or login with your details

Forgot password? Click here to reset