using principal eigenvectors of laplacian-plus matrix to identify spreaders of social networks under linear threshold diffusion model

Influence maximization (im) is a challenging problem in social networks to identify initial spreaders with the best influence on other nodes. it is a need to solve this problem with the minimum diffusion time and the most coverage on the communities. however, the spreaders are rarely dependent on diffusion models. a recent research [n. binesh, m. ghatee, distance-aware optimization model for influential nodes identification in social networks with independent cascade diffusion, information sciences, 581 (2021) 88-105] proposed dasf algorithm for spreaders selection by the independent cascade (ic) diffusion model. here, we present a new optimization model to find spreaders under linear threshold (lt) diffusion model. lt is one of the most important models to imitate the behavior of influence propagation in social networks. our model is a quadratic programming problem based on laplacianplus matrix. we derive its solution by some principal eigenvectors of laplacian-plus matrix. we organize the solution process as dalt algorithm. without community detection, it can identify the spreaders with maximum inter-communities distance, minimum intra-communities distance, and the most significant degrees. by considering various well-known social networks, we show that dalt provides brilliant results and overcomes other local and global spreader finders, especially in social networks with community structures.