The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Reconstructing the topology of sparsely connected dynamical networks
Abstract
Given a general physical network and measurements of node dynamics, methods are proposed for reconstructing the network topology. We focus on networks whose connections are sparse and where data are limited. Under these conditions, common in many biological networks, constrained optimization techniques based on the L1 vector norm are found to be superior for inference of the network connections.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Sauer, T., Yorke, J. A., & Casdagli, M. (1991) · Journal of Statistical Physics · doi:10.1007/bf01053745 · Cited by 2,045
Self-citationInferring Genetic Networks and Identifying Compound Mode of Action via Expression Profiling
Gardner, T. S., di Bernardo, D., Lorenz, D., & Collins, J. J. (2003) · Science · doi:10.1126/science.1081900 · Cited by 1,117
Cited by
Data based identification and prediction of nonlinear and complex dynamical systems
Wang, W.-X., Lai, Y.-C., & Grebogi, C. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.004 · Cited by 299
Metadata
- Authors
- Napoletani, D., & Sauer, T. D.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2008-02-08
- Volume
- 77
- Issue
- 2
- Pages
- 026103-026103
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2081647150
- Cited by
- 166
- References
- 2
- FWCI
- 7.07
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Reconstructing the topology of sparsely connected dynamical networks. https://app.cochat.ai/papers/10.1103/physreve.77.026103
- The paper
- Napoletani, D., & Sauer, T. D. (2008). Reconstructing the topology of sparsely connected dynamical networks. Physical Review E. https://doi.org/10.1103/physreve.77.026103
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
