Competing Complex Information Spreading in Multiplex Social Network

Algorithm 1

Competing spreading dynamics.

(1)	Input: network , and dynamical parameters , , , ;
(2)	Output: spreading sizes of information and and denoted as and ;
(3)	;
(4)	Randomly a seed for information and , and put them into queue ;
(5)	while is not empty do
(6)	;
(7)	;
(8)	Initialize to be empty;
(9)	;
(10)	for to do
(11)	if Node adopt the information then Node transmits the information to every susceptible neighbor in subnetwork with probability ;
(12)	if Node received the information successfully then
(13)	;
(14)	end if
(15)	end if
(16)	if Node adopt the information then
(17)	Node transmits the information to every susceptible neighbor in subnetwork with probability ;
(18)	if Node received the information successfully then
(19)	;
(20)	end if
(21)	end if
(22)	if and then
(23)	Node adopts information with probability ;
(24)	if Node adopts information then
(25)	Adding node into queue ;
(26)	end if
(27)	Node adopts information with probability ;
(28)	if Node adopts information then
(29)	Adding node into queue ;
(30)	end if
(31)	end if
(32)	if and then
(33)	Node adopts information with probability 1;
(34)	Adding node into queue ;
(35)	end if
(36)	if and then
(37)	Node adopts information with probability 1;
(38)	Adding node into queue ;
(39)	end if
(40)	end for
(41)	for to do
(42)	Recovering node with probability ;
(43)	if Node recovers then
(44)	Delete node from queue ;
(45)	end if
(46)	end for
(47)	for to do
(48)	Adding node to queue ;
(49)	Deleting node from queue ;
(50)	end for
(51)
(52)	end while