mml

Class Graphs.IndependentEdges.M

java.lang.Object

la.la.Value

mml.Model

mml.UPModel.M

mml.Graphs.M

mml.Graphs.IndependentEdges.M

All Implemented Interfaces:

java.lang.Comparable<Value>

Direct Known Subclasses:

Graphs.GERadaptive.M, Graphs.GERfixed.M

Enclosing class:

Graphs.IndependentEdges

public abstract class Graphs.IndependentEdges.M
extends Graphs.M

The general abstract fully parameterised Graph Model having both explicit mdlV and mdlE. Graphs.GERfixed.M and Graphs.GERadaptive.M are useful special cases of M.

Nested Class Summary

Nested classes/interfaces inherited from class mml.Model

Model.Defaults, Model.Transform

Nested classes/interfaces inherited from class la.la.Value

Value.Atomic, Value.Bool, Value.Char, Value.Chars, Value.Cts, Value.Defer, Value.Discrete, Value.Enum, Value.Inc_Or, Value.Int, Value.Lambda, Value.List, Value.Maybe, Value.Option, Value.Real, Value.Scannable, Value.Structured, Value.Triv, Value.Tuple

Field Summary

Fields

Modifier and Type	Field and Description
protected Discretes.Bounded.M	mdlE The Model of Edge existence.

Fields inherited from class mml.Graphs.M

mdlV

Fields inherited from class mml.Model

msg1, msg2, sp

Fields inherited from class la.la.Value

C, comparator, CR, E, eight, ffalse, five, fiveR, four, fourR, half, negCR, negOne, negOneR, negTenR, nilVal, nine, None, one, oneR, PI, PIby2, point01, point1, point5, point9, quarter, seven, six, ten, tenR, three, threeR, triv, ttrue, two, twoR, zero, zeroR

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	M(double msg1, double msg2, Value sp) Constructor only for use by Graphs.GERfixed.M and the like.

Method Summary

Modifier and Type	Method and Description
Discretes.Bounded.M	mdlE() The fully parameterised Model of the existence of Edges.
double	nlPr(Value g) The negative log probability of a Graph datum 'g'; it costs (i) |V| and (ii) the adjacency matrix.
Graph	random() Generate a random (unlabelled) Graph, Directed or Undirected according to gType.

Methods inherited from class mml.Graphs.M

mdlV, nlLH

Methods inherited from class mml.UPModel.M

asGiven, asGiven, stats, stats, toString

Methods inherited from class mml.Model

asEstimator, asUPModel, m1m2sp, msg, msg1, msg1bits, msg2, msg2bits, msgBits, nl2LH, nl2Pr, pr, random, randomSeries, statParams, stats, stats, sumNlPr, transform, type, zeroTriv

Methods inherited from class la.la.Value

AoM, apply, bOp, compareTo, cons, cts, elt, errMsg, error, force, isTuple, just, main, n, nElts, nlAoM, pair, print, quad, real, RTE, triple, tuple, UOE, uOp, x

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

mdlE

protected Discretes.Bounded.M mdlE

The Model of Edge existence. Public face is mdlE(). Some constructor must set mdlE.

Constructor Detail

M

protected M(double msg1,
            double msg2,
            Value sp)

Constructor only for use by Graphs.GERfixed.M and the like.

Method Detail

mdlE

public Discretes.Bounded.M mdlE()

The fully parameterised Model of the existence of Edges. It embodies the edge density of Graphs. Also see Graphs.IndependentEdges.upmE().

nlPr

public double nlPr(Value g)

The negative log probability of a Graph datum 'g'; it costs (i) |V| and (ii) the adjacency matrix. Also see nlLH(ss).

Specified by:

nlPr in class Model

random

public Graph random()

Generate a random (unlabelled) Graph, Directed or Undirected according to gType. Choose |V|=Graphs.M.mdlV.random() then fill in the adjacency matrix at mdlE.random().

Overrides:

random in class Graphs.M