short-paper

Spreading rumours in Euclidean space

Authors:

Dieter Fiems,

Koen De TurckAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 41, Issue 2

Pages 50 - 52

https://doi.org/10.1145/2518025.2518035

Published: 27 August 2013 Publication History

Get Access

Abstract

This paper considers the process of spreading rumours in Euclidean space. The rumour (or epidemic) process under study includes (i) a discrete-time stochastic arrival process of new spatially distributed rumours and (ii) a stochastic process of linear transformations of the current rumours which allows for modelling mobility as well as dispersion of rumours. Inspired by linear filtering theory, an affine stochastic recursion in characteristic-function space is studied and numerical transform inversion is used to study the distribution of rumours in space.

References

[1]

E. Altman, D. Fiems. Expected waiting time in polling systems with correlated vacations. Queueing Systems 56(3-4):241--253, 2007.

Digital Library

Google Scholar

[2]

J. Cheng, Y. Liu, B. Shen, W. Yuan. An epidemic model of rumor diffusion in online social networks. European Physical Journal B 86.

Google Scholar

[3]

C.F. Coletti, P.M. Rodriguez, R.B. Schinazi. A Spatial Stochastic Model for Rumor Transmission. Journal of Statistical Physics 147(2):375--381, 2012.

Crossref

Google Scholar

[4]

E. De Cuypere, K. De Turck, S. Wittevrongel, D. Fiems, Markovian SIR model for opinion propagation, In: Proceedings of the 25th International Teletraffic Congress, Shanghai, 2013.

Google Scholar

[5]

V.V. Junior, F.P. Machado, M. Zuluaga. Rumor processes on N. Journal of Applied Probability 48(3):624--636, 2011.

Crossref

Google Scholar

[6]

D. Fiems, E. Altman. Gated polling with stationary ergodic walking times, Markovian routing and random feedback. Annals of Operations Research, 198(1):145--164, 2012.

Crossref

Google Scholar

[7]

A. Mitra, M. Maheswaran. Trusted gossip: A rumor resistant dissemination mechanism for peer-to-peer information sharing. In: Proc of 21st International Conference on Advanced Networking and Applications, pp. 702--707, 2007.

Digital Library

Google Scholar

[8]

H. Shokrzadeh, A.T. Haghighat, A. Nayebi. New routing framework base on rumor routing in wireless sensor networks Computer Communications 32(1):86--93, 2009.

Digital Library

Google Scholar

[9]

Y. Vigfusson, K. Birman, Q. Huang, D.P. Nataraj. GO: Platform Support For Gossip Applications. In: Proc of 9th International Conference on Peer-to-Peer Computing, pp. 222--231, 2009.

Google Scholar

[10]

L. Zhao, H. Cui, X. Qiu. X. Wang, J. Wang. SIR Rumour spreading model in the new media age. Physica A 392:995--1003, 2013.

Crossref

Google Scholar

Recommendations

A Study of Tweet Veracity to Separate Rumours from Counter-Rumours
#SMSociety17: Proceedings of the 8th International Conference on Social Media & Society

Rumours are known to propagate easily through computer-mediated communication channels such as Twitter. Their outbreak is often followed by the spread of 'counter-rumours', which are messages that debunk rumours. The probability of a tweet to be a ...
Are Rumors Always False?: Understanding Rumors Across Domains, Queries, and Ratings
Advanced Data Mining and Applications
Abstract
Rumors are increasingly becoming a critical issue on the Web threatening democracy, economics, and society on a global scale. With the advance of social media networks, people are sharing content in an unprecedented scale. This makes social ...
Spreading rumours without the network
COSN '14: Proceedings of the second ACM conference on Online social networks

In this paper we tackle the following question: is it possible to predict the characteristics of the evolution of an epidemic process in a social network on the basis of the degree distribution alone? We answer this question affirmatively for several ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 41, Issue 2

Special issue on the 31st international symposium on computer performance, modeling, measurements and evaluation (IFIPWG 7.3 Performance 2013)

September 2013

53 pages

ISSN:0163-5999

DOI:10.1145/2518025

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 August 2013

Published in SIGMETRICS Volume 41, Issue 2

Check for updates

Qualifiers

Short-paper

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
87
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Recommendations

A Study of Tweet Veracity to Separate Rumours from Counter-Rumours

Are Rumors Always False?: Understanding Rumors Across Domains, Queries, and Ratings

Spreading rumours without the network

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations