Volume 38 | Number 2 | Year 2016 | Article Id. IJMTT-V38P518 | DOI : https://doi.org/10.14445/22315373/IJMTT-V38P518
This Research report aims to analyze how graph theory can be applied to rumor propagation in limited social settings with a special emphasis on schools. In this paper, a modified Nearest Neighbour Algorithm has been used to reach a probabilistic weight for the edges of an Eulerian Graph and an equation has been proposed for the same, which is intended to complement the SIR model used to normally study rumor propagation by focusing on the propagated content, instead of the propagators.
[1] http://topologydrexel.wikispaces.com/Seven+Bridges
[2]http://www.slideshare.net/Tech_MX/graph-theory-1
[3]http://www.merriam-webster.com/dictionary/rumor
[4]https://www.techopedia.com/definition/4993/network-map
[5]http://pc57724.uni-regensburg.de/morgan/teaching/CS104-Social_Networking.pdf
[6]http://www.austincc.edu/powens/+Topics/HTML/06-5/06-5.htm
[7]https://www.cs.auckland.ac.nz/software/AlgAnim/dijkstra.html
[8]http://www.academic-journals.org/ojs2/index.php/IJCSE/article/viewFile/759/18
[9] http://astarmathsandphysics.com/a-level-maths-notes/191-d1/3332-eulerian-graphs.html
[10]http://www.sciencedaily.com/releases/2008/10/081009144325.htm
[11] http://www.telegraph.co.uk/news/science/science-news/3660232/Academics-invent-a-mathematical-equation-for-whypeople- procrastinate.html
[12]Olles, Deana B., "Rumor propagation on random and small world networks" (2006). Thesis. Rochester Institute of Technology
[13]http://www.hindawi.com/journals/mpe/2010/631357/
[14] http://arxiv.org/pdf/1208.6063.pdf
[15]Polled aspects were added after an a large group of students independently submitted the factors they thought could be relevant to the study.
Tanmay Chopra, "Analyzing Rumor Propagation through Graph Theory," International Journal of Mathematics Trends and Technology (IJMTT), vol. 38, no. 2, pp. 106-110, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V38P518