Exploring the random genesis of co-occurrence networks
Using the network random generation models from Gustedt (2009) [23], we simulate and analyze several characteristics (such as the number of components, the degree distribution and the clustering coefficient) of the generated networks. This is done for a variety of distributions (fixed value, Bernoulli, Poisson, binomial) that are used to control the parameters of the generation process. These parameters are in particular the size of newly appearing sets of objects, the number of contexts in which new elements appear initially, the number of objects that are shared with ‘parent’ contexts, and, the time period inside which a context may serve as a parent context (aging). The results show that these models allow to fine-tune the generation process such that the graphs adopt properties as can be found in real world graphs.
Year of publication: |
2011
|
---|---|
Authors: | Gustedt, Jens ; Raghavan, Hari K. ; Schimit, Pedro |
Published in: |
Physica A: Statistical Mechanics and its Applications. - Elsevier, ISSN 0378-4371. - Vol. 390.2011, 9, p. 1516-1528
|
Publisher: |
Elsevier |
Subject: | Random generation | Clustering coefficient | Graph | Network |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Piepenbrink, Anke, (2013)
-
Networks in amino acids based on mutation
Akhtar, Adil, (2015)
-
Clusters of social impact firms : a complex network approach
Biasin, Massimo, (2022)
- More ...