WOLFRAM
Products
Wolfram|One
Mathematica
Wolfram Notebook Assistant + LLM Kit
Wolfram|Alpha Notebook Edition
System Modeler
All Products
Consulting & Solutions
Wolfram Consulting
Industry Solutions
Solutions for Education
Learning & Support
Wolfram U Courses
Wolfram Language Resources
Wolfram Community
Support FAQs
Contact Support
Company
About Wolfram
Careers
Events
Educational Programs
All Sites and Resources
Wolfram|Alpha
Wolfram Cloud
Your Account
Your Account
User Portal
Search
Close
Enable JavaScript to interact with content and submit forms on Wolfram websites.
Learn how
Legacy Documentation
Mathematica 8
(2010)
This is documentation for Mathematica 8, which was
based on an earlier version of Wolfram Language.
View current documentation (Version 14.3)
Mathematica
>
Mathematics and Algorithms
>
Graphs & Networks
>
Constructing Graphs
>
UniformGraphDistribution
>
Mathematica
>
Visualization and Graphics
>
Graphs & Networks
>
Constructing Graphs
>
UniformGraphDistribution
>
BUILT-IN MATHEMATICA SYMBOL
BernoulliGraphDistribution
BarabasiAlbertGraphDistribution
PriceGraphDistribution
DegreeGraphDistribution
WattsStrogatzGraphDistribution
BinomialDistribution
PoissonDistribution
SeedRandom
See Also »
|
Constructing Graphs
Summary of New Features in Mathematica 8
New in 8.0: Alphabetical Listing
New in 8.0: Mathematics & Algorithms
More About »
UniformGraphDistribution
UniformGraphDistribution
represents a uniform graph distribution on
n
-vertex,
m
-edge graphs.
The sample space is all simple graphs on
n
vertices and
m
edges.
UniformGraphDistribution
can be used with such functions as
RandomGraph
.
(3)
Generate a random undirected graph with 5 vertices and 6 edges:
Generate a random directed graph with 5 vertices and 6 edges:
Generate several graphs:
Generate a random undirected graph with 5 vertices and 6 edges:
Out[1]=
Generate a random directed graph with 5 vertices and 6 edges:
Out[1]=
Generate several graphs:
Out[1]=
(1)
Find the largest component fraction when the mean vertex degree is :
Average the result over 100 runs and plot it for different numbers of vertices:
(2)
A uniform graph can be generated by selecting
m
edges from the complete graph of size
n
:
The vertex degree for follows
BinomialDistribution
:
The mean and standard variance:
Compare data to distribution cases:
(2)
Random colored vertices:
BernoulliGraphDistribution
bullet
BarabasiAlbertGraphDistribution
bullet
PriceGraphDistribution
bullet
DegreeGraphDistribution
bullet
WattsStrogatzGraphDistribution
bullet
BinomialDistribution
bullet
PoissonDistribution
bullet
SeedRandom
Constructing Graphs
Summary of New Features in
Mathematica
8
New in 8.0: Alphabetical Listing
New in 8.0: Mathematics & Algorithms
New in 8
ja
zh
AltStyle
によって変換されたページ
(->オリジナル)
/
アドレス:
モード:
デフォルト
音声ブラウザ
ルビ付き
配色反転
文字拡大
モバイル