<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445359552</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317142911.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110301xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10100-009-0120-4</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10100-009-0120-4</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">On the classical Maki-Thompson rumour model in continuous time</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Selma Belen, Erik Kropat, Gerhard-Wilhelm Weber]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In this paper, the Maki-Thompson model is slightly refined in continuous time, and a new general solution is obtained for each dynamics of spreading of a rumour. It is derived an equation for the size of a stochastic rumour process in terms of transitions. We give new lower and upper bounds for the proportion of total ignorants who never learned a rumour and the proportion of total stiflers who either forget the rumour or cease to spread the rumour when the rumour process stops, under general initial conditions. Simulation results are presented for the analytical solutions. The model and these numerical results are capable to explain the behaviour of the dynamics of any other dynamical system having interactions similar to the ones in the stochastic rumour process and requiring numerical interpretations to understand the real phenomena better. The numerical process in the differential equations of the model is investigated by using error-estimates. The estimated error is calculated by the Runge-Kutta method and found either negligible or zero for a relatively small size of the population. This pioneering paper introduces a new mathematical method into Operations research, motivated by various areas of scientific, social and daily life, it presents numerical computations, discusses structural frontiers and invites the interested readers to future research.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag, 2009</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Rumours</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Maki-Thompson model</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Stochastic process</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Dynamical systems</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Lambert- w function</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Operations research</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Belen</subfield>
   <subfield code="D">Selma</subfield>
   <subfield code="u">Department of Mathematics and Computer, CAG University, 33800, Yenice-Tarsus, Mersin, Turkey</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Kropat</subfield>
   <subfield code="D">Erik</subfield>
   <subfield code="u">Institute for Theoretical Computer Science, Mathematics, and Operations Research, Universität der Bundeswehr München, 85577, Neubiberg, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Weber</subfield>
   <subfield code="D">Gerhard-Wilhelm</subfield>
   <subfield code="u">Institute of Applied Mathematics, Middle East Technical University, 06531, Ankara, Turkey</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Central European Journal of Operations Research</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">19/1(2011-03-01), 1-17</subfield>
   <subfield code="x">1435-246X</subfield>
   <subfield code="q">19:1&lt;1</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">10100</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10100-009-0120-4</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s10100-009-0120-4</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Belen</subfield>
   <subfield code="D">Selma</subfield>
   <subfield code="u">Department of Mathematics and Computer, CAG University, 33800, Yenice-Tarsus, Mersin, Turkey</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Kropat</subfield>
   <subfield code="D">Erik</subfield>
   <subfield code="u">Institute for Theoretical Computer Science, Mathematics, and Operations Research, Universität der Bundeswehr München, 85577, Neubiberg, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Weber</subfield>
   <subfield code="D">Gerhard-Wilhelm</subfield>
   <subfield code="u">Institute of Applied Mathematics, Middle East Technical University, 06531, Ankara, Turkey</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Central European Journal of Operations Research</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">19/1(2011-03-01), 1-17</subfield>
   <subfield code="x">1435-246X</subfield>
   <subfield code="q">19:1&lt;1</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">10100</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
