EdgeList[g] gives a list of edges in the graph g

A graph may not be fully connected. For instance, only about 25% of the web graph is estimated to be in the largest strongly connected component. Another 25% is estimated to ...

Many algorithms and procedures require graphs with certain properties. These can be basic properties, such as being undirected, or deeper topology properties, such as being ...

Heavy tail means that there is a larger probability of getting very large values. So heavy tail distributions typically represent wild as opposed to mild randomness. An ...

Mathematica supports dynamic hierarchical namespace management, fully integrated into the Mathematica language. Mathematica's symbolic programming paradigm allows a unique ...

Directly integrated into the Mathematica language is a convenient symbolic options mechanism that allows arbitrary sequences of named parameters to be given to both built-in ...

Permutations are among the most basic elements of discrete mathematics. They can be used to represent discrete groups of transformations and in particular play a key role in ...

Urn models have a long history, starting with Laplace suggesting in 1786 that France's population be estimated by an urn-sampling scheme. They are conceptually relatively ...

The unified architecture of Mathematica is highly extensible, allowing you to connect to other systems and programs. Using the MathLink communication protocol, which operates ...

CreateDirectory["dir"] creates a directory with name dir. CreateDirectory[] creates a directory in the default area for temporary directories on your computer system.