Zobrazeno 1 - 10
of 878
pro vyhledávání: '"Zhang, Zhongzhi"'
The forest matrix plays a crucial role in network science, opinion dynamics, and machine learning, offering deep insights into the structure of and dynamics on networks. In this paper, we study the problem of querying entries of the forest matrix in
Externí odkaz:
http://arxiv.org/abs/2409.05503
Autor:
Xia, Haisong, Zhang, Zhongzhi
Kemeny's constant for random walks on a graph is defined as the mean hitting time from one node to another selected randomly according to the stationary distribution. It has found numerous applications and attracted considerable research interest. Ho
Externí odkaz:
http://arxiv.org/abs/2409.05471
The \textit{biharmonic distance} (BD) is a fundamental metric that measures the distance of two nodes in a graph. It has found applications in network coherence, machine learning, and computational graphics, among others. In spite of BD's importance,
Externí odkaz:
http://arxiv.org/abs/2408.13538
A signed graph offers richer information than an unsigned graph, since it describes both collaborative and competitive relationships in social networks. In this paper, we study opinion dynamics on a signed graph, based on the Friedkin-Johnsen model.
Externí odkaz:
http://arxiv.org/abs/2407.10680
Consider a directed network where each node is either red (using the red product), blue (using the blue product), or uncolored (undecided). Then in each round, an uncolored node chooses red (resp. blue) with some probability proportional to the numbe
Externí odkaz:
http://arxiv.org/abs/2312.15819
Autor:
Xu, Wanyue, Zhang, Zhongzhi
Opinion dynamics is a central subject of computational social science, and various models have been developed to understand the evolution and formulation of opinions. Existing models mainly focus on opinion dynamics on graphs that only capture pairwi
Externí odkaz:
http://arxiv.org/abs/2310.05689
The diagonal entries of pseudoinverse of the Laplacian matrix of a graph appear in many important practical applications, since they contain much information of the graph and many relevant quantities can be expressed in terms of them, such as Kirchho
Externí odkaz:
http://arxiv.org/abs/2310.05527
The grounded Laplacian matrix $\LL_{-S}$ of a graph $\calG=(V,E)$ with $n=|V|$ nodes and $m=|E|$ edges is a $(n-s)\times (n-s)$ submatrix of its Laplacian matrix $\LL$, obtained from $\LL$ by deleting rows and columns corresponding to $s=|S| \ll n $
Externí odkaz:
http://arxiv.org/abs/2309.17019
Critical nodes in networks are extremely vulnerable to malicious attacks to trigger negative cascading events such as the spread of misinformation and diseases. Therefore, effective moderation of critical nodes is very vital for mitigating the potent
Externí odkaz:
http://arxiv.org/abs/2309.06392
Maximizing influences in complex networks is a practically important but computationally challenging task for social network analysis, due to its NP- hard nature. Most current approximation or heuristic methods either require tremendous human design
Externí odkaz:
http://arxiv.org/abs/2309.07153