Javascript must be enabled to continue!
Influence Maximization Dynamics and Topological Order on Erdös-Rényi Networks
View through CrossRef
This paper concerns the study of the linear threshold model in random networks, specifically in Erdös-Rényi networks. In our approach, we consider an activation threshold defined by the expected value for the node degree and the associated influence activation mapping. According to these assumptions, we present a theoretical procedure for the linear threshold model, under fairly general conditions, regarding the topological structure of the networks and the activation threshold. Aiming at the dynamics of the influence maximization process, we analyze and discuss different choices for the seed set based on several centrality measures along with the state conditions for the procedure to trigger. The topological entropy established for Erdös-Rényi networks defines a topological order for this type of random networks. Sufficient conditions are presented for this topological entropy to be characterized by the spectral radius of the associated adjacency matrices. Consequently, a number of properties are proved. The threshold dynamics are analyzed through the relationship between the activation threshold and the topological entropy. Numerical studies are included to illustrate the theoretical results.
Title: Influence Maximization Dynamics and Topological Order on Erdös-Rényi Networks
Description:
This paper concerns the study of the linear threshold model in random networks, specifically in Erdös-Rényi networks.
In our approach, we consider an activation threshold defined by the expected value for the node degree and the associated influence activation mapping.
According to these assumptions, we present a theoretical procedure for the linear threshold model, under fairly general conditions, regarding the topological structure of the networks and the activation threshold.
Aiming at the dynamics of the influence maximization process, we analyze and discuss different choices for the seed set based on several centrality measures along with the state conditions for the procedure to trigger.
The topological entropy established for Erdös-Rényi networks defines a topological order for this type of random networks.
Sufficient conditions are presented for this topological entropy to be characterized by the spectral radius of the associated adjacency matrices.
Consequently, a number of properties are proved.
The threshold dynamics are analyzed through the relationship between the activation threshold and the topological entropy.
Numerical studies are included to illustrate the theoretical results.
Related Results
A tight Erdős-Pósa function for planar minors
A tight Erdős-Pósa function for planar minors
Let F be a family of graphs. Then for every graph G the maximum number of disjoint subgraphs of G, each isomorphic to a member of F, is at most the minimum size of a set of vertice...
Rényi Cross-Entropy Measures for Common Distributions and Processes with Memory
Rényi Cross-Entropy Measures for Common Distributions and Processes with Memory
Two Rényi-type generalizations of the Shannon cross-entropy, the Rényi cross-entropy and the Natural Rényi cross-entropy, were recently used as loss functions for the improved desi...
[RETRACTED] Keanu Reeves CBD Gummies v1
[RETRACTED] Keanu Reeves CBD Gummies v1
[RETRACTED]Keanu Reeves CBD Gummies ==❱❱ Huge Discounts:[HURRY UP ] Absolute Keanu Reeves CBD Gummies (Available)Order Online Only!! ❰❰= https://www.facebook.com/Keanu-Reeves-CBD-G...
Distinguishing between topological isomorphism and topological equivalence of power electronic converters
Distinguishing between topological isomorphism and topological equivalence of power electronic converters
In the process of deducing the topology of power electronic converters, scholars often use topological equivalence or topological isomorphism to identify topologies with different ...
Reprogrammable plasmonic topological insulators with ultrafast control
Reprogrammable plasmonic topological insulators with ultrafast control
Abstract
Topological photonics has revolutionized our understanding of light propagation, providing a remarkably robust way to manipulate light. Despite the intensive resea...
Generalized Topological Groupoids
Generalized Topological Groupoids
Our aim in this paper is to give the notion of generalized topological groupoid which is a generalization of the topological groupoid by
using the notion of generalized topology de...
Topological Reinforcement as a Principle of Modularity Emergence in Brain Networks
Topological Reinforcement as a Principle of Modularity Emergence in Brain Networks
Abstract
Modularity is a ubiquitous topological feature of structural brain networks at various scales. While a variety of potential mechanisms have been proposed, ...
ACM SIGCOMM computer communication review
ACM SIGCOMM computer communication review
At some point in the future, how far out we do not exactly know, wireless access to the Internet will outstrip all other forms of access bringing the freedom of mobility to the way...

