<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
    <record>
        <controlfield tag="001">75620</controlfield>
        <controlfield tag="005">20191127155458.0</controlfield>
        <datafield tag="024" ind1="7" ind2=" ">
            <subfield code="2">doi</subfield>
            <subfield code="a">10.1093/comnet/cnx024</subfield>
        </datafield>
        <datafield tag="024" ind1="8" ind2=" ">
            <subfield code="2">sideral</subfield>
            <subfield code="a">105221</subfield>
        </datafield>
        <datafield tag="037" ind1=" " ind2=" ">
            <subfield code="a">ART-2018-105221</subfield>
        </datafield>
        <datafield tag="041" ind1=" " ind2=" ">
            <subfield code="a">eng</subfield>
        </datafield>
        <datafield tag="100" ind1=" " ind2=" ">
            <subfield code="a">de Arruda, G.F.</subfield>
        </datafield>
        <datafield tag="245" ind1=" " ind2=" ">
            <subfield code="a">A general Markov chain approach for disease and rumour spreading in complex networks</subfield>
        </datafield>
        <datafield tag="260" ind1=" " ind2=" ">
            <subfield code="c">2018</subfield>
        </datafield>
        <datafield tag="506" ind1="0" ind2=" ">
            <subfield code="a">Access copy available to the general public</subfield>
            <subfield code="f">Unrestricted</subfield>
        </datafield>
        <datafield tag="520" ind1="3" ind2=" ">
            <subfield code="a">Spreading processes are ubiquitous in natural and artificial systems. They can be studied via a plethora of models, depending on the specific details of the phenomena under study. Disease contagion and rumour spreading are among the most important of these processes due to their practical relevance. However, despite the similarities between them, current models address both spreading dynamics separately. In this article, we propose a general spreading model that is based on discrete time Markov chains. The model includes all the transitions that are plausible for both a disease contagion process and rumour propagation. We show that our model not only covers the traditional spreading schemes but that it also contains some features relevant in social dynamics, such as apathy, forgetting, and lost/recovering of interest. The model is evaluated analytically to obtain the spreading thresholds and the early time dynamical behaviour for the contact and reactive processes in several scenarios. Comparison with Monte Carlo simulations shows that the Markov chain formalism is highly accurate while it excels in computational efficiency. We round off our work by showing how the proposed framework can be applied to the study of spreading processes occurring on social networks.</subfield>
        </datafield>
        <datafield tag="536" ind1=" " ind2=" ">
            <subfield code="9">info:eu-repo/grantAgreement/ES/MINECO/FIS2014-55867-P</subfield>
            <subfield code="9">info:eu-repo/grantAgreement/EC/FP7/317532/EU/Foundational Research on MULTIlevel comPLEX networks and systems/MULTIPLEX</subfield>
            <subfield code="9">info:eu-repo/grantAgreement/ES/DGA/FENOL-GROUP</subfield>
        </datafield>
        <datafield tag="540" ind1=" " ind2=" ">
            <subfield code="9">info:eu-repo/semantics/openAccess</subfield>
            <subfield code="a">All rights reserved</subfield>
            <subfield code="u">http://www.europeana.eu/rights/rr-f/</subfield>
        </datafield>
        <datafield tag="592" ind1=" " ind2=" ">
            <subfield code="a">0.608</subfield>
            <subfield code="b">2018</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Applied Mathematics</subfield>
            <subfield code="c">2018</subfield>
            <subfield code="d">Q1</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Computational Mathematics</subfield>
            <subfield code="c">2018</subfield>
            <subfield code="d">Q1</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Management Science and Operations Research</subfield>
            <subfield code="c">2018</subfield>
            <subfield code="d">Q1</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Control and Optimization</subfield>
            <subfield code="c">2018</subfield>
            <subfield code="d">Q1</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Computer Networks and Communications</subfield>
            <subfield code="c">2018</subfield>
            <subfield code="d">Q1</subfield>
        </datafield>
        <datafield tag="655" ind1=" " ind2="4">
            <subfield code="a">info:eu-repo/semantics/article</subfield>
            <subfield code="v">info:eu-repo/semantics/publishedVersion</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="a">Rodrigues, F.A.</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="a">Rodriguez, P.M.</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="0">(orcid)0000-0002-5655-1587</subfield>
            <subfield code="a">Cozzo, E.</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="0">(orcid)0000-0002-0895-1893</subfield>
            <subfield code="a">Moreno, Y.</subfield>
            <subfield code="u">Universidad de Zaragoza</subfield>
        </datafield>
        <datafield tag="710" ind1="2" ind2=" ">
            <subfield code="1">2004</subfield>
            <subfield code="2">405</subfield>
            <subfield code="a">Universidad de Zaragoza</subfield>
            <subfield code="b">Dpto. Física Teórica</subfield>
            <subfield code="c">Área Física Teórica</subfield>
        </datafield>
        <datafield tag="773" ind1=" " ind2=" ">
            <subfield code="g">6, 2 (2018), 215-242</subfield>
            <subfield code="p">J. complex. netw</subfield>
            <subfield code="t">JOURNAL OF COMPLEX NETWORKS</subfield>
            <subfield code="x">2051-1310</subfield>
        </datafield>
        <datafield tag="856" ind1="4" ind2=" ">
            <subfield code="s">1434706</subfield>
            <subfield code="u">http://zaguan.unizar.es/record/75620/files/texto_completo.pdf</subfield>
            <subfield code="y">Versión publicada</subfield>
        </datafield>
        <datafield tag="856" ind1="4" ind2=" ">
            <subfield code="s">69915</subfield>
            <subfield code="u">http://zaguan.unizar.es/record/75620/files/texto_completo.jpg?subformat=icon</subfield>
            <subfield code="x">icon</subfield>
            <subfield code="y">Versión publicada</subfield>
        </datafield>
        <datafield tag="909" ind1="C" ind2="O">
            <subfield code="o">oai:zaguan.unizar.es:75620</subfield>
            <subfield code="p">articulos</subfield>
            <subfield code="p">driver</subfield>
        </datafield>
        <datafield tag="951" ind1=" " ind2=" ">
            <subfield code="a">2019-11-27-15:48:40</subfield>
        </datafield>
        <datafield tag="980" ind1=" " ind2=" ">
            <subfield code="a">ARTICLE</subfield>
        </datafield>
    </record>

    
</collection>