Plans regarding generation of (general) random graphs.
More...
Go to the source code of this file.
Detailed Description
Plans regarding generation of (general) random graphs.
 Todo:
 Implementation

First we need an overview on the existing generators for random (general) graphs.

One general method is to construct a random adjacency matrix or a random incidence matrix.

In the Maxima graphsmodule we have:

random_bipartite_graph

random_digraph

random_regular_graph

random_graph

random_graph1

random_tournament (complete digraphs)

random_tree
It seems only (simple) graphs are generated.

In Sage:

RandomBarabasiAlbert

RandomDirectedGN

RandomDirectedGNC

RandomDirectedGNR

RandomGNM

RandomGNP

RandomHolmeKim

RandomLobster

RandomNewmanWattsStrogatz

RandomRegular

RandomShell

RandomTreePowerlaw
It seems only (simple) graphs are generated.
 Todo:
 Overview on theoretical possibilities

We need an overview on the models studied in the theory of random graphs.

We are especially interested in random multigraphs!

These could be obtained by taking the union of random graphs.

Again, the natural alternative is to consider random matrices.

Or one consider any given graph, and multiplies each edge in a random way.
Definition in file RandomGraphs.hpp.