Generating random networks from a given distribution
Several variations are given for an algorithm that generates random networks approximately respecting the probabilities given by any likelihood function, such as from a p* social network model. A novel use of the genetic algorithm is incorporated in these methods, which improves its applicability to the degenerate distributions that can arise with p* models. Our approach includes a convenient way to find the high-probability items of an arbitrary network distribution function.
Year of publication: |
2008
|
---|---|
Authors: | Carter, Nathan ; Hadlock, Charles ; Haughton, Dominique |
Published in: |
Computational Statistics & Data Analysis. - Elsevier, ISSN 0167-9473. - Vol. 52.2008, 8, p. 3928-3938
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Multinational corporations and the transfer of environmental technology to developing countries
Hadlock, Charles Robert, (1994)
-
Optimizing management of emergency gas leaks : a case study in business analytics
Hadlock, Charles Robert, (2019)
-
The role of managerial incentives in bank acquisitions
Hadlock, Charles, (1999)
- More ...