Package jline.api.pfqn.nc

Class Pfqn_ncjd

java.lang.Object

jline.api.pfqn.nc.Pfqn_ncjd

public final class Pfqn_ncjd
extends Object

The two names denote the SAME routine because the balanced-fairness recursion Phi_i(0) = 1, mu_i(n) Phi_i(n) = sum_{r: n_r>0} v_{i,r} Phi_i(n - e_r) never inspects the structure of mu_i: it evaluates the handle at the full count vector n. Order independence (mu_i constant on each support) is a modelling restriction that buys insensitivity and a physical reading of Phi, not something the convolution uses, so any joint-dependent scaling eta_i(n) (sn.jdscaling) is admissible, with the proviso that the product form it induces is the balanced-fair one matched to that rate.

Use Pfqn_ncoi when the model is genuinely order independent and the name should say so, this class when the rate is a general joint dependence. Pfqn_clwjd is the transform route and is NOT merely a renaming: it needs the rate to saturate at a finite cutoff.

Method Summary

Modifier and Type	Method	Description
static Ret.pfqnOiNc	pfqn_ncjd(double[] Z, int[] N, List<ToDoubleFunction<int[]>> mu)
static Ret.pfqnOiNc	pfqn_ncjd(double[] Z, int[] N, List<ToDoubleFunction<int[]>> mu, double[][] visits)

Methods inherited from class java.lang.Object

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

Method Details

pfqn_ncjd

public static Ret.pfqnOiNc pfqn_ncjd(double[] Z,
 int[] N,
 List<ToDoubleFunction<int[]>> mu)

See Also:

• Pfqn_ncoi.pfqn_ncoi(double[], int[], List)

pfqn_ncjd

public static Ret.pfqnOiNc pfqn_ncjd(double[] Z,
 int[] N,
 List<ToDoubleFunction<int[]>> mu,
 double[][] visits)

See Also:

• Pfqn_ncoi.pfqn_ncoi(double[], int[], List, double[][])