Networks

Generování sítí z Erdős-Rényiho modelu.

Možnosti

• maxNumNodes | number: maximální počet uzlů, které lze pro síť vybrat.. Default: 30.
• showEdgeChart | boolean: řídí, zda se má zobrazit graf s počtem hran v každé generované síti (resetuje se při změně počtu uzlů).. Default: false.
• showTransitivities | boolean: zda sčítat tranzitivity / globální koeficienty shlukování pro generované sítě.. Default: false.

Příklady

Živý editor

<LearnNetworks />

<LearnNetworks />

Výsledek

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 .

m (number of Nodes):

p (probability of an edge between two nodes):