Finding Influential Nodes in Complex Networks

Please enable javascript in your browser.

Barazandeh Shirvan, Amin | 2013

588 Viewed

Type of Document: M.Sc. Thesis
Language: English
Document No: 44526 (52)
University: Sharif University of Technology, International Campus, Kish Island
Department: Science and Engineering
Advisor(s): Jalili, Mahdi
Abstract:
The modern science of networks helps us to have a better understanding of complex systems. Networked systems can be found everywhere and many systems can be represented by a complex network. A networked structure consists of a number of nodes and links connecting to them. Networks’ ability in information propagation is one of their amazing features that have attracted lots of scholars to work on. It has potential applications in many fields ranging from marketing to biology, epidemiology and sociology. Information propagation studies how information such as computer viruses, contagion, rumor, or new product’s interest propagates over a network. Percolation theory and various epidemic models have been frequently used to explain information propagation in networks. In this research, we will introduced a new five stage model for epidemic spreading, and analyzing this model into different random graphs, scale-free and small-world networks and studying on the methods for finding the most influential actor in our model
Keywords:
Diffusion Coefficient ; Complex Network ; Information Leakage ; Epidemiology ; Graph Theory

No TOC