{'fraction_non_alphanumeric': 0.014652014652014652, 'fraction_numerical': 0.0, 'mean_word_length': 5.259541984732825, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On the linear threshold model for diffusion of innovations in multiplex social networks

Diffusion of innovations in social networks has been studied using the linear threshold model. These studies assume monoplex networks, where all connections are treated equally. To reflect the influence of different kinds of connections within social groups, we consider multiplex networks, which allow multiple layers of connections for a given set of nodes. We extend the linear threshold model to multiplex networks by designing protocols that combine signals from different layers. To analyze these protocols, we generalize the definition of live-edge models and reachability to the duplex setting. We introduce the live-edge tree and with it an algorithm to compute cascade centrality of individual nodes in a duplex network.