Modelling cascading failures in networks with the harmonic closeness

Many studies on cascading failures adopt the degree or the betweenness of a node to define its load. From a novel perspective, we propose an approach to obtain initial loads considering the harmonic closeness and the impact of neighboring nodes. Based on simulation results for different adjustable p...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:PloS one 2021-01, Vol.16 (1), p.e0243801-e0243801
Hauptverfasser: Hao, Yucheng, Jia, Limin, Wang, Yanhui, He, Zhichao
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page e0243801
container_issue 1
container_start_page e0243801
container_title PloS one
container_volume 16
creator Hao, Yucheng
Jia, Limin
Wang, Yanhui
He, Zhichao
description Many studies on cascading failures adopt the degree or the betweenness of a node to define its load. From a novel perspective, we propose an approach to obtain initial loads considering the harmonic closeness and the impact of neighboring nodes. Based on simulation results for different adjustable parameter θ, local parameter δ and proportion of attacked nodes f, it is found that in scale-free networks (SF networks), small-world networks (SW networks) and Erdos-Renyi networks (ER networks), there exists a negative correlation between optimal θ and δ. By the removal of the low load node, cascading failures are more likely to occur in some cases. In addition, we find a valuable result that our method yields better performance compared with other methods in SF networks with an arbitrary f, SW and ER networks with large f. Moreover, the method concerning the harmonic closeness makes these three model networks more robust for different average degrees. Finally, we perform the simulations on twenty real networks, whose results verify that our method is also effective to distribute the initial load in different real networks.
doi_str_mv 10.1371/journal.pone.0243801
format Article
fullrecord <record><control><sourceid>gale_plos_</sourceid><recordid>TN_cdi_plos_journals_2480724448</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A649640695</galeid><doaj_id>oai_doaj_org_article_ee7702528aeb478198c42df34e751eb0</doaj_id><sourcerecordid>A649640695</sourcerecordid><originalsourceid>FETCH-LOGICAL-c692t-636ff56ac711aef204bb09367f94ed9065ade3e4e19d938c0a2e94846d38d1d73</originalsourceid><addsrcrecordid>eNqNkttu1DAQhiMEomXhDRBEQkJwsYtPceIbpKqcViqqxOnW8tqTjUvW3toOhbfH202rDeoF8oVH9jf_2DN_UTzFaIFpjd9c-CE41S-23sECEUYbhO8Vx1hQMucE0fsH8VHxKMYLhCracP6wOKKUCYprcVy8--wN9L1161KrqJXZRa2y_RAgltaVDtKVDz9jeWVTV6YOyk6FjXdWl7r3ERzE-Lh40Ko-wpNxnxXfP7z_dvppfnb-cXl6cjbXXJA055S3bcWVrjFW0BLEViskKK9bwcAIxCtlgAIDLIygjUaKgGAN44Y2Bpuazorne91trizHBkRJWINqwhhrMrHcE8arC7kNdqPCH-mVldcHPqylCsnqHiRAXSNSkUbBitUNFo1mxLSUQV1hWKGs9XasNqw2YDS4FFQ_EZ3eONvJtf8l64ZSTFkWeDUKBH85QExyY6PO3VYO_HD9bowx2s1uVrz4B737dyO1VvkD1rU-19U7UXnCmeAMcVFlanEHlZeBjdXZLa3N55OE15OEzCT4ndZqiFEuv375f_b8x5R9ecB2oPrURd8PyXoXpyDbgzr4GAO0t03GSO7MftMNuTO7HM2e054dDug26cbd9C_P__ju</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2480724448</pqid></control><display><type>article</type><title>Modelling cascading failures in networks with the harmonic closeness</title><source>MEDLINE</source><source>DOAJ Directory of Open Access Journals</source><source>Public Library of Science (PLoS)</source><source>EZB-FREE-00999 freely available EZB journals</source><source>PubMed Central</source><source>Free Full-Text Journals in Chemistry</source><creator>Hao, Yucheng ; Jia, Limin ; Wang, Yanhui ; He, Zhichao</creator><contributor>Cherifi, Chantal</contributor><creatorcontrib>Hao, Yucheng ; Jia, Limin ; Wang, Yanhui ; He, Zhichao ; Cherifi, Chantal</creatorcontrib><description>Many studies on cascading failures adopt the degree or the betweenness of a node to define its load. From a novel perspective, we propose an approach to obtain initial loads considering the harmonic closeness and the impact of neighboring nodes. Based on simulation results for different adjustable parameter θ, local parameter δ and proportion of attacked nodes f, it is found that in scale-free networks (SF networks), small-world networks (SW networks) and Erdos-Renyi networks (ER networks), there exists a negative correlation between optimal θ and δ. By the removal of the low load node, cascading failures are more likely to occur in some cases. In addition, we find a valuable result that our method yields better performance compared with other methods in SF networks with an arbitrary f, SW and ER networks with large f. Moreover, the method concerning the harmonic closeness makes these three model networks more robust for different average degrees. Finally, we perform the simulations on twenty real networks, whose results verify that our method is also effective to distribute the initial load in different real networks.</description><identifier>ISSN: 1932-6203</identifier><identifier>EISSN: 1932-6203</identifier><identifier>DOI: 10.1371/journal.pone.0243801</identifier><identifier>PMID: 33493179</identifier><language>eng</language><publisher>United States: Public Library of Science</publisher><subject>Algorithms ; Biology and Life Sciences ; Communication networks ; Computer and Information Sciences ; Computer Communication Networks ; Computer Simulation ; Engineering and Technology ; Failure ; Failure analysis ; Failure mode and effects analysis ; Gene Regulatory Networks ; Harmonic analysis ; Information Services ; Laboratories ; Load ; Loads (forces) ; Mathematical models ; Methods ; Models, Theoretical ; Nodes ; Parameters ; Physical Sciences ; Propagation ; Protein Interaction Maps ; Research and Analysis Methods ; Robustness ; Simulation ; Social Networking ; Social Sciences ; Stress concentration ; Traffic control</subject><ispartof>PloS one, 2021-01, Vol.16 (1), p.e0243801-e0243801</ispartof><rights>COPYRIGHT 2021 Public Library of Science</rights><rights>2021 Hao et al. This is an open access article distributed under the terms of the Creative Commons Attribution License: http://creativecommons.org/licenses/by/4.0/ (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>2021 Hao et al 2021 Hao et al</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c692t-636ff56ac711aef204bb09367f94ed9065ade3e4e19d938c0a2e94846d38d1d73</citedby><cites>FETCH-LOGICAL-c692t-636ff56ac711aef204bb09367f94ed9065ade3e4e19d938c0a2e94846d38d1d73</cites><orcidid>0000-0003-0996-1345</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC7833134/pdf/$$EPDF$$P50$$Gpubmedcentral$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC7833134/$$EHTML$$P50$$Gpubmedcentral$$Hfree_for_read</linktohtml><link.rule.ids>230,314,727,780,784,864,885,2101,2927,23865,27923,27924,53790,53792,79471,79472</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/33493179$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><contributor>Cherifi, Chantal</contributor><creatorcontrib>Hao, Yucheng</creatorcontrib><creatorcontrib>Jia, Limin</creatorcontrib><creatorcontrib>Wang, Yanhui</creatorcontrib><creatorcontrib>He, Zhichao</creatorcontrib><title>Modelling cascading failures in networks with the harmonic closeness</title><title>PloS one</title><addtitle>PLoS One</addtitle><description>Many studies on cascading failures adopt the degree or the betweenness of a node to define its load. From a novel perspective, we propose an approach to obtain initial loads considering the harmonic closeness and the impact of neighboring nodes. Based on simulation results for different adjustable parameter θ, local parameter δ and proportion of attacked nodes f, it is found that in scale-free networks (SF networks), small-world networks (SW networks) and Erdos-Renyi networks (ER networks), there exists a negative correlation between optimal θ and δ. By the removal of the low load node, cascading failures are more likely to occur in some cases. In addition, we find a valuable result that our method yields better performance compared with other methods in SF networks with an arbitrary f, SW and ER networks with large f. Moreover, the method concerning the harmonic closeness makes these three model networks more robust for different average degrees. Finally, we perform the simulations on twenty real networks, whose results verify that our method is also effective to distribute the initial load in different real networks.</description><subject>Algorithms</subject><subject>Biology and Life Sciences</subject><subject>Communication networks</subject><subject>Computer and Information Sciences</subject><subject>Computer Communication Networks</subject><subject>Computer Simulation</subject><subject>Engineering and Technology</subject><subject>Failure</subject><subject>Failure analysis</subject><subject>Failure mode and effects analysis</subject><subject>Gene Regulatory Networks</subject><subject>Harmonic analysis</subject><subject>Information Services</subject><subject>Laboratories</subject><subject>Load</subject><subject>Loads (forces)</subject><subject>Mathematical models</subject><subject>Methods</subject><subject>Models, Theoretical</subject><subject>Nodes</subject><subject>Parameters</subject><subject>Physical Sciences</subject><subject>Propagation</subject><subject>Protein Interaction Maps</subject><subject>Research and Analysis Methods</subject><subject>Robustness</subject><subject>Simulation</subject><subject>Social Networking</subject><subject>Social Sciences</subject><subject>Stress concentration</subject><subject>Traffic control</subject><issn>1932-6203</issn><issn>1932-6203</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>EIF</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>DOA</sourceid><recordid>eNqNkttu1DAQhiMEomXhDRBEQkJwsYtPceIbpKqcViqqxOnW8tqTjUvW3toOhbfH202rDeoF8oVH9jf_2DN_UTzFaIFpjd9c-CE41S-23sECEUYbhO8Vx1hQMucE0fsH8VHxKMYLhCracP6wOKKUCYprcVy8--wN9L1161KrqJXZRa2y_RAgltaVDtKVDz9jeWVTV6YOyk6FjXdWl7r3ERzE-Lh40Ko-wpNxnxXfP7z_dvppfnb-cXl6cjbXXJA055S3bcWVrjFW0BLEViskKK9bwcAIxCtlgAIDLIygjUaKgGAN44Y2Bpuazorne91trizHBkRJWINqwhhrMrHcE8arC7kNdqPCH-mVldcHPqylCsnqHiRAXSNSkUbBitUNFo1mxLSUQV1hWKGs9XasNqw2YDS4FFQ_EZ3eONvJtf8l64ZSTFkWeDUKBH85QExyY6PO3VYO_HD9bowx2s1uVrz4B737dyO1VvkD1rU-19U7UXnCmeAMcVFlanEHlZeBjdXZLa3N55OE15OEzCT4ndZqiFEuv375f_b8x5R9ecB2oPrURd8PyXoXpyDbgzr4GAO0t03GSO7MftMNuTO7HM2e054dDug26cbd9C_P__ju</recordid><startdate>20210125</startdate><enddate>20210125</enddate><creator>Hao, Yucheng</creator><creator>Jia, Limin</creator><creator>Wang, Yanhui</creator><creator>He, Zhichao</creator><general>Public Library of Science</general><general>Public Library of Science (PLoS)</general><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>IOV</scope><scope>ISR</scope><scope>3V.</scope><scope>7QG</scope><scope>7QL</scope><scope>7QO</scope><scope>7RV</scope><scope>7SN</scope><scope>7SS</scope><scope>7T5</scope><scope>7TG</scope><scope>7TM</scope><scope>7U9</scope><scope>7X2</scope><scope>7X7</scope><scope>7XB</scope><scope>88E</scope><scope>8AO</scope><scope>8C1</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AEUYN</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>C1K</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FYUFA</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>H94</scope><scope>HCIFZ</scope><scope>K9.</scope><scope>KB.</scope><scope>KB0</scope><scope>KL.</scope><scope>L6V</scope><scope>LK8</scope><scope>M0K</scope><scope>M0S</scope><scope>M1P</scope><scope>M7N</scope><scope>M7P</scope><scope>M7S</scope><scope>NAPCQ</scope><scope>P5Z</scope><scope>P62</scope><scope>P64</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>RC3</scope><scope>7X8</scope><scope>5PM</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0003-0996-1345</orcidid></search><sort><creationdate>20210125</creationdate><title>Modelling cascading failures in networks with the harmonic closeness</title><author>Hao, Yucheng ; Jia, Limin ; Wang, Yanhui ; He, Zhichao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c692t-636ff56ac711aef204bb09367f94ed9065ade3e4e19d938c0a2e94846d38d1d73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Biology and Life Sciences</topic><topic>Communication networks</topic><topic>Computer and Information Sciences</topic><topic>Computer Communication Networks</topic><topic>Computer Simulation</topic><topic>Engineering and Technology</topic><topic>Failure</topic><topic>Failure analysis</topic><topic>Failure mode and effects analysis</topic><topic>Gene Regulatory Networks</topic><topic>Harmonic analysis</topic><topic>Information Services</topic><topic>Laboratories</topic><topic>Load</topic><topic>Loads (forces)</topic><topic>Mathematical models</topic><topic>Methods</topic><topic>Models, Theoretical</topic><topic>Nodes</topic><topic>Parameters</topic><topic>Physical Sciences</topic><topic>Propagation</topic><topic>Protein Interaction Maps</topic><topic>Research and Analysis Methods</topic><topic>Robustness</topic><topic>Simulation</topic><topic>Social Networking</topic><topic>Social Sciences</topic><topic>Stress concentration</topic><topic>Traffic control</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hao, Yucheng</creatorcontrib><creatorcontrib>Jia, Limin</creatorcontrib><creatorcontrib>Wang, Yanhui</creatorcontrib><creatorcontrib>He, Zhichao</creatorcontrib><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Gale In Context: Opposing Viewpoints</collection><collection>Gale In Context: Science</collection><collection>ProQuest Central (Corporate)</collection><collection>Animal Behavior Abstracts</collection><collection>Bacteriology Abstracts (Microbiology B)</collection><collection>Biotechnology Research Abstracts</collection><collection>Nursing &amp; Allied Health Database</collection><collection>Ecology Abstracts</collection><collection>Entomology Abstracts (Full archive)</collection><collection>Immunology Abstracts</collection><collection>Meteorological &amp; Geoastrophysical Abstracts</collection><collection>Nucleic Acids Abstracts</collection><collection>Virology and AIDS Abstracts</collection><collection>Agricultural Science Collection</collection><collection>Health &amp; Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Medical Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Public Health Database</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest One Sustainability</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>Agricultural &amp; Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>Environmental Sciences and Pollution Management</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Health Research Premium Collection</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>AIDS and Cancer Research Abstracts</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Health &amp; Medical Complete (Alumni)</collection><collection>Materials Science Database</collection><collection>Nursing &amp; Allied Health Database (Alumni Edition)</collection><collection>Meteorological &amp; Geoastrophysical Abstracts - Academic</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>Agricultural Science Database</collection><collection>Health &amp; Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Algology Mycology and Protozoology Abstracts (Microbiology C)</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Nursing &amp; Allied Health Premium</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Environmental Science Database</collection><collection>Materials Science Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>Environmental Science Collection</collection><collection>Genetics Abstracts</collection><collection>MEDLINE - Academic</collection><collection>PubMed Central (Full Participant titles)</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>PloS one</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hao, Yucheng</au><au>Jia, Limin</au><au>Wang, Yanhui</au><au>He, Zhichao</au><au>Cherifi, Chantal</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Modelling cascading failures in networks with the harmonic closeness</atitle><jtitle>PloS one</jtitle><addtitle>PLoS One</addtitle><date>2021-01-25</date><risdate>2021</risdate><volume>16</volume><issue>1</issue><spage>e0243801</spage><epage>e0243801</epage><pages>e0243801-e0243801</pages><issn>1932-6203</issn><eissn>1932-6203</eissn><abstract>Many studies on cascading failures adopt the degree or the betweenness of a node to define its load. From a novel perspective, we propose an approach to obtain initial loads considering the harmonic closeness and the impact of neighboring nodes. Based on simulation results for different adjustable parameter θ, local parameter δ and proportion of attacked nodes f, it is found that in scale-free networks (SF networks), small-world networks (SW networks) and Erdos-Renyi networks (ER networks), there exists a negative correlation between optimal θ and δ. By the removal of the low load node, cascading failures are more likely to occur in some cases. In addition, we find a valuable result that our method yields better performance compared with other methods in SF networks with an arbitrary f, SW and ER networks with large f. Moreover, the method concerning the harmonic closeness makes these three model networks more robust for different average degrees. Finally, we perform the simulations on twenty real networks, whose results verify that our method is also effective to distribute the initial load in different real networks.</abstract><cop>United States</cop><pub>Public Library of Science</pub><pmid>33493179</pmid><doi>10.1371/journal.pone.0243801</doi><tpages>e0243801</tpages><orcidid>https://orcid.org/0000-0003-0996-1345</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1932-6203
ispartof PloS one, 2021-01, Vol.16 (1), p.e0243801-e0243801
issn 1932-6203
1932-6203
language eng
recordid cdi_plos_journals_2480724448
source MEDLINE; DOAJ Directory of Open Access Journals; Public Library of Science (PLoS); EZB-FREE-00999 freely available EZB journals; PubMed Central; Free Full-Text Journals in Chemistry
subjects Algorithms
Biology and Life Sciences
Communication networks
Computer and Information Sciences
Computer Communication Networks
Computer Simulation
Engineering and Technology
Failure
Failure analysis
Failure mode and effects analysis
Gene Regulatory Networks
Harmonic analysis
Information Services
Laboratories
Load
Loads (forces)
Mathematical models
Methods
Models, Theoretical
Nodes
Parameters
Physical Sciences
Propagation
Protein Interaction Maps
Research and Analysis Methods
Robustness
Simulation
Social Networking
Social Sciences
Stress concentration
Traffic control
title Modelling cascading failures in networks with the harmonic closeness
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T21%3A18%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_plos_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Modelling%20cascading%20failures%20in%20networks%20with%20the%20harmonic%20closeness&rft.jtitle=PloS%20one&rft.au=Hao,%20Yucheng&rft.date=2021-01-25&rft.volume=16&rft.issue=1&rft.spage=e0243801&rft.epage=e0243801&rft.pages=e0243801-e0243801&rft.issn=1932-6203&rft.eissn=1932-6203&rft_id=info:doi/10.1371/journal.pone.0243801&rft_dat=%3Cgale_plos_%3EA649640695%3C/gale_plos_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2480724448&rft_id=info:pmid/33493179&rft_galeid=A649640695&rft_doaj_id=oai_doaj_org_article_ee7702528aeb478198c42df34e751eb0&rfr_iscdi=true