### Abstract

Knowing the extent of influence an agent exerts over the other agents over online social networks such as Twitter and Facebook is important as it helps identify opinion leaders and predict how opinions are likely to evolve. However, this information regarding the extent of influence exerted by agents on each other is difficult to obtain as it is unobservable and the data available to estimate it is scarce, often incomplete, and noisy. Further, the number of unknown parameters that need to be estimated to infer the extent of influence between any given pair of agents is very large. A particle-learning-based algorithm is proposed to estimate the influence matrix that indicates the extent of influence any agent exerts on any other in a social network. Computational studies have been used to determine the efficiency, learning rates and asymptotic properties, and robustness (to missing information) of the proposed particle learning algorithms. The results indicate that the proposed algorithm shows fast convergence rates, yields efficient estimates of the influence matrix, is scalable, and is robust to incomplete information. Further, the network topology, and not just the network size, impacts the learning rate. The learning rate also slows down as the percentage of missing information increases.

Original language | English (US) |
---|---|

Pages (from-to) | 1-18 |

Number of pages | 18 |

Journal | Computational Statistics and Data Analysis |

Volume | 126 |

DOIs | |

State | Published - Oct 1 2018 |

### Fingerprint

### Keywords

- Influence estimation
- Learning
- Opinion dynamics
- Particle filter
- Social networks

### ASJC Scopus subject areas

- Statistics and Probability
- Computational Mathematics
- Computational Theory and Mathematics
- Applied Mathematics

### Cite this

**A particle-learning-based approach to estimate the influence matrix of online social networks.** / Castro, Luis E.; Shaikh, Nazrul I.

Research output: Contribution to journal › Article

}

TY - JOUR

T1 - A particle-learning-based approach to estimate the influence matrix of online social networks

AU - Castro, Luis E.

AU - Shaikh, Nazrul I

PY - 2018/10/1

Y1 - 2018/10/1

N2 - Knowing the extent of influence an agent exerts over the other agents over online social networks such as Twitter and Facebook is important as it helps identify opinion leaders and predict how opinions are likely to evolve. However, this information regarding the extent of influence exerted by agents on each other is difficult to obtain as it is unobservable and the data available to estimate it is scarce, often incomplete, and noisy. Further, the number of unknown parameters that need to be estimated to infer the extent of influence between any given pair of agents is very large. A particle-learning-based algorithm is proposed to estimate the influence matrix that indicates the extent of influence any agent exerts on any other in a social network. Computational studies have been used to determine the efficiency, learning rates and asymptotic properties, and robustness (to missing information) of the proposed particle learning algorithms. The results indicate that the proposed algorithm shows fast convergence rates, yields efficient estimates of the influence matrix, is scalable, and is robust to incomplete information. Further, the network topology, and not just the network size, impacts the learning rate. The learning rate also slows down as the percentage of missing information increases.

AB - Knowing the extent of influence an agent exerts over the other agents over online social networks such as Twitter and Facebook is important as it helps identify opinion leaders and predict how opinions are likely to evolve. However, this information regarding the extent of influence exerted by agents on each other is difficult to obtain as it is unobservable and the data available to estimate it is scarce, often incomplete, and noisy. Further, the number of unknown parameters that need to be estimated to infer the extent of influence between any given pair of agents is very large. A particle-learning-based algorithm is proposed to estimate the influence matrix that indicates the extent of influence any agent exerts on any other in a social network. Computational studies have been used to determine the efficiency, learning rates and asymptotic properties, and robustness (to missing information) of the proposed particle learning algorithms. The results indicate that the proposed algorithm shows fast convergence rates, yields efficient estimates of the influence matrix, is scalable, and is robust to incomplete information. Further, the network topology, and not just the network size, impacts the learning rate. The learning rate also slows down as the percentage of missing information increases.

KW - Influence estimation

KW - Learning

KW - Opinion dynamics

KW - Particle filter

KW - Social networks

UR - http://www.scopus.com/inward/record.url?scp=85046630239&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85046630239&partnerID=8YFLogxK

U2 - 10.1016/j.csda.2018.01.008

DO - 10.1016/j.csda.2018.01.008

M3 - Article

AN - SCOPUS:85046630239

VL - 126

SP - 1

EP - 18

JO - Computational Statistics and Data Analysis

JF - Computational Statistics and Data Analysis

SN - 0167-9473

ER -