In response to #115, I created a short notebook for recording the number of nodes n in a network and the processing time spent on a simple analysis.
Details
Workflow
Generate a (2^n,2^n) state-by-state TPM and its single binary state of n nodes
Run through there_and_back_again processing to avoid conditional dependence issue
As an example use case, substrate phi and big phi are calculated
Answer to #115
As is commented, the processing time on the analysis looks quadratic to n.
Since 6 nodes (2^6=64*64 state-by-state TPM) calculation takes around 2 hours and 8 nodes takes forever, I believe 6-7 nodes is the upper bound for the tractable analysis.
PR Summary
In response to #115, I created a short notebook for recording the number of nodes
nin a network and the processing time spent on a simple analysis.Details
Workflow
(2^n,2^n)state-by-state TPM and its single binary state ofnnodesAnswer to #115
As is commented, the processing time on the analysis looks quadratic to
n. Since 6 nodes (2^6=64*64 state-by-state TPM) calculation takes around 2 hours and 8 nodes takes forever, I believe 6-7 nodes is the upper bound for the tractable analysis.