β campaign index Β· all candidates
6 novel Β· 1 crypto-prior Β· 0 excluded. Each row links its FOSS implementation + license + paper. Empirical orthogonality deferred.
| # | Candidate | FOSS implementation @ license | Paper Β· provenance | Coverage |
|---|---|---|---|---|
| #54 | hvg_mean_clustering_coefficient_barBuild the Horizontal Visibility Graph (HVG) of the bar's series (close, or the intra-bar mid-tick stream): each point is a node; nodes i,j connect iff |
CarlosBergillos/ts2vg MIT (ts2vg); BSD-3-Clause (network |
DOI:10.1103/PhysRevE.80.046103 git-anchor: absent @c803ef96e + @2d308f1c |
not-covered |
| #55 | hvg_degree_assortativity_coefficientBuild the HVG of the bar-close series (200-bar substrate); report the Pearson degree-degree assortativity coefficient r (correlation of degrees across |
CarlosBergillos/ts2vg MIT (ts2vg); BSD-3-Clause (network |
arXiv:1012.3850 git-anchor: absent @c803ef96e + @2d308f1c |
not-covered |
| #56 | hvg_tetradic_motif_profile_entropyThe occurrence-frequency vector of the six distinguishable 4-node (tetradic) motifs in the horizontal visibility graph of the bar series. Each motif e |
CarlosBergillos/ts2vg MIT (ts2vg); BSD-3-Clause (network |
arXiv:1811.03794 git-anchor: absent @c803ef96e + @2d308f1c |
not-covered |
| #57 | hvg_mean_shortest_path_lengthMean shortest-path length L of the HVG (average over all node pairs). For i.i.d. random series L scales as ~1.3*log(N)-1.7 (small-world); for high-Hur |
CarlosBergillos/ts2vg (+ networkx for nx.average_shortest_path_length) MIT / BSD-3-Clause |
arXiv:1002.4526 git-anchor: absent @c803ef96e + @2d308f1c |
not-covered |
| #58 | hvg_mean_degree_excessBuild the Horizontal Visibility Graph of the 200-bar close (or log-return) series; report the mean node degree <k> = 2*E/N. For any i.i.d. random seri |
CarlosBergillos/ts2vg MIT |
arXiv:1002.4526 git-anchor: absent @c803ef96e + @2d308f1c |
not-covered |
| #59 | hvg_forward_visibility_horizon_mean_barOn the directed HVG, the forward visibility horizon L+(t) at node t is the number of steps until the path first reaches/exceeds x_t (for tie-free seri |
CarlosBergillos/ts2vg MIT (ts2vg); reference statistic h |
arXiv:2512.02352 git-anchor: absent @c803ef96e + @2d308f1c |
crypto-prior |
| #60 | vg_time_directed_clustering_kldDonges/pyunicorn time-reversal asymmetry of the LOCAL CLUSTERING COEFFICIENT in the visibility graph: decompose each node's local clustering coefficie β distinct topological aspect vs iter-1 dhvg_indegree_outdegree_kld (clustering not degree) |
pik-copan/pyunicorn BSD-3-Clause |
arXiv:1507.01571 git-anchor: absent @c803ef96e + @2d308f1c |
not-covered |