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.
International audienceThe degree distributions of complex networks are usually considered to follow ...
Social network analysis offers an understanding of our modern world, and it affords the ability to r...
A conditionally Poissonian power-law random graph with infinite degree variance is considered as a r...
This book supports researchers who need to generate random networks, or who are interested in the th...
Complex networks is a recent area of research motivated by the empirical study of realworld networks...
Diffusion processes taking place in social networks are used to model a number of phenomena, such as...
Random networks are frequently generated, for example, to investigate the effects of model parameter...
When researching relationships between data entities, the most natural way of presenting them is by ...
A common goal in the network analysis community is the modeling of social network graphs, which tend...
This paper presents new methods for generation of random Bayesian networks. Such methods can be use...
A method for the reliable generation of random networks that model known social networks is becoming...
Because of the huge number of graphs possible even with a small number of nodes, inference on networ...
Recent work on social networks has tackled the measurement and optimization of these networks' robus...
We shortly review our theoretical analysis of genetic algorithms and provide some new results. The t...
The recent explosion in social network data has stimulated interest in probabilistic models of netwo...
International audienceThe degree distributions of complex networks are usually considered to follow ...
Social network analysis offers an understanding of our modern world, and it affords the ability to r...
A conditionally Poissonian power-law random graph with infinite degree variance is considered as a r...
This book supports researchers who need to generate random networks, or who are interested in the th...
Complex networks is a recent area of research motivated by the empirical study of realworld networks...
Diffusion processes taking place in social networks are used to model a number of phenomena, such as...
Random networks are frequently generated, for example, to investigate the effects of model parameter...
When researching relationships between data entities, the most natural way of presenting them is by ...
A common goal in the network analysis community is the modeling of social network graphs, which tend...
This paper presents new methods for generation of random Bayesian networks. Such methods can be use...
A method for the reliable generation of random networks that model known social networks is becoming...
Because of the huge number of graphs possible even with a small number of nodes, inference on networ...
Recent work on social networks has tackled the measurement and optimization of these networks' robus...
We shortly review our theoretical analysis of genetic algorithms and provide some new results. The t...
The recent explosion in social network data has stimulated interest in probabilistic models of netwo...
International audienceThe degree distributions of complex networks are usually considered to follow ...
Social network analysis offers an understanding of our modern world, and it affords the ability to r...
A conditionally Poissonian power-law random graph with infinite degree variance is considered as a r...