4 papers
Compute the edge p-Laplacian centrality for air traffic network
Loc Hoang Tran, Bao Nguyen Tran, Luong Anh Tuan Nguyen
The problem that we would like to solve in this paper is to compute the edge p-Laplacian centrality for the air traffic network. In this problem, instead of computing the edge p-La…
A new density limit for unanimity in majority dynamics on random graphs
Jeong Han Kim, BaoLinh Tran
Majority dynamics is a process on a simple, undirected graph with an initial Red/Blue color for every vertex of . Each day, each vertex updates its color following the major…
Fast exact recovery of noisy matrix from few entries: the infinity norm approach
BaoLinh Tran, Van Vu
The matrix recovery (completion) problem, a central problem in data science and theoretical computer science, is to recover a matrix from a relatively small sample of entries.…
The "Power of Few" Phenomenon: The Sparse Case
BaoLinh Tran, Van Vu
The "majority dynamics" process on a social network begins with an initial phase, where the individuals are split into two competing parties, Red and Blue. Every day, everyone upda…