Priyanshi Garg

Priyanshi Garg

Auto-generated profile, based on publicly available information

Priyanshi Garg

University of Texas at Dallas

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 July 2023 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
RJRong Jin
Rong Jin
PGPriyanshi Garg
Priyanshi Garg
WWWeili Wu
Weili Wu
QNQiufen Ni
Qiufen Ni
Rosanna Elizabeth GuadagnoRosanna Elizabeth Guadagno
Rosanna Elizabeth Guadagno
In monitoring station observation, for the best accuracy of rumor source detection, it is important to deploy monitors appropriately into the network. There are, however, a very limited number of studies on the monitoring station selection. This article will study the problem of detecting a single rumormonger based on an observation of selected infection monitoring stations in a complete snapshot taken at some time in an online social network (OSN) following the independent cascade (IC) model. To deploy monitoring stations into the observed network, we propose an influence-distance-based $k$ -station selection method where the influence distance is a conceptual measurement that estimates the probability that a rumor-infected node can influence its uninfected neighbors. Accordingly, a greedy algorithm is developed to find the best $k$ monitoring stations among all rumor-infected nodes with a 2-approximation. Based on the infection path, which is most likely toward the $k$ infection monitoring stations, we derive that an estimator for the “most like” rumor source under the IC model is the Jordan infection center in a graph. Our theoretical analysis is presented in the article. The effectiveness of our method is verified through experiments over both synthetic and real-world datasets. As shown in the results, our $k$ -station selection method outperforms off-the-shelf methods in most cases in the network under the IC model.

20 June 2022 in Discrete Mathematics, Algorithms and Applications
Verified
Journal Article
Open access
PDF file
PGPriyanshi Garg
Priyanshi Garg
WWWeili Wu
Weili Wu
The use of social media has generated huge Online Social Networks (OSN). This network exhibits nice structural properties and has opened door to various research tasks like community detection, link prediction and influence modeling in OSN. There are several models such as linear threshold and independent cascade model proposed in the literature that models the influence diffusion process. Depending on the use-case one may want to amplify or attenuate information in OSN called influence maximization (IM) and rumor blocking (RB), respectively. In terms of marketing, it is called viral marketing. This paper extensively reviews the fundamental research tasks associated with the structure of OSN, groups them into different categories based on the fundamental research area discussed along with its applications. This paper also surveys RB and the various variants of IM found in the literature.

21 July 2023
Verified
Book Chapter
Closed access
PDF file
KSKe Su
Ke Su
PGPriyanshi Garg
Priyanshi Garg
WWWeili Wu
Weili Wu
Ding-Zhu DuDing-Zhu Du
Ding-Zhu Du