public static class Graphs.Skewed extends Graphs
degree
and
many having low degree. It is an attempt at something like
(or including) a scale free, preferential attachment Model of Graphs.
The fully parameterised Model is Graphs.Skewed.M
.
For similar Models of Graphs, I can think of plausible ways to
calculate nlPr(G)
(as here), and ways to to generate
random
Graphs, but not to do both in ways
that exactly correspond.Modifier and Type | Class and Description |
---|---|
class |
Graphs.Skewed.M
The fully parameterised Model of Skewed Graphs.
|
Graphs.GERadaptive, Graphs.GERfixed, Graphs.IndependentEdges, Graphs.Motifs, Graphs.Skewed
UPModel.Est, UPModel.Transform
Function.Native.WithInverse
Function.Cts2Cts, Function.Cts2Cts2Cts, Function.CtsD2CtsD, Function.HasInverse, Function.Native, Function.Native2, Function.Native3
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
Constructor and Description |
---|
Skewed(Value dp)
Problem definition parameters
Graphs.gType , Graphs.upmV 〉 |
Modifier and Type | Method and Description |
---|---|
UPModel.Est |
estimator(Value ps)
Only
Graphs.M.mdlV is actually estimated. |
Graphs.Skewed.M |
sp2Model(double msg1,
double msg2,
Value sp)
Return a fully parameterised
Graphs.Skewed.M . |
Vector |
stats(boolean add,
Value ss0,
Value ss1)
Combine sufficient statisticses 'ss0' and 'ss1' additively
(add=true), or remove ss1 from ss0 (add=false).
|
Vector |
stats(Vector ds,
int lo,
int hi)
Sufficient statistics are elements [lo, hi)
of the data-set 'ds' itself.
|
public Skewed(Value dp)
Graphs.gType
, Graphs.upmV
〉public Vector stats(Vector ds, int lo, int hi)
public Vector stats(boolean add, Value ss0, Value ss1)
UPModel
stats(ds,lo,hi)
.public UPModel.Est estimator(Value ps)
Graphs.M.mdlV
is actually estimated.public Graphs.Skewed.M sp2Model(double msg1, double msg2, Value sp)
Graphs.Skewed.M
.