Peer Review History
| Original SubmissionFebruary 28, 2020 |
|---|
|
PONE-D-20-05820 Efficient simulation of non-Markovian dynamics on complex networks PLOS ONE Dear Mr. Grossmann, Thank you for submitting your manuscript to PLOS ONE. After careful consideration, we feel that it has merit but does not fully meet PLOS ONE’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. We would appreciate receiving your revised manuscript by Jun 05 2020 11:59PM. When you are ready to submit your revision, log on to https://www.editorialmanager.com/pone/ and select the 'Submissions Needing Revision' folder to locate your manuscript file. If you would like to make changes to your financial disclosure, please include your updated statement in your cover letter. To enhance the reproducibility of your results, we recommend that if applicable you deposit your 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. For instructions see: http://journals.plos.org/plosone/s/submission-guidelines#loc-laboratory-protocols Please include the following items when submitting your revised manuscript:
Please note while forming your response, if your article is accepted, you may have the opportunity to make the peer review history publicly available. The record will include editor decision letters (with reviews) and your responses to reviewer comments. If eligible, we will contact you to opt in or out. We look forward to receiving your revised manuscript. Kind regards, Hocine Cherifi Academic Editor PLOS ONE Journal Requirements: When submitting your revision, we need you to address these additional requirements. 1. Please ensure that your manuscript meets PLOS ONE's style requirements, including those for file naming. The PLOS ONE style templates can be found at https://journals.plos.org/plosone/s/file?id=wjVg/PLOSOne_formatting_sample_main_body.pdf and 2. We noticed you have some minor occurrence of overlapping text with the following previous publication(s), which needs to be addressed: Großmann G., Bortolussi L., Wolf V. (2020) Rejection-Based Simulation of Non-Markovian Agents on Complex Networks. In: Cherifi H., Gaito S., Mendes J., Moro E., Rocha L. (eds) Complex Networks and Their Applications VIII. COMPLEX NETWORKS 2019. Studies in Computational Intelligence, vol 881. Springer, Cham I appreciate that this is your own conference paper which this manuscript is an extension of, and that may you have revised the text substantially already for this submission, but please ensure that as much of the overlapping text as possible is revised or removed, in particular as the previous text is under copyright. 3. In your Data Availability statement, you have not specified where the minimal data set underlying the results described in your manuscript can be found. PLOS defines a study's minimal data set as the underlying data used to reach the conclusions drawn in the manuscript and any additional data required to replicate the reported study findings in their entirety. All PLOS journals require that the minimal data set be made fully available. For more information about our data policy, please see http://journals.plos.org/plosone/s/data-availability. Upon re-submitting your revised manuscript, please upload your study’s minimal underlying data set as either Supporting Information files or to a stable, public repository and include the relevant URLs, DOIs, or accession numbers within your revised cover letter. For a list of acceptable repositories, please see http://journals.plos.org/plosone/s/data-availability#loc-recommended-repositories. Any potentially identifying patient information must be fully anonymized. Important: If there are ethical or legal restrictions to sharing your data publicly, please explain these restrictions in detail. Please see our guidelines for more information on what we consider unacceptable restrictions to publicly sharing data: http://journals.plos.org/plosone/s/data-availability#loc-unacceptable-data-access-restrictions. Note that it is not acceptable for the authors to be the sole named individuals responsible for ensuring data access. We will update your Data Availability statement to reflect the information you provide in your cover letter. 4. Thank you for stating in your Funding Statement: 'This work was partly funded by the German Research Foundation (DFG) via the collaborative research center “Methods and Tools for Understanding and Controlling Privacy"' a. Please provide an amended statement that declares *all* the funding or sources of support (whether external or internal to your organization) received during this study, as detailed online in our guide for authors at http://journals.plos.org/plosone/s/submit-now Please also include the statement “There was no additional external funding received for this study.” in your updated Funding Statement. b. Please include your amended Funding Statement within your cover letter. We will change the online submission form on your behalf. 5. Thank you for stating the following in your Competing Interests section: 'No' a. Please complete your Competing Interests statement to state any Competing Interests. If you have no competing interests, please state "The authors have declared that no competing interests exist.", as detailed online in our guide for authors at http://journals.plos.org/plosone/s/submit-now b. This information should be included in your cover letter; we will change the online submission form on your behalf. Please know it is PLOS ONE policy for corresponding authors to declare, on behalf of all authors, all potential competing interests for the purposes of transparency. PLOS defines a competing interest as anything that interferes with, or could reasonably be perceived as interfering with, the full and objective presentation, peer review, editorial decision-making, or publication of research or non-research articles submitted to one of the journals. Competing interests can be financial or non-financial, professional, or personal. Competing interests can arise in relationship to an organization or another person. Please follow this link to our website for more details on competing interests: http://journals.plos.org/plosone/s/competing-interests 6. PLOS requires an ORCID iD for the corresponding author in Editorial Manager on papers submitted after December 6th, 2016. Please ensure that you have an ORCID iD and that it is validated in Editorial Manager. To do this, go to ‘Update my Information’ (in the upper left-hand corner of the main menu), and click on the Fetch/Validate link next to the ORCID field. This will take you to the ORCID site and allow you to create a new iD or authenticate a pre-existing iD in Editorial Manager. Please see the following video for instructions on linking an ORCID iD to your Editorial Manager account: https://www.youtube.com/watch?v=_xcclfuvtxQ [Note: HTML markup is below. Please do not edit.] Reviewers' comments: Reviewer's Responses to Questions Comments to the Author 1. Is the manuscript technically sound, and do the data support the conclusions? The manuscript must describe a technically sound piece of scientific research with data that supports the conclusions. Experiments must have been conducted rigorously, with appropriate controls, replication, and sample sizes. The conclusions must be drawn appropriately based on the data presented. Reviewer #1: Yes Reviewer #2: Yes Reviewer #3: Yes ********** 2. Has the statistical analysis been performed appropriately and rigorously? Reviewer #1: Yes Reviewer #2: N/A Reviewer #3: I Don't Know ********** 3. Have the authors made all data underlying the findings in their manuscript fully available? The PLOS Data policy requires authors to make all data underlying the findings described in their manuscript fully available without restriction, with rare exception (please refer to the Data Availability Statement in the manuscript PDF file). The data should be provided as part of the manuscript or its supporting information, or deposited to a public repository. For example, in addition to summary statistics, the data points behind means, medians and variance measures should be available. If there are restrictions on publicly sharing data—e.g. participant privacy or use of data from a third party—those must be specified. Reviewer #1: Yes Reviewer #2: Yes Reviewer #3: Yes ********** 4. Is the manuscript presented in an intelligible fashion and written in standard English? PLOS ONE 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 #2: Yes Reviewer #3: Yes ********** 5. Review Comments to the Author Please use the space provided to explain your answers to the questions above. You may also include additional comments for the author, including concerns about dual publication, research ethics, or publication ethics. (Please upload your review as an attachment if it exceeds 20,000 characters) Reviewer #1: Review for Efficient simulation of non-Markovian dynamics on complex network to Plos One. Authors propose a stochastic rejection-based, event-driven simulation algorithm that scales well with the size of a network and connectivity of the underlying contact network. Authors check that the method produces statistically correct samples. The paper addresses interesting question about what are the alternatives to use stochastic (Monte-Carlo) simulations to study the complex emerging dynamical patterns. At the same time there are several suggestions I would like to make about the paper: 1. In the description of the multi-agent model authors are describing that model assumptions can describe wide range of applications, they also briefly mention "as well as non-Markovian delays." (line 80=) I would recommend either to put a reference here on what exactly they mean or to elaborate here on this point, since it seems it could be understood in multiple ways. I understand that this work is is an extension of [26] in terms of theoretical analysis, at the same time it feels that it needs to be more clear for those who did not read that reference. 2. for making the point of the proposed method clear I would suggest to include a schme or a diagram to Network dynamics description on page 10. It would clarify to readers about what is the role of \\psi and \\phi functions. 3. in line 92 when authors refer to connectivity of a network it is not clear whether they refer to a network to be fully connected component, so I would specify it there 4. line 104 type with "of" 5. in conclussions I would add eleborations on comparing methods to some other methods - when it is performing comparably well. 6. from 164 line authors describe delay generation, i would again suggest to give more links to other 7. in equation between lines 350 and 351 it would be better to specify p(s) instead of p 8. in caption of fig.2 i would specify more what is in the brackets [smaller is better]. in general for the RED evaluation it would be useful to give readers some guidelines in which cases the method performs well and in which it is not as effective (when the update the instantaneous rates of the whole 473 neighborhood in each simulation step would drastically decrease optimality to use other algorithms) Overall, I recommend minor revisions with keeping in mind making the whole paper to explain the main methods in more intuitive way. Thank you. Reviewer #2: The manuscript "Efficient simulation of non-Markovian dynamics on complex networks" by Gerrit Grossmann et al. presents a new method for simulating continuous time non-Markovian dynamical processes on static networks. Using a delay time generated according to an overestimated instantaneous rate followed by a rejection-based selection permits to avoid updating the rates of neighboring nodes and allows to simulate processes in a highly efficient way. The proposed method seems very interesting and promising. However, I believe that several parts of the manuscript could be made clearer and that relevant references should be added. Concerning the case studies, it would be interesting to test the performances with existing algorithms and to see that the results obtained are similar (in the statistical sense) to results obtained with other algorithms. This would also add to this manuscript compared to the already published paper in the complex networks conference. A part from this and several typos, I think the manuscript is clear and thorough. More precisely, in the part about generating time-delays, the validity of the method of integration (Fig. 1 and eq. 1) should be demonstrated. Why is t_v distributed according to the correct distribution? It may be obvious to the authors, but a small justification would make it clearer to the readers. References should also be provided. Also, Fig. 1d should be clearly explained in the main text and in the caption. References for the rejection-based method should also be provided. Reasoning in term of intensity instead of PDF is not intuitive for most readers, given that the authors chose to submit to a wide audience journal, it would be nice if they tried to help the readers to understand those concepts. For example, when they say that if the integral of the intensity is finite, the process might not fire at all with positive probability, this is not obvious for me. Could they give an example or provide a reference? Another problem is that they never actually clearly explain why, with their method, the rates of the neighbors of a firing agent do not need to be updated. This should be explained in the introduction and in the description of the method. About the case studies, as said above, when proposing a new simulation methods it sounds normal to show how it compares to existing methods (as long as the codes for these methods is easily available). Could the authors find a case study where LGA, nMGA and RED could be compared? Also, it would be nice to see that the (ensemble average of the) results of the simulations agree. There are also several typos: - page 2, line 1: "that based" -> "based" - line 18: "on models on so-called" -> "on so-called" - page 3, line 85: "a an agent" -> "an agent" - page 4, line 99: "the the agent" -> "the agent" - page 5, line 137: "dented by" ? - page 8, line 221: "only use the" -> "only the" - page 11, line 339: "introduced the" -> "introduced in the" - page 11, line 340: "simulationS" and there is no verb in this sentence. - line 345/346: "process" -> "processes" - Discussion: reference Fig. 2. Reviewer #3: The manuscript by Großmann and coworkers presents an alternative method for efficient simulation of non-Markovian processes on networks for generic dynamical processes. The method is grounded on optimized rejection algorithms. The issue is very timely and methodology is apparently sound. The codes in Julia are available in github. The text is grammatically well written. However, the flow of reading is not good since it is quite prolix. I think that the manuscript could be much more concise allowing to grab the important ideas more quickly. The number of didactic examples is exaggerated and reading not efficient. Another serious issue is that only CPU times with respect to different methods were presented but no results showing the accuracy of the optimized strategies were discussed. I think that it is a bad balance of content where too much space is devoted to pedagogic aims in detriment to discussion and results on the accuracy. So, I recommend a major revision shrinking the introductory sections and expanding results and discussions. ********** 6. PLOS authors have the option to publish the peer review history of their article (what does this mean?). If published, this will include your full peer review and any attached files. If you choose “no”, your identity will remain anonymous but your review may still be made public. Do you want your identity to be public for this peer review? 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 to be viewed.] While revising your submission, please upload your figure files to the Preflight Analysis and Conversion Engine (PACE) digital diagnostic tool, https://pacev2.apexcovantage.com/. PACE helps ensure that figures meet PLOS requirements. To use PACE, you must first register as a user. Registration is free. Then, login and navigate to the UPLOAD tab, where you will find detailed instructions on how to use the tool. If you encounter any issues or have any questions when using PACE, please email us at figures@plos.org. Please note that Supporting Information files do not need this step. |
| Revision 1 |
|
Efficient simulation of non-Markovian dynamics on complex networks PONE-D-20-05820R1 Dear Dr. Grossmann, 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 http://www.editorialmanager.com/pone/, click the 'Update My Information' link at the top of the page, and double check that your user information is up-to-date. If you have any billing related questions, please contact our Author Billing department directly at authorbilling@plos.org. 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 onepress@plos.org. Kind regards, Hocine Cherifi Academic Editor PLOS ONE |
| Formally Accepted |
|
PONE-D-20-05820R1 Efficient simulation of non-Markovian dynamics on complex network Dear Dr. Grossmann: I'm pleased to inform you that your manuscript has been deemed suitable for publication in PLOS ONE. Congratulations! Your manuscript is now with our production department. If your institution or institutions have a press office, please let them know about your upcoming paper now to help maximize its impact. If they'll be preparing press materials, please inform our press team within the next 48 hours. Your manuscript will remain under strict press embargo until 2 pm Eastern Time on the date of publication. For more information please contact onepress@plos.org. If we can help with anything else, please email us at plosone@plos.org. Thank you for submitting your work to PLOS ONE and supporting open access. Kind regards, PLOS ONE Editorial Office Staff on behalf of Professor Hocine Cherifi Academic Editor PLOS ONE |
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 .