Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
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...
[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...
RLIM: Representation Learning Method for Influence Maximization in social networks
RLIM: Representation Learning Method for Influence Maximization in social networks
Abstract A core issue in influence propagation is influence maximization, which aims to find a group of nodes under a specific information diffusion model and maximize the ...
On the role of network dynamics for information processing in artificial and biological neural networks
On the role of network dynamics for information processing in artificial and biological neural networks
Understanding how interactions in complex systems give rise to various collective behaviours has been of interest for researchers across a wide range of fields. However, despite ma...
Understanding topological phases of matter with statistical methods
Understanding topological phases of matter with statistical methods
Topological phases set themselves apart from other phases since they cannot be understood in terms of the usual Landau theory of phase transitions. This fact, which is a consequenc...
Floquet topological physics in photonics
Floquet topological physics in photonics
Floquet topological physics, an area exploring periodically driven systems and leveraging degrees of freedoms in the temporal dimension, has opened new avenues in photonics by enab...

Back to Top