SearcharxivSearch

arXiv subjects

Chengye Zhao

Publications and source records attributed to Chengye Zhao.

4 recordsLinked to original sources

Link prediction in complex networks via fusing node centrality and local similarity indices

Local similarity indices are widely used in link prediction on complex networks owing to their low computational cost; however, in sparse networks they assign a zero score to every node pair lacking common neighbors, which severely limits their predictive power. A natural remedy is to fuse node centrality indices with local similarity indices: the former provide global importance for the node pair, while the latter capture fine-grained local topology, and the two can be combined into complementary scores within a unified framework. This paper uses PageRank and DomiRank as two representative centrality measures and constructs a centrality--local-similarity fusion framework. The PageRank-based fusion proposed by Charikhi is first generalized to seven classical local similarity indices, and the universality of its improvement is systematically verified on nine real-world network datasets. Furthermore, the DomiRank centrality is introduced to build the DR-MD series of fused indices under a unified weighting coefficient, which overcomes the drawback that the PageRank-based fusion requires index-by-index weight tuning. Results of five-fold cross-validation together with Wilcoxon signed-rank tests show that, under the unified experimental protocol, all DR-MD indices consistently outperform the corresponding local baselines and their PR-MD counterparts on all nine datasets ($p=0.002$), and that the improvements remain robust against perturbations of $\sigma$ and the weighting coefficients within the near-critical parameter plateau; in particular, DR-RA achieves an average AUC of 0.7084, surpassing global methods such as Katz and RWR as well as several advanced similarity indices. The framework is inherently extensible, and its fusion paradigm can be straightforwardly generalized to couple other node centrality indices with local similarity indices.

cs.SI

Generalizations and Applications of the Brown--Tufts Lemma

Brown and Tufts proved in 2014 the substitution formula for the domination polynomial under graph substitution (the lexicographic product), and used it to show that the closure of the domination roots is the whole complex plane. In this paper we undertake a systematic study of the extent to which this lemma extends to the most common domination variants. We first prove that the connected domination polynomial satisfies exactly the same substitution formula. We then show that the formula fails for both independent domination and total domination: for independent domination we give a counterexample and establish a corrected formula, and for total domination we exhibit a concrete counterexample. Finally, applying the substitution formula for the connected domination polynomial, we prove that the closure of the real connected domination roots is $(-\infty,0]$, and that the closure of the connected domination roots is the whole complex plane.

math.CO

Linear algorithms on Steiner domination of trees

A set of vertices $W$ in a connected graph $G$ is called a Steiner dominating set if $W$ is both Steiner and dominating set. The Steiner domination number $γ_{st}(G)$ is the minimum cardinality of a Steiner dominating set of $G$. A linear algorithm is proposed in this paper for finding a minimum Steiner dominating set for a tree $T$.

math.CO

Cooperation on the monte carlo rule Prison's dilemma game on the grid

In this paper, we investigate the prison's dilemma game with monte carlo rule in the view of the idea of the classic Monte Carlo method on the grid. Monte carlo rule is an organic combination of the current dynamic rules of individual policy adjustment, which not only makes full use of information but also reflects the individual's bounded rational behavior and the ambivalence between the pursuit of high returns and high risks. In addition, it also reflects the individual's behavioral execution preferences. The implementation of monte carlo rule brings an extremely good result, higher cooperation level and stronger robustness are achieved by comparing with the unconditional imitation rule, replicator dynamics rule and fermi rule. When analyse the equilibrium density of cooperators as a function of the temptation to defect, it appears a smooth transition between the mixed state of coexistence of cooperators and defectors and the pure state of defectors when enhancing the temptation, which can be perfectly characterized by the trigonometric behavior instead of the power-law behavior discovered in the pioneer's work. When discuss the relationship between the temptation to defect and the average returns of cooperators and defectors, it is found that cooperators' average returns is almost a constant throughout the whole temptation parameter ranges while defectors' decreases as the growth of temptation. Additionally, the insensitivity of cooperation level to the initial density of cooperators and the sensitivity to the social population have been both demonstrated.

cs.GT