Fichier:ER model.svg
Taille de cet aperçu PNG pour ce fichier SVG : 799 × 201 pixels. Autres résolutions : 320 × 81 pixels | 640 × 161 pixels | 1 024 × 258 pixels | 1 280 × 322 pixels | 2 560 × 645 pixels | 1 704 × 429 pixels.
Fichier d’origine (Fichier SVG, nominalement de 1 704 × 429 pixels, taille : 714 octet)
Ce fichier et sa description proviennent de Wikimedia Commons.
Description
| Description |
English: This Erdős–Rényi model is generated with N=5 nodes. For each edge in the complete graph formed by all N nodes, a random number is generated and compared to a given probability. If the random number is greater than p, an edge is formed on the model. |
||
| Date | |||
| Source | Vectorized by me (GKFXtalk) from File:ER_model.png | ||
| Auteur | Jmcatania | ||
| Autorisation (Réutilisation de ce fichier) |
Moi, en tant que détenteur des droits d’auteur sur cette œuvre, je la publie sous les licences suivantes :    Ce fichier est disponible selon les termes de la licence Creative Commons Attribution – Partage dans les Mêmes Conditions 3.0 (non transposée).
Vous pouvez choisir l’une de ces licences. |
||
| Autres versions |
|
Historique du fichier
Cliquer sur une date et heure pour voir le fichier tel qu'il était à ce moment-là.
| Date et heure | Vignette | Dimensions | Utilisateur | Commentaire | |
|---|---|---|---|---|---|
| actuel | 20 décembre 2019 à 18:26 | | 1 704 × 429 (714 octet) | GKFX | {{Information |description ={{en|1=This Erdős–Rényi model is generated with N=5 nodes. For each edge in the complete graph formed by all N nodes, a random number is generated and compared to a given probability. If the random number is greater than p, an edge is formed on the model.}} |date =2011-12-12 |source =Vectorized by me (~~~) from File:ER_model.png |author =Jmcatania |permission ={{self|cc-by-sa-3.0|GFDL}} |other versions=<gallery>... |
Utilisation du fichier
La page suivante utilise ce fichier :
Usage global du fichier
Les autres wikis suivants utilisent ce fichier :
- Utilisation sur ca.wikipedia.org
- Utilisation sur en.wikipedia.org
- Talk:Game theory
- Talk:Genetic programming
- Talk:Operations research
- Talk:Mathematical optimization
- Talk:System dynamics
- Talk:Knapsack problem
- Talk:Linear programming
- Talk:Travelling salesman problem
- Talk:Little's law
- Talk:Template method pattern
- Talk:Monge array
- Talk:Queue area
- Talk:Simplex algorithm
- Talk:Cutting stock problem
- Talk:Sorting
- Talk:Nonlinear programming
- Talk:Decision model
- Talk:Logistics engineering
- Talk:Economic order quantity
- Talk:Stochastic programming
- Talk:Metaheuristic
- Talk:Plan
- Talk:Data envelopment analysis
- Talk:Jay Wright Forrester
- Talk:Guillermo Owen
- Category talk:Game theory
- Talk:Industrial engineering
- Talk:George Dantzig
- Talk:Analytics
- Talk:AMPL (programming language)
- Talk:Backtracking
- Talk:Decision analysis
- Talk:Farkas' lemma
- Talk:Jack Edmonds
- Talk:Methods engineering
- Talk:Leonid Kantorovich
- Talk:Management science
- Talk:Queueing theory
- Talk:WalkSAT
- Talk:Ariadne's thread (logic)
- Talk:Semidefinite programming
- Talk:Patrick Blackett
- Talk:Divide-and-conquer algorithm
- Talk:Charles F. Goodeve
- Talk:Archibald Hill
- Talk:The Research and Analysis Center
- Talk:Hugh Everett III
- Talk:Strategic Bombing Survey (Atomic attacks)
- Talk:MPS (format)
Voir davantage sur l’utilisation globale de ce fichier.
