Bounds for covariance and correlation of incident arcs in uniformly random DAGs

From papers

Let G=(V,A)G=(V,A) be a directed acyclic graph, and consider two arcs incident on a common node. Incident-arc range conjecture. The covariance between the two arcs takes values in the interval [0.08,0.140625][0.08,0.140625] in modulus, while the correlation takes values in [0.125,0.28125][0.125,0.28125] in modulus. These ranges summarize values observed in complete enumerations for DAGs with three through seven nodes; their validity beyond the enumerated cases is not formally established.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Marco Scutari, “On the Prior and Posterior Distributions Used in Graphical Modelling”, arXiv:1201.4058 (2012).

Solutions 0

No solutions have been posted yet.