The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Duality between Time Series and Networks
Open accessAbstract
Studying the interaction between a system's components and the temporal evolution of the system are two common ways to uncover and characterize its internal workings. Recently, several maps from a time series to a network have been proposed with the intent of using network metrics to characterize time series. Although these maps demonstrate that different time series result in networks with distinct topological properties, it remains unclear how these topological properties relate to the original time series. Here, we propose a map from a time series to a network with an approximate inverse operation, making it possible to use network statistics to characterize time series and time series statistics to characterize networks. As a proof of concept, we generate an ensemble of time series ranging from periodic to random and confirm that application of the proposed map retains much of the information encoded in the original time series (or networks) after application of the map (or its inverse). Our results suggest that network analysis can be used to distinguish different dynamic regimes in time series and, perhaps more importantly, time series analysis can provide a powerful set of tools that augment the traditional network analysis toolkit to quantify networks in new and useful ways.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Deterministic Nonperiodic Flow
Lorenz, E. N. (1963) · Journal of the Atmospheric Sciences · doi:10.1175/1520-0469(1963)020<0130:dnf>2.0.co;2 · Cited by 19,398
Time Series Analysis: Forecasting and Control
Geurts, M., Box, G. E. P., & Jenkins, G. M. (1977) · Journal of Marketing Research · doi:10.2307/3150485 · Cited by 19,186
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Goldberger, A. L., Amaral, L. A. N., Glass, L., Hausdorff, J. M., Ivanov, P. C., Mark, R. G., Mietus, J. E., Moody, G. B., Peng, C.-K., & Stanley, H. E. (2000) · Circulation · doi:10.1161/01.cir.101.23.e215 · Cited by 14,809
Self-citationDetecting strange attractors in turbulence
Takens, F. (1981) · Lecture Notes in Mathematics · doi:10.1007/bfb0091924 · Cited by 10,459 · cited 1×
“This is in contrast to the maps proposed earlier, where the structures of the resulting networks are very sensitive to the choice of several parameters like time delay, embedding dimension and threshold distance; demanding expert guesses commonly used in techniques like phase-space reconstruction and recurrence analys…”
ResultTime Series Analysis Forecasting and Control.
Bartholomew, D. J., Box, G. E. P., & Jenkins, G. M. (1971) · Operational Research Quarterly (1970-1977) · doi:10.2307/3008255 · Cited by 6,716
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
Cited by
Gold volatility prediction using a CNN-LSTM approach
Vidal, A., & Kristjanpoller, W. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113481 · Cited by 272
Weighted visibility graph with complex network features in the detection of epilepsy
Supriya, S., Siuly, S., Wang, H., Cao, J., & Zhang, Y. (2016) · IEEE Access · doi:10.1109/access.2016.2612242 · Cited by 216
Metadata
- Authors
- Campanharo, A. S. L. O., Sirer, M. I., Malmgren, R. D., Ramos, F. M., & Amaral, L. A. N.
- Venue
- PLoS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2011-08-11
- Volume
- 6
- Issue
- 8
- Pages
- e23378
- ISSN
- 1932-6203 (ISSN-L)
- OpenAlex
- W2055026204
- Cited by
- 273
- References
- 41
- FWCI
- 34.62
- Type
- journal article
- Language
- en
- Open access
- gold
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: Duality between Time Series and Networks. https://app.cochat.ai/papers/10.1371/journal.pone.0023378
- The paper
- Campanharo, A. S. L. O., Sirer, M. I., Malmgren, R. D., Ramos, F. M., & Amaral, L. A. N. (2011). Duality between Time Series and Networks. PLoS ONE. https://doi.org/10.1371/journal.pone.0023378
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.