Skip to Main content Skip to Navigation
Journal articles

Exploring the random genesis of co-occurrence graphs

Jens Gustedt 1 Hari K. Raghavan 2, 1 Pedro Schimit 1, 3 
1 ALGORILLE - Algorithms for the Grid
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Using the network random generation models from (Gustedt 2009), we simulate and analyze several characteristics (such as the number of components, the degree sequence 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 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 they can be found in real world graphs.
Complete list of metadata

Cited literature [36 references]  Display  Hide  Download
Contributor : Jens Gustedt Connect in order to contact the contributor
Submitted on : Monday, December 27, 2010 - 11:48:06 PM
Last modification on : Saturday, August 6, 2022 - 3:46:31 AM
Long-term archiving on: : Friday, December 2, 2016 - 9:14:36 PM


Files produced by the author(s)



Jens Gustedt, Hari K. Raghavan, Pedro Schimit. Exploring the random genesis of co-occurrence graphs. Physica A: Statistical Mechanics and its Applications, Elsevier, 2011, 390, pp.1516 - 1528. ⟨10.1016/j.physa.2010.12.036⟩. ⟨inria-00450684v2⟩



Record views


Files downloads