The first and main weakness is the presentation. The authors do not define carefully the objects they study, and as a result it is not clear
what their mathematical statements mean. Just a few examples:
-- 138: 'Two-layer graphs establish the structural criteria; stars isolate the statistical value of each measurement, and multiroot families quantify the additional cost of graph geometry.'
What is a two-layer graph, a star, which multiroot families are meant, etc. ?
-- 145: 'Start with a two-layer graph containing every root-to-leaf edge'
Still not known what a two-layer graph is, what a root-to-leaf edge is, etc.
-- 156: 'For leaf pairs i < j ': leaf pairs of which graph ?
-- 180-181: 'On a three-leaf star, covariance ratios recover relative rates and T supplies their scale. But O(ϵ) root–leaf covariances give informative residuals of only O(ϵ2), against O(N^[-1//2}) noise'
What is T ? (the trace of A ?), ϵ,N ?
-- 189: Theorem 2: "For pair-root models with m ≥ 3 leaves, positive rates and diffusion, and nonzero specified edge"
What is a pair-root model ?
Perhaps by reading prior work on the use of SDEs to represent causal relationship some of these definitions could be decoded, but I do not think it is the job of the reader to do so.
Concerning related work: network identification has a long history in control theory and systems biology, with the underlying model often being a discrete-time version of the linear SDE mentioned in the paper. A few reference (very far from being an exhaustive list):
J. Gonçalves and S. Warnick, “Necessary and sufficient conditions
for dynamical structure reconstruction of LTI networks,” Automatic
Control, IEEE Transactions on, vol. 53, no. 7, pp. 1670–1674, 2008.
V. Chetty and S. Warnick, “Network semantics of dynamical systems,”
in 2015 54th IEEE Conference on Decision and Control (CDC).
IEEE, 2015, pp. 1557–1562.
Y. Yuan, K. Glover, and J. Gonçalves, “On minimal realisations of
dynamical structure functions,” Automatica, vol. 55, pp. 159–164,
2015.
Y. Yuan, G.-B. Stan, S. Warnick, and J. Gonçalves, “Robust dynamical
network structure reconstruction,” Automatica, vol. 47, no. 6, pp.
1230–1235, 2011, special Issue on Systems Biology.
T. Nordling and E. Jacobsen, “On Sparsity as a Criterion in Recon-
structing Biochemical Networks,” in 18th IFAC World Congress, 2011.
H. H. M. Weerts, P. M. J. Van den Hof, and A. G. Dankers,
“Identifiability of linear dynamic networks,” Automatica, vol. 89, pp.
247–258, 2018.
P. M. J. Van den Hof, A. Dankers, P. S. C. Heuberger, and X. Bombois,
“Identification of dynamic models in complex networks with predic-
tion error methods—basic methods for consistent module estimates,”
Automatica, vol. 49, no. 10, pp. 2994–3006, 2013.
M. Dimovska and D. Materassi, “Granger-causality meets causal
inference in graphical models: Learning networks via non-invasive
observations,” in IEEE 56th Annual Conference on Decision and
Control (CDC), 2017, pp. 5268–5273.
D. Materassi and M. V. Salapaka, “On the problem of reconstructing an
unknown topology via locality properties of the wiener filter,” IEEE
Transactions on Automatic Control, vol. 57, no. 7, pp. 1765–1777,
2012.
S. Shahrampour and V. M. Preciado, “Topology identification of
directed dynamical networks via power spectral analysis,” IEEE Trans-
actions on Automatic Control, vol. 60, no. 8, pp. 2260–2265, 2015.
M. Nabi-Abdolyousefi and M. Mesbahi, “Network identification via
node knockout,” IEEE Transactions on Automatic Control, vol. 57,
no. 12, pp. 3214–3219, 2012.
Kang, T., Moore, R., Li, Y., Sontag, E. D., & Bleris, L. (2015). "Discriminating direct and indirect connectivities in biological networks." Proceedings of the National Academy of Sciences (PNAS), 112(42), 12893-12898
Dasgupta, B., Vera-Licona, P., & Sontag, E. D. (2010). "Reverse engineering of molecular networks from a common combinatorial approach." In Algorithms in Computational Molecular Biology: Techniques, Approaches and Application'
All these references address a very similar problem.