Related papers: Generating random bigraphs with preferential attac…
Bigraphs are a versatile modelling formalism that allows easy expression of placement and connectivity relations in a graphical format. System evolution is user defined as a set of rewrite rules. This paper presents a practical, yet…
The purpose of this article is to introduce a new iterative algorithm with properties resembling real life bipartite graphs. The algorithm enables us to generate wide range of random bigraphs, which features are determined by a set of…
Preferential attachment lies at the heart of many network models aiming to replicate features of real world networks. To simulate the attachment process, conduct statistical tests, or obtain input data for benchmarks, efficient algorithms…
We propose and study a hierarchical algorithm to generate graphs having a predetermined distribution of cliques, the fully connected subgraphs. The construction mechanism may be either random or incorporate preferential attachment. We…
In order to better understand dynamical functions on amounts of natural and man-made complex systems, lots of researchers from a wide range of disciplines, covering statistic physics, mathematics, theoretical computer science, and so on,…
Numerous works have been proposed to generate random graphs preserving the same properties as real-life large scale networks. However, many real networks are better represented by hypergraphs. Few models for generating random hypergraphs…
Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…
Bigraphs are a universal computational modelling formalism for the spatial and temporal evolution of a system in which entities can be added and removed. We extend bigraphs to probablistic bigraphs, and then again to action bigraphs, which…
The random graph model has recently been extended to a random preferential attachment graph model, in order to enable the study of general asymptotic properties in network types that are better represented by the preferential attachment…
We consider the problem of sampling from a distribution on graphs, specifically when the distribution is defined by an evolving graph model, and consider the time, space and randomness complexities of such samplers. In the standard…
Paper proposes a model of large networks based on a random preferential attachment graph with addition of complete subgraphs (cliques). The proposed model refers to models of random graphs following the nonlinear preferential attachment…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
Process theories combine a graphical language for compositional reasoning with an underlying categorical semantics. They have been successfully applied to fields such as quantum computation, natural language processing, linear dynamical…
We claim that networks are created according to the priority attachment mechanism and we show a simple model which uses the priority attachment to generate both synthetic and close to empirical networks. Priority attachment is a mechanism…
We propose a wide class of preferential attachment models of random graphs, generalizing previous approaches. Graphs described by these models obey the power-law degree distribution, with the exponent that can be controlled in the models.…
Bilateral agreement based random undirected graphs were introduced and analyzed by La and Kabkab in 2015. The construction of the graph with $n$ vertices in this model uses a (random) preference order on other $n-1$ vertices and each vertex…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
A variation of the preferential attachment random graph model of Barab\'asi and Albert is defined that incorporates planted communities. The graph is built progressively, with new vertices attaching to the existing ones one-by-one. At every…
Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…
We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs…