Social Networks, Diffusion Processes in

Author(s):  
Dmitry Zinoviev

The issue of information diffusion in small-world social networks was first systematically brought to light by Mark Granovetter in his seminal paper “The Strength of Weak Ties” in 1973 and has been an area of active academic studies in the past three decades. This chapter discusses information proliferation mechanisms in massive online social networks (MOSN). In particular, the following aspects of information diffusion processes are addressed: the role and the strategic position of influential spreaders of information; the pathways in the social networks that serve as conduits for communication and information flow; mathematical models describing proliferation processes; short-term and long-term dynamics of information diffusion, and secrecy of information diffusion.


Author(s):  
Shaojie Tang ◽  
Siyuan Liu ◽  
Xu Han ◽  
Yu Qiao

Recently, diffusion processes in social networks have attracted increasing attention within computer science, marketing science, social sciences, and political science. Although the majority of existing works focus on maximizing the reach of desirable diffusion processes, we are interested in deploying a group of monitors to detect malicious diffusion processes such as the spread of computer worms. In this work, we introduce and study the [Formula: see text]-Monitoring Game} on networks. Our game is composed of two parties an attacker and a defender. The attacker can launch an attack by distributing a limited number of seeds (i.e., virus) to the network. Under our [Formula: see text]-Monitoring Game, we say an attack is successful if and only if the following two conditions are satisfied: (1) the outbreak/propagation reaches at least α individuals without intervention, and (2) it has not been detected before reaching β individuals. Typically, we require that β is no larger than α in order to compensate the reaction delays after the outbreak has been detected. On the other end, the defender’s ultimate goal is to deploy a set of monitors in the network that can minimize attacker’s success ratio in the worst-case. (We also extend the basic model by considering a noisy diffusion model, where the propagation probabilities on each edge could vary within an interval.) Our work is built upon recent work in security games, our adversarial setting provides robust solutions in practice. Summary of Contribution: Although the diffusion processes in social networks have been extensively studied, most existing works aim at maximizing the reach of desirable diffusion processes. We are interested in deploying a group of monitors to detect malicious diffusion processes, such as the spread of computer worms. To capture the impact of model uncertainty, we consider a noisy diffusion model in which the propagation probabilities on each edge could vary within an interval. Our work is built upon recent work in security games; our adversarial setting leads to robust solutions in practice.


1976 ◽  
Vol 32 ◽  
pp. 109-116 ◽  
Author(s):  
S. Vauclair

This paper gives the first results of a work in progress, in collaboration with G. Michaud and G. Vauclair. It is a first attempt to compute the effects of meridional circulation and turbulence on diffusion processes in stellar envelopes. Computations have been made for a 2 Mʘstar, which lies in the Am - δ Scuti region of the HR diagram.Let us recall that in Am stars diffusion cannot occur between the two outer convection zones, contrary to what was assumed by Watson (1970, 1971) and Smith (1971), since they are linked by overshooting (Latour, 1972; Toomre et al., 1975). But diffusion may occur at the bottom of the second convection zone. According to Vauclair et al. (1974), the second convection zone, due to He II ionization, disappears after a time equal to the helium diffusion time, and then diffusion may happen at the bottom of the first convection zone, so that the arguments by Watson and Smith are preserved.


Sign in / Sign up

Export Citation Format

Share Document