File:ER model.svg
Appearance
Size of this PNG preview of this SVG file: 799 × 201 pixels. Other resolutions: 320 × 81 pixels | 640 × 161 pixels | 1,024 × 258 pixels | 1,280 × 322 pixels | 2,560 × 645 pixels | 1,704 × 429 pixels.
Original file (SVG file, nominally 1,704 × 429 pixels, file size: 714 bytes)
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 16:26, 20 December 2019 | 1,704 × 429 (714 bytes) | 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>... |
File usage
More than 100 pages use this file. The following list shows the first 100 pages that use this file only. A full list is available.
- Talk:AMPL (programming language)
- Talk:Alan Pritsker
- Talk:Alfred Blumstein
- Talk:Algorithm design
- Talk:Analytics
- Talk:Anna Nagurney
- Talk:Archibald Hill
- Talk:Ariadne's thread (logic)
- Talk:Arnold Allen (mathematician)
- Talk:Arthur D. Little
- Talk:Backtracking
- Talk:Bernard Koopman
- Talk:Bondareva–Shapley theorem
- Talk:COIN-OR
- Talk:Charles F. Goodeve
- Talk:Critical path method
- Talk:Cutting stock problem
- Talk:Dan Grimaldi
- Talk:Daniel Kleitman
- Talk:Data envelopment analysis
- Talk:David Luenberger
- Talk:David S. Alberts
- Talk:Decision analysis
- Talk:Decision model
- Talk:Distribution resource planning
- Talk:Divide-and-conquer algorithm
- Talk:Economic order quantity
- Talk:Event chain methodology
- Talk:Farkas' lemma
- Talk:Flow network
- Talk:Frederick W. Lanchester
- Talk:Game theory
- Talk:General algebraic modeling system
- Talk:Generalized assignment problem
- Talk:Genetic programming
- Talk:Geometric median
- Talk:George Dantzig
- Talk:George E. Kimball
- Talk:Guillermo Owen
- Talk:Hugh Everett III
- Talk:Industrial engineering
- Talk:Institute for Operations Research and the Management Sciences
- Talk:Inventory
- Talk:Jack Edmonds
- Talk:Jay Wright Forrester
- Talk:John Banzhaf
- Talk:John Sterman
- Talk:Knapsack problem
- Talk:Lagrangian relaxation
- Talk:Leonid Kantorovich
- Talk:Leonid Khachiyan
- Talk:Leverage-point modeling
- Talk:Linear programming
- Talk:Little's law
- Talk:Logistics engineering
- Talk:MPS (format)
- Talk:Management science
- Talk:Manufacturing process management
- Talk:Mathematical optimization
- Talk:Merrill M. Flood
- Talk:Metaheuristic
- Talk:Methods engineering
- Talk:Military logistics
- Talk:Monge array
- Talk:Multi-objective optimization
- Talk:Narendra Karmarkar
- Talk:Nelder–Mead method
- Talk:Newsvendor model
- Talk:Nonlinear programming
- Talk:Oleksandr Sharkovsky
- Talk:Operations research
- Talk:Patrick Blackett
- Talk:Paul Gray (information technology)
- Talk:Peter C. Fishburn
- Talk:Philip M. Morse
- Talk:Plan
- Talk:Queue area
- Talk:Queueing theory
- Talk:Richard M. Karp
- Talk:Russell L. Ackoff
- Talk:Semidefinite programming
- Talk:Seymour Melman
- Talk:Shadow price
- Talk:Simplex algorithm
- Talk:Sorting
- Talk:Stochastic programming
- Talk:Strategic Bombing Survey (Atomic attacks)
- Talk:Strong NP-completeness
- Talk:Stuart Dreyfus
- Talk:System dynamics
- Talk:Template method pattern
- Talk:The Research and Analysis Center
- Talk:Thomas L. Magnanti
- Talk:Travelling salesman problem
- Talk:Uncertainty quantification
- Talk:Vehicle routing problem
- Talk:Virtual queue
- Talk:WalkSAT
- Talk:William Gehrlein
- Category talk:Game theory
View more links to this file.
Global file usage
The following other wikis use this file:
- Usage on ca.wikipedia.org
- Usage on fa.wikipedia.org
- Usage on fr.wikipedia.org
- Usage on ja.wikipedia.org
- Usage on pt.wikipedia.org
- Usage on ru.wikipedia.org
- Usage on uk.wikipedia.org
- Usage on zh.wikipedia.org