TY - GEN
T1 - A method for discovering dynamic network motifs by encoding topic propagation
AU - Barash, Vladimir
AU - Milic-Frayling, Natasa
AU - Smith, Marc A.
PY - 2013
Y1 - 2013
N2 - Marketing campaigns using social media services aim to exploit social connections to propagate messages to potential customers. However, social activities often give rise to multiple network structures and some may be more effective in achieving the communication objectives than others. This led us to investigate a problem: given an observed sequence of messages and a social network that includes individuals involved in messaging, does the network structure 'explain' the observed propagation. To facilitate this investigation, we designed a method for encoding propagation events relative to the structure of a given network. The resulting transmission codes capture both the temporal and the structural characteristics of the propagation. We analyze the codes for maximal repeats and k-common substrings to uncover dynamic network motifs within the propagation trace. By considering the dynamic motifs and the connected graph components, we can determine how the propagation events relate to the specific network. As a case study, we applied our method to rumor topics in Twitter and analyzed their propagation trails relative to the 'follower' network. The study demonstrates the computational feasibility of our approach and illustrates the use of dynamic motifs to reason about the impact of follower relationship rumor propagation in Twitter.
AB - Marketing campaigns using social media services aim to exploit social connections to propagate messages to potential customers. However, social activities often give rise to multiple network structures and some may be more effective in achieving the communication objectives than others. This led us to investigate a problem: given an observed sequence of messages and a social network that includes individuals involved in messaging, does the network structure 'explain' the observed propagation. To facilitate this investigation, we designed a method for encoding propagation events relative to the structure of a given network. The resulting transmission codes capture both the temporal and the structural characteristics of the propagation. We analyze the codes for maximal repeats and k-common substrings to uncover dynamic network motifs within the propagation trace. By considering the dynamic motifs and the connected graph components, we can determine how the propagation events relate to the specific network. As a case study, we applied our method to rumor topics in Twitter and analyzed their propagation trails relative to the 'follower' network. The study demonstrates the computational feasibility of our approach and illustrates the use of dynamic motifs to reason about the impact of follower relationship rumor propagation in Twitter.
KW - Cascades
KW - Dynamic motifs
KW - Propagation
KW - Rumors
KW - Social networks
UR - http://www.scopus.com/inward/record.url?scp=84893257305&partnerID=8YFLogxK
U2 - 10.1109/WI-IAT.2013.64
DO - 10.1109/WI-IAT.2013.64
M3 - Conference contribution
AN - SCOPUS:84893257305
SN - 9781479929023
T3 - Proceedings - 2013 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2013
SP - 451
EP - 458
BT - Proceedings - 2013 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2013
T2 - 2013 12th IEEE/WIC/ACM International Conference on Web Intelligence, WI 2013
Y2 - 17 November 2013 through 20 November 2013
ER -