Some synthetic data that sits in Spark.
Some synthetic data that sits in Spark.
No description available.
Returns a chain graph of the given size with Long ID type.
Returns a chain graph of the given size with Long ID type. The vertex IDs are 0, 1, ..., n-1, and the edges are (0, 1), (1, 2), ...., (n-2, n-1).
Returns an empty GraphFrame of the given ID type.
Graph of friends in a social network.
Version of gridIsingModel
with vStd, eStd set to 1.0.
This method generates a grid Ising model with random parameters.
This method generates a grid Ising model with random parameters.
Ising models are probabilistic graphical models over binary variables x_{i}. Each binary variable x_{i} corresponds to one vertex, and it may take values -1 or +1. The probability distribution P(X) (over all x_{i}) is parameterized by vertex factors a_{i} and edge factors b_{ij}:
P(X) = (1/Z) * exp[ \sum_i a_i x_i + \sum_{ij} b_{ij} x_i x_j ]
where Z is the normalization constant (partition function). See Wikipedia for more information on Ising models.
Each vertex is parameterized by a single scalar a_{i}. Each edge is parameterized by a single scalar b_{ij}.
Length of one side of the grid. The grid will be of size n x n.
Standard deviation of normal distribution used to generate vertex factors "a". Default of 1.0.
Standard deviation of normal distribution used to generate edge factors "b". Default of 1.0.
GraphFrame. Vertices have columns "id" and "a". Edges have columns "src", "dst", and "b". Edges are directed, but they should be treated as undirected in any algorithms run on this model. Vertex IDs are of the form "i,j". E.g., vertex "1,3" is in the second row and fourth column of the grid.
Returns a star graph with Long ID type, consisting of a central element indexed 0 (the root) and the n other leaf vertices 1, 2, ..., n.
Returns a star graph with Long ID type, consisting of a central element indexed 0 (the root) and the n other leaf vertices 1, 2, ..., n.
the number of leaves
Two densely connected blobs (vertices 0->n-1 and n->2n-1) connected by a single edge (0->n)
Two densely connected blobs (vertices 0->n-1 and n->2n-1) connected by a single edge (0->n)
the size of each blob.