{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:04Z","timestamp":1753893844218,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We consider the random phone call model introduced by Demers et al., which is a well-studied model for information dissemination on networks. One basic protocol in this model is the so-called Push protocol which proceeds in synchronous rounds. Starting with a single node which knows of a rumor, every informed node calls in each round a random neighbor and informs it of the rumor. The Push-Pull protocol works similarly, but additionally every uninformed node calls a random neighbor and may learn the rumor from it.It is well-known that both protocols need $\\Theta(\\log n)$ rounds to spread a rumor on a complete network with $n$ nodes. Here we are interested in how much the spread can be speeded by enabling nodes to make more than one call in each round. We propose a new model where the number of calls of a node is chosen independently according to a probability distribution $R$. We provide both lower and upper bounds on the rumor spreading time depending on statistical properties of $R$ such as the mean or the variance (if they exist). In particular, if $R$\u00a0follows a power law distribution with exponent $\\beta \\in (2,3)$, we show that the Push-Pull protocol spreads a rumor in $\\Theta(\\log \\log n)$ rounds. Moreover when $\\beta=3$,\u00a0the Push-Pull protocol spreads a rumor in $\\Theta(\\frac{ \\log n}{\\log\\log n})$ rounds.<\/jats:p>","DOI":"10.37236\/4314","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T00:32:29Z","timestamp":1578702749000},"source":"Crossref","is-referenced-by-count":6,"title":["Faster Rumor Spreading With Multiple Calls"],"prefix":"10.37236","volume":"22","author":[{"given":"Konstantinos","family":"Panagiotou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Pourmiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Sauerwald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2015,2,9]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i1p23\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i1p23\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T10:37:47Z","timestamp":1579257467000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v22i1p23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,9]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2015,1,2]]}},"URL":"https:\/\/doi.org\/10.37236\/4314","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2015,2,9]]},"article-number":"P1.23"}}