Pāriet uz galveno saturu

Networks

Ģenerēt tīklus no Erdo-Renija modeļa.

Iespējas​

  • maxNumNodes | number: maksimālais mezglu skaits, ko var atlasīt tīklam.. Default: 30.
  • showEdgeChart | boolean: kontrolē, vai attēlot diagrammu, kurā tiek parādīts malu skaits katrā ģenerētajā tīklā (atiestatīts, kad mainās mezglu skaits).. Default: false.
  • showTransitivities | boolean: vai ģenerētajiem tīkliem aprēķināt tranzitivitātes / globālos klasterizācijas koeficientus.. Default: false.

Piemēri​

Tiešraides redaktors
Rezultāts

In a network, the nodes are assumed to be fixed but the edges are random, i.e. there is some random process which determines whether there is an edge connecting two nodes.

Let us consider one of the simplest available network models. In the Erdős–Rényi model, there is a fixed probability that an edge exists between any two nodes. We also assume that whether or not an edge exists between two nodes is independent of whether or not other edges exist.

In this model, if we have nodes, each node can be connected to other nodes. The number of edges attached to each node (the degree) is then .