Peer Review History
| Original SubmissionMarch 2, 2026 |
|---|
|
PCSY-D-26-00033 DISTANCE BACKBONE SYNTHESIS OPTIMIZES SPREADING DYNAMICS AND CENTRALITY RANKS IN THE SPARSIFICATION OF COMPLEX NETWORKS PLOS Complex Systems Dear Dr. Xavier Costa, Thank you for submitting your manuscript to PLOS Complex Systems. After careful consideration, we feel that it has merit but does not fully meet PLOS Complex Systems's publication criteria as it currently stands. Therefore, we invite you to submit a revised version of the manuscript that addresses the points raised during the review process. Please submit your revised manuscript by May 22 2026 11:59PM. If you will need more time than this to complete your revisions, please reply to this message or contact the journal office at complexsystems@plos.org. When you're ready to submit your revision, log on to https://www.editorialmanager.com/pcsy/ and select the 'Submissions Needing Revision' folder to locate your manuscript file. Please include the following items when submitting your revised manuscript: * A letter that responds to each point raised by the editor and reviewer(s). You should upload this letter as a separate file labeled 'Response to Reviewers'. This file does not need to include responses to any formatting updates and technical items listed in the 'Journal Requirements' section below. * A marked-up copy of your manuscript that highlights changes made to the original version. You should upload this as a separate file labeled 'Revised Manuscript with Track Changes'. * An unmarked version of your revised paper without tracked changes. You should upload this as a separate file labeled 'Manuscript'. If you would like to make changes to your financial disclosure, competing interests statement, or data availability statement, please make these updates within the submission form at the time of resubmission. Guidelines for resubmitting your figure files are available below the reviewer comments at the end of this letter. We look forward to receiving your revised manuscript. Kind regards, Hocine Cherifi Editor-In-Chief PLOS Complex Systems Hocine Cherifi Editor-in-Chief PLOS Complex Systems Journal Requirements: 1. Please amend your detailed Financial Disclosure statement. This is published with the article. It must therefore be completed in full sentences and contain the exact wording you wish to be published. i. State the initials, alongside each funding source, of each author to receive each grant. For example: "This work was supported by the National Institutes of Health (####### to AM; ###### to CJ) and the National Science Foundation (###### to AM)." 2. Thank you for uploading your study's underlying data set. Unfortunately, the repository you have noted in your Data Availability statement does not qualify as an acceptable data repository according to PLOS's standards. At this time, please upload the minimal data set necessary to replicate your study's findings to a stable, public repository (such as figshare or Dryad) and provide us with the relevant URLs, DOIs, or accession numbers that may be used to access these data. For a list of recommended repositories and additional information on PLOS standards for data deposition, please see https://journals.plos.org/plosone/s/recommended-repositories. 3. We ask that a manuscript source file is provided at Revision. Please upload your manuscript file as a .doc, .docx, .rtf or .tex. 4. Please upload separate figure files in .tif or .eps format. Also, remove the figures from your manuscript file but keep the legends. For more information about figure files please see our guidelines: https://journals.plos.org/complexsystems/s/figures https://journals.plos.org/complexsystems/s/figures#loc-file-requirements 5. Please provide an Author Summary. This should appear in your manuscript between the Abstract (if applicable) and the Introduction, and should be 150–200 words long. The aim should be to make your findings accessible to a wide audience that includes both scientists and non-scientists. Sample summaries can be found on our website under Submission Guidelines: https://journals.plos.org/complexsystems/s/submission-guidelines#loc-parts-of-a-submission 6. We have noticed that you have uploaded Supporting Information files, but you have not included a list of legends. Please add a full list of legends for your Supporting Information files after the references list. If the reviewer comments include a recommendation to cite specific previously published works, please review and evaluate these publications to determine whether they are relevant and should be cited. There is no requirement to cite these works unless the editor has indicated otherwise. Additional Editor Comments (if provided): [Note: HTML markup is below. Please do not edit.] Reviewers' Comments: Reviewer's Responses to Questions Comments to the Author 1. Does this manuscript meet PLOS Complex Systems’s publication criteria?> Reviewer #1: Yes Reviewer #2: Yes Reviewer #3: Yes ********** 2. Has the statistical analysis been performed appropriately and rigorously?-->?> Reviewer #1: Yes Reviewer #2: Yes Reviewer #3: Yes ********** 3. Have the authors made all data underlying the findings in their manuscript fully available (please refer to the Data Availability Statement at the start of the manuscript PDF file)??> The PLOS Data policy Reviewer #1: Yes Reviewer #2: Yes Reviewer #3: No ********** 4. Is the manuscript presented in an intelligible fashion and written in standard English??> Reviewer #1: Yes Reviewer #2: Yes Reviewer #3: Yes ********** Reviewer #1: This paper proposes a general framework for sparsifying weighted networks that builds on previous work analyzing the distance backbones of networks. The distance backbone is the set of edges that obey the triangle inequality in the sense that the edge between i and j is the shortest path from i to j. This concept of a distance backbone can generalized to any td-norm (a binary operation for meaningfully combining edge distances to form path lengths), as each td-norm induces a different triangle inequality and thus a different set of edges that satisfy it. A special case of the distance backbone is the metric backbone, which corresponds to the td-norm being addition. The paper proposes a backboning strategy that first identifies an order on the edges based on when they disappear from the distance backbone as one sweeps through a family of increasingly restrictive td-norms (the paper discusses two possible families for the td-norms). The value lambda_ij of the family's continuous parameter at which (i,j) disappears is associated with the edge (i,j) and after setting a threshold for lambda one obtains a sparsified network. It is found that empirical networks tend to have lognormal distributions of the lambda_ij's with a tight range of modal values, giving hints as to what threshold of lambda can be chosen in practice for meaningful sparsification. Different backboning methods are then compared with respect to how well they preserve certain structural and dynamical properties, averaged over the sparsification levels, and it is found that the proposed method (DBS) and a method based on semi-metric distortion (SmD) perform the best. DBS is shown to be capable of preserving the measures of interest (eigenvector centrality ordering, average infection time ordering in SI model, and infection timescale in SI model) even with high sparsification levels, and optimal thresholds lambda are identified for various weighted combinations of these measures, showing a relatively concentrated region in parameter space across empirical social networks. The paper also has extensive supplementary materials with additional tests and implementation details. The core idea of the DBS method is quite creative and the paper tests the new method comprehensively along with other similar methods to show that it can perform quite well preserving certain structural and dynamical properties. The paper will make a nice contribution to the network backboning/sparsification literature, and from my perspective should be published here after some minor revisions. The major concerns I have deal with (1) the computational complexity of the method, and (2) the measures used for comparison of the backboning methods. (1) The authors have clearly thought carefully about the algorithmic implementation (as detailed in the appendix), but obviously this is a challenging problem to solve efficiently. I think it is then very important to provide the runtimes for the empirical networks in the appendix, so people can understand what to expect when applying the method in practice. My understanding is that no network analyzed in the study had more 1000 nodes, suggesting that this was the largest system size that could be studied in a reasonable amount of time. If so, this should also be noted. (2) The comparisons are quite detailed, but only are done for a few specific measures. I think a more comprehensive set of measures should be included for comparison. A few that may provide new information about the performance: (a) Some distance measure between the distribution of normalized degrees (and/or strengths) for the sparsified graph and the distribution of normalized degrees (and/or strengths) in the original graph; (b) Some distance measure between the normalized edge weight distribution of the sparsified graph and the original graph; (c) Some distance measure between the path length distribution of the sparsified graph and the original graph. These could be averaged over sparsification levels to get AUC scores like with the other measures. This would give a more comprehensive understanding of the method's performance. Reviewer #2: I attach my referee report. My assessment and detailed comments are all provided there. Overall, I find this to be a strong and interesting paper on an important topic. The manuscript is well motivated, technically solid, and presents a genuinely appealing contribution to the graph sparsification literature. In particular, the proposed framework is elegant and the results on preserving spreading dynamics and centrality rankings are convincing. For these reasons, I recommend minor revision. In the attached report I go point by point through the manuscript, following the flow of the paper as it is read. I highlight what I see as the main strengths of the work, including its conceptual novelty, its careful comparative analysis, and its practical relevance. My main suggestion is that the authors broaden the discussion of centrality preservation beyond eigenvector centrality, in particular by addressing Katz centrality and its connection to recent related work. I also raise a few more limited comments concerning scope, computational aspects, and phrasing of some claims. None of these issues, however, undermine the main contribution of the paper. Rather, they are intended to strengthen an already very good manuscript and improve its accessibility and positioning within the existing literature. Reviewer #3: The authors propose a new tunable backbone extraction method based on distance norms. The idea is to remove edges that break the triangular inequality for a given triangular distance norm. In the continuation of previous works on semi-metric distortion, this new general setting allows to obtain backbones with the same properties and to have more information, with for each edge, a degree of importance given by the smallest distance backbone in which it appears. They experiment their method on a battery of social contact networks and show that it better preserves node centrality and spreading dynamics than other methods. Overall, this a very interesting solid study with a well argued description accompanied by deep analysis and experiments. Specific comments: - The github link to the data provided is not working - Line 92 : It’s confusing to say that g is a binary operation since in Equation 3 g has n+1 parameters - Line 107 : in Equation 5, it’s better to write \forall T=(x_i,x_k₁,…, x_j) - Line 156 : allows ? In the background section, it would be nice to have an example of a weighted network showing which edges are triangular and which are semi-triangular. In Sections 3 and 4, the authors point out the computational cost of measuring the edge’s importance without more details. It would be interesting to have some time measures and also for computing a backbone once having chosen a value of lambda. Moreover, since the considered networks are relatively small, it would be nice to give some indications about the practical limits. ********** what does this mean?). If published, this will include your full peer review and any attached files. Do you want your identity to be public for this peer review? If you choose “no”, your identity will remain anonymous but your review may still be made public. For information about this choice, including consent withdrawal, please see our Privacy Policy Reviewer #1: No Reviewer #2: No Reviewer #3: No ********** [NOTE: If reviewer comments were submitted as an attachment file, they will be attached to this email and accessible via the submission site. Please log into your account, locate the manuscript record, and check for the action link "View Attachments". If this link does not appear, there are no attachment files.] Figure resubmission: Reproducibility: To enhance the reproducibility of your results, we recommend that authors of applicable studies deposit laboratory protocols in protocols.io, where a protocol can be assigned its own identifier (DOI) such that it can be cited independently in the future. Additionally, PLOS ONE offers an option to publish peer-reviewed clinical study protocols. Read more information on sharing protocols at https://plos.org/protocols?utm_medium=editorial-email&utm_source=authorletters&utm_campaign=protocols
|
| Revision 1 |
|
Distance Backbones Optimize Spreading Dynamics and Centrality Ranks in the Sparsification of Complex Networks PCSY-D-26-00033R1 Dear Dr. Xavier Costa, We're pleased to inform you that your manuscript has been judged scientifically suitable for publication and will be formally accepted for publication once it meets all outstanding technical requirements. Within one week, you'll receive an e-mail detailing the required amendments. When these have been addressed, you'll receive a formal acceptance letter and your manuscript will be scheduled for publication. An invoice for payment will follow shortly after the formal acceptance. To ensure an efficient process, please log into Editorial Manager at https://www.editorialmanager.com/pcsy/ click the 'Update My Information' link at the top of the page, and double check that your user information is up-to-date. For questions related to billing, please contact billing support at https://plos.my.site.com/s/. If your institution or institutions have a press office, please notify them about your upcoming paper to help maximize its impact. If they'll be preparing press materials, please inform our press team as soon as possible -- no later than 48 hours after receiving the formal acceptance. Your manuscript will remain under strict press embargo until 2 pm Eastern Time on the date of publication. For more information, please contact complexsystems@plos.org. Kind regards, Hocine Cherifi Editor-In-Chief PLOS Complex Systems Additional Editor Comments (optional): Reviewers' comments: Reviewer's Responses to Questions Comments to the Author Reviewer #1: All comments have been addressed Reviewer #3: All comments have been addressed -------------------- Reviewer #1: Yes Reviewer #3: Yes -------------------- 3. Has the statistical analysis been performed appropriately and rigorously?-->?> Reviewer #1: Yes Reviewer #3: Yes -------------------- 4. Have the authors made all data underlying the findings in their manuscript fully available (please refer to the Data Availability Statement at the start of the manuscript PDF file)??> The PLOS Data policy Reviewer #1: Yes Reviewer #3: Yes -------------------- 5. Is the manuscript presented in an intelligible fashion and written in standard English?<br/><br/>PLOS Complex Systems does not copyedit accepted manuscripts, so the language in submitted articles must be clear, correct, and unambiguous. Any typographical or grammatical errors should be corrected at revision, so please note any specific errors here.-->?> Reviewer #1: Yes Reviewer #3: Yes -------------------- Reviewer #1: (No Response) Reviewer #3: In this revised manuscript, the authors have addressed all my concerns and I feel that the paper is now much more understandable and ready for publication. -------------------- what does this mean?). If published, this will include your full peer review and any attached files. Do you want your identity to be public for this peer review? If you choose “no”, your identity will remain anonymous but your review may still be made public. For information about this choice, including consent withdrawal, please see our Privacy Policy Reviewer #1: No Reviewer #3: No -------------------- |
Open letter on the publication of peer review reports
PLOS recognizes the benefits of transparency in the peer review process. Therefore, we enable the publication of all of the content of peer review and author responses alongside final, published articles. Reviewers remain anonymous, unless they choose to reveal their names.
We encourage other journals to join us in this initiative. We hope that our action inspires the community, including researchers, research funders, and research institutions, to recognize the benefits of published peer review reports for all parts of the research system.
Learn more at ASAPbio .