Networks

Generuoti tinklus iš Erdős-Rényi modelio.

Parinktys

• maxNumNodes | number: maksimalus tinklo mazgų, kuriuos galima pasirinkti, skaičius.. Default: 30.
• showEdgeChart | boolean: kontroliuoja, ar rodyti diagramą, kurioje būtų rodomas briaunų skaičius kiekviename sugeneruotame tinkle (iš naujo nustatomas, kai pakeičiamas mazgų skaičius).. Default: false.
• showTransitivities | boolean: ar skaičiuoti sugeneruotų tinklų tranzityvumą / visuotinius klasterizacijos koeficientus.. Default: false.

Pavyzdžiai

Tiesioginis redaktorius

<LearnNetworks />

<LearnNetworks />

Rezultatas

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):