<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-14T06:23:47Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2445/13288" metadataPrefix="qdc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2445/13288</identifier><datestamp>2025-11-19T20:26:11Z</datestamp><setSpec>com_2072_1057</setSpec><setSpec>col_2072_478822</setSpec><setSpec>col_2072_478917</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Percolation and epidemic thresholds in clustered networks</dc:title>
   <dc:creator>Serrano Moral, Ma. Ángeles (María Ángeles)</dc:creator>
   <dc:creator>Boguñá, Marián</dc:creator>
   <dc:subject>Física estadística</dc:subject>
   <dc:subject>Percolació (Física estadística)</dc:subject>
   <dc:subject>Statistical physics</dc:subject>
   <dc:subject>Percolation (Statistical physics)</dc:subject>
   <dcterms:abstract>We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant connected component, it cannot restore a finite percolation threshold. In turn, this implies the absence of an epidemic threshold in this class of networks, thus extending this result to a wide variety of real scale-free networks which shows a high level of transitivity. Our findings are in good agreement with numerical simulations.</dcterms:abstract>
   <dcterms:issued>2010-07-05T10:13:14Z</dcterms:issued>
   <dcterms:issued>2010-07-05T10:13:14Z</dcterms:issued>
   <dcterms:issued>2006</dcterms:issued>
   <dc:type>info:eu-repo/semantics/article</dc:type>
   <dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
   <dc:relation>Reproducció digital del document proporcionada per PROLA i http://dx.doi.org/10.1103/PhysRevLett.97.088701</dc:relation>
   <dc:relation>Physical Review Letters, 2006, vol. 97, núm. 8, p. 088701-1-088701-4</dc:relation>
   <dc:relation>http://dx.doi.org/10.1103/PhysRevLett.97.088701</dc:relation>
   <dc:rights>(c) American Physical Society, 2006</dc:rights>
   <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
   <dc:publisher>American Physical Society</dc:publisher>
   <dc:source>Articles publicats en revistes (Física de la Matèria Condensada)</dc:source>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>