Search arXivSearch

arXiv subjects

Chengye Zhao

Publications and source records attributed to Chengye Zhao.

4 recordsLinked to original sources

On the Roots of Connected Domination Polynomials

We determine the closure of the connected domination roots. The main tool is a substitution formula for the lexicographic product with a complete graph, $D_c(G[K_n],x)=D_c(G,(x+1)^n-1)$, proved in Theorem~\ref{thm:cd}. Combined with two explicit families of seed roots---the real roots of the cycles $C_n$ and the real roots of the joins $C_m\vee C_n$ lying in $(-1,0)$---this formula gives the two main results: the closure of the real connected domination roots is $(-\infty,0]$, and the closure of all connected domination roots is the whole complex plane. These are the connected domination analogues of the root-density theorems of Brown and Tufts and of Brown and Beaton for the ordinary domination polynomial.

math.CO

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

Local similarity indices assign zero scores to node pairs without common neighbors, which limits link prediction in sparse networks; fusing node centrality with local similarity is a common remedy, but existing fusion studies use heterogeneous protocols and the robustness of their gains is unclear. Within a unified piecewise fusion framework (multiplicative modulation when local information is sufficient, small-dose completion when it is absent), we show that the dynamic range of the centrality product governs the modulation mechanism: the PageRank product is of order O(n^-2), so its factor degenerates to a near-identity map. Under a fair protocol with exhaustive negative-sample comparison on eight real-world networks, PageRank fusion therefore yields no consistent significant gain for six of the seven local indices; its single exception, a gain of about +0.035 on the near-tree-like wiki-Vote network, comes entirely from completion, indicating that the completion gain depends on both the fraction of zero-score node pairs and the standalone predictive power of the centrality product. The min-max normalized DomiRank product, with an O(1) range, instead gives stable gains under unified parameters (modulation weight 5, completion coefficient 0.1): all seven fused indices improve significantly at the fold level (p <= 3.3e-3), and a 10x5 repeated cross-validation confirms robustness to the randomness of fold partitions. DR-RA reaches an average AUC of 0.9257, surpassing Katz, LNB, CN2D, CNC, CND, SimRank, CCPA, Gravity and CNPop, and comparable to RWR. The design rules obtained for the two mechanisms (completion coefficient at most 0.3, modulation weight in [0.5,12], competition intensity near critical) provide a reproducible protocol benchmark and quantitative parameter design principles for the centrality x local-similarity fusion paradigm.

cs.SI

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