Convergence property of a class of variable metric methods. - Zhongzhi Zhang; Ding-Hua Cao; Jinping Zeng (Appl. Math. Lett., 2004)

Least-squares solutions of inverse problem for hermitian generalized Hamiltonian matrices. - Zhongzhi Zhang; Xi-Yan Hu; Lei Zhang 010 (Appl. Math. Lett., 2004)

On the Hermitian-Generalized Hamiltonian Solutions of Linear Matrix Equations. - Zhongzhi Zhang; Xi-Yan Hu; Lei Zhang 010 (SIAM J. Matrix Anal. Appl., 2005)

Self-similar planar graphs as models for complex networks. - Lichao Chen; Francesc Comellas; Zhongzhi Zhang (IWOCA, 2008)

Complex networks and computing. - Shuigeng Zhou; Zhongzhi Zhang (Frontiers Comput. Sci. China, 2009)

Impact of degree heterogeneity on the behavior of trapping in Koch networks - Zhongzhi Zhang; Shuyang Gao; Wenlei Xie (CoRR, 2010)

A evolutionary method for finding communities in bipartite networks - Weihua Zhan; Zhongzhi Zhang; Jihong Guan; Shuigeng Zhou (CoRR, 2010)

Farey graphs as models for complex networks. - Zhongzhi Zhang; Francesc Comellas (Theor. Comput. Sci., 2011)

The Number of Spanning Trees of an Infinite Family of Outerplanar, Small-World and Self-Similar Graphs - Francesc Comellas; Alicia Miralles; Hongxiao Liu; Zhongzhi Zhang (CoRR, 2012)

The number of spanning trees in Apollonian networks. - Zhongzhi Zhang; Bin Wu; Francesc Comellas (Discret. Appl. Math., 2014)

Small-World Topology Can Significantly Improve the Performance of Noisy Consensus in a Complex Network. - Yuhao Yi; Zhongzhi Zhang; Yuan Lin 003; Guanrong Chen (Comput. J., 2015)

Corona Graph as a Small-world Model. - Qian Lv; Yuhao Yi; Zhongzhi Zhang (CoRR, 2015)

Pfaffian orientations and perfect matchings of scale-free networks. - Zhongzhi Zhang; Bin Wu (Theor. Comput. Sci., 2015)

On the spectrum of the normalized Laplacian of iterated triangulations of graphs. - Pinchen Xie; Zhongzhi Zhang; Francesc Comellas (Appl. Math. Comput., 2016)

The normalized Laplacian spectrum of subdivisions of a graph. - Pinchen Xie; Zhongzhi Zhang; Francesc Comellas (Appl. Math. Comput., 2016)

The number and degree distribution of spanning trees in the Tower of Hanoi graph. - Zhongzhi Zhang; Shunqi Wu; Mingyun Li; Francesc Comellas (Theor. Comput. Sci., 2016)

Assessing Percolation Threshold Based on High-Order Non-Backtracking Matrices. - Yuan Lin 003; Wei Chen 013; Zhongzhi Zhang (WWW, 2017)

Effects of reciprocity on random walks in weighted networks. - Zhongzhi Zhang; Huan Li 002; Yibin Sheng (CoRR, 2017)

A New Method for Extracting the Hierarchical Organization of Networks. - Weihua Zhan; Jihong Guan; Zhongzhi Zhang (Int. J. Inf. Technol. Decis. Mak., 2017)

Improving the convergence rate of the DIRECT global optimization algorithm. - Qunfeng Liu; Guang Yang; Zhongzhi Zhang; Jinping Zeng (J. Glob. Optim., 2017)

Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs. - Yujia Jin; Huan Li 002; Zhongzhi Zhang (Theor. Comput. Sci., 2017)

Maximum matchings in scale-free networks with identical degree distribution. - Huan Li 002; Zhongzhi Zhang (Theor. Comput. Sci., 2017)

Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph. - Liren Shan; Huan Li 002; Zhongzhi Zhang (Theor. Comput. Sci., 2017)

Robustness of First- and Second-Order Consensus Algorithms for a Noisy Scale-Free Small-World Koch Network. - Yuhao Yi; Zhongzhi Zhang; Liren Shan; Guanrong Chen (IEEE Trans. Control. Syst. Technol., 2017)

Biharmonic Distance and Performance of Second-Order Consensus Networks with Stochastic Disturbances. - Yuhao Yi; Bingjia Yang; Zhongzhi Zhang; Stacy Patterson (ACC, 2018)

Convergence Rate of Consensus in a Network of Networks. - Anirban Das; Yuhao Yi; Stacy Patterson; Bassam Bamieh; Zhongzhi Zhang (CDC, 2018)

Improving Information Centrality of a Node in Complex Networks by Adding Edges. - Liren Shan; Yuhao Yi; Zhongzhi Zhang (IJCAI, 2018)

Biharmonic Distance Related Centrality for Edges in Weighted Networks. - Yuhao Yi; Liren Shan; Huan Li 002; Zhongzhi Zhang (IJCAI, 2018)

Kirchhoff Index as a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms. - Huan Li 002; Zhongzhi Zhang (SODA, 2018)

Extended Corona Product as an Exactly Tractable Model for Weighted Heterogeneous Networks. - Yi Qi; Huan Li 002; Zhongzhi Zhang (Comput. J., 2018)

Hitting times and resistance distances of q-triangulation graphs: Accurate results and applications. - Yibo Zeng; Zhongzhi Zhang (CoRR, 2018)

Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket. - Liren Shan; Huan Li 002; Zhongzhi Zhang (Theor. Comput. Sci., 2018)

Forest Distance Closeness Centrality in Disconnected Graphs. - Yujia Jin; Qi Bao; Zhongzhi Zhang (ICDM, 2019)

Current Flow Group Closeness Centrality for Complex Networks? - Huan Li 002; Richard Peng; Liren Shan; Yuhao Yi; Zhongzhi Zhang (WWW, 2019)

Non-Backtracking Centrality Based Random Walk on Networks. - Yuan Lin 003; Zhongzhi Zhang (Comput. J., 2019)

Topological and Spectral Properties of Small-World Hierarchical Graphs. - Yi Qi; Yuhao Yi; Zhongzhi Zhang (Comput. J., 2019)

The k-Power Domination Number in Some Self-Similar Graphs. - Yulun Xu; Qi Bao; Zhongzhi Zhang (CoRR, 2019)

A Resistance-Distance-Based Approach for Optimal Leader Selection in Noisy Consensus Networks. - Stacy Patterson; Yuhao Yi; Zhongzhi Zhang (IEEE Trans. Control. Netw. Syst., 2019)

Combinatorial properties of Farey graphs. - Yucheng Wang; Qi Bao; Zhongzhi Zhang (Theor. Comput. Sci., 2019)

Consensus in Self-Similar Hierarchical Graphs and Sierpiński Graphs: Convergence Speed, Delay Robustness, and Coherence. - Yi Qi; Zhongzhi Zhang; Yuhao Yi; Huan Li 002 (IEEE Trans. Cybern., 2019)

Low-Mean Hitting Time for Random Walks on Heterogeneous Networks. - Yibin Sheng; Zhongzhi Zhang (IEEE Trans. Inf. Theory, 2019)

Spectral Properties of Extended Sierpiński Graphs and Their Applications. - Yi Qi; Zhongzhi Zhang (IEEE Trans. Netw. Sci. Eng., 2019)

Opinion Dynamics Incorporating Higher-Order Interactions. - Zuobai Zhang; Wanyue Xu; Zhongzhi Zhang; Guanrong Chen (ICDM, 2020)

Nearly Linear Time Algorithm for Mean Hitting Times of Random Walks on a Graph. - Zuobai Zhang; Wanyue Xu; Zhongzhi Zhang (WSDM, 2020)

Power-Law Graphs Have Minimal Scaling of Kemeny Constant for Random Walks. - Wanyue Xu; Yibin Sheng; Zuobai Zhang; Haibin Kan; Zhongzhi Zhang (WWW, 2020)

Effects of Edge Centrality on Random Walks on Graphs. - Yuan Lin 003; Zhongzhi Zhang (Comput. J., 2020)

Hitting Times for Random Walks on Sierpiński Graphs and Hierarchical Graphs. - Yi Qi; Yuze Dong; Zhongzhi Zhang; Zhang Zhang (Comput. J., 2020)

Edge corona product as an approach to modeling complex simplical networks. - Yucheng Wang; Yuhao Yi; Wanyue Xu; Zhongzhi Zhang (CoRR, 2020)

Scale-Free Loopy Structure is Resistant to Noise in Consensus Dynamics in Complex Networks. - Yuhao Yi; Zhongzhi Zhang; Stacy Patterson (IEEE Trans. Cybern., 2020)

Maximizing the Number of Spanning Trees in a Connected Graph. - Huan Li 002; Stacy Patterson; Yuhao Yi; Zhongzhi Zhang (IEEE Trans. Inf. Theory, 2020)

Minimizing Spectral Radius of Non-Backtracking Matrix by Edge Removal. - Zuobai Zhang; Zhongzhi Zhang; Guanrong Chen (CIKM, 2021)

Maximizing Influence of Leaders in Social Networks. - Xiaotian Zhou; Zhongzhi Zhang (KDD, 2021)

Minimizing Polarization and Disagreement in Social Networks via Link Recommendation. - Liwang Zhu; Qi Bao; Zhongzhi Zhang (NeurIPS, 2021)

Fast Evaluation for Relevant Quantities of Opinion Dynamics. - Wanyue Xu; Qi Bao; Zhongzhi Zhang (WWW, 2021)

Real-World Networks Are Not Always Fast Mixing. - Yi Qi; Wanyue Xu; Liwang Zhu; Zhongzhi Zhang (Comput. J., 2021)

Spectra, Hitting Times and Resistance Distances of q- Subdivision Graphs. - Yibo Zeng; Zhongzhi Zhang (Comput. J., 2021)

Edge Domination Number and the Number of Minimum Edge Dominating Sets in Pseudofractal Scale-Free Web and Sierpiński Gasket. - Xiaotian Zhou; Zhongzhi Zhang (CoRR, 2021)

Role Similarity Metric Based on Spanning Rooted Forest. - Qi Bao; Zhongzhi Zhang (CoRR, 2021)

Diffusion and Consensus in a Weakly Coupled Network of Networks. - Yuhao Yi; Anirban Das; Bassam Bamieh; Zhongzhi Zhang; Stacy Patterson (IEEE Trans. Control. Netw. Syst., 2021)

Effects of Stubbornness on Opinion Dynamics. - Wanyue Xu; Liwang Zhu; Jiale Guan; Zuobai Zhang; Zhongzhi Zhang (CIKM, 2022)

A Nearly-Linear Time Algorithm for Minimizing Risk of Conflict in Social Networks. - Liwang Zhu; Zhongzhi Zhang (KDD, 2022)

Benchmark for Discriminating Power of Edge Centrality Metrics. - Qi Bao; Wanyue Xu; Zhongzhi Zhang (Comput. J., 2022)

Some Combinatorial Problems in Power-Law Graphs. - Jiang Che; Wanyue Xu; Xiaotian Zhou; Zhongzhi Zhang; Haibin Kan (Comput. J., 2022)

Modeling Higher-Order Interactions in Complex Networks by Edge Product of Graphs. - Yucheng Wang; Yuhao Yi; Wanyue Xu; Zhongzhi Zhang (Comput. J., 2022)

Discriminating Power of Centrality Measures in Complex Networks. - Qi Bao; Zhongzhi Zhang (IEEE Trans. Cybern., 2022)

Coherence Scaling of Noisy Second-Order Scale-Free Consensus Networks. - Wanyue Xu; Bin Wu; Zuobai Zhang; Zhongzhi Zhang; Haibin Kan; Guanrong Chen (IEEE Trans. Cybern., 2022)

Fast Approximation of Coherence for Second-Order Noisy Consensus Networks. - Zuobai Zhang; Wanyue Xu; Yuhao Yi; Zhongzhi Zhang (IEEE Trans. Cybern., 2022)

Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks. - Yuhao Yi; Bingjia Yang; Zuobai Zhang; Zhongzhi Zhang; Stacy Patterson (IEEE Trans. Inf. Theory, 2022)

Opinion Optimization in Directed Social Networks. - Haoxin Sun; Zhongzhi Zhang (AAAI, 2023)

Minimizing Polarization in Noisy Leader-Follower Opinion Dynamics. - Wanyue Xu; Zhongzhi Zhang (CIKM, 2023)

A Sublinear Time Algorithm for Opinion Optimization in Directed Social Networks via Edge Recommendation. - Xiaotian Zhou; Liwang Zhu; Wei Li 055; Zhongzhi Zhang (KDD, 2023)

Opinion Maximization in Social Networks via Leader Selection. - Xiaotian Zhou; Zhongzhi Zhang (WWW, 2023)

Combinatorial Properties for a Class of Simplicial Complexes Extended from Pseudo-fractal Scale-free Web. - Zixuan Xie; Yucheng Wang; Wanyue Xu; Liwang Zhu; Wei Li 055; Zhongzhi Zhang (CoRR, 2023)

Measures and Optimization for Robustness and Vulnerability in Disconnected Networks. - Liwang Zhu; Qi Bao; Zhongzhi Zhang (IEEE Trans. Inf. Forensics Secur., 2023)

Optimal Scale-Free Small-World Graphs with Minimum Scaling of Cover Time. - Wanyue Xu; Zhongzhi Zhang (ACM Trans. Knowl. Discov. Data, 2023)

Resistance Distances In Simplicial Networks. - Mingzhe Zhu; Wanyue Xu; Zhongzhi Zhang; Haibin Kan; Guanrong Chen (Comput. J., 2023)

Modeling spatial networks by contact graphs of disk packings. - Mingzhe Zhu; Haoxin Sun; Wei Li 055; Zhongzhi Zhang (Theor. Comput. Sci., 2023)

Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition. - Xiaotian Zhou; Haoxin Sun; Wei Li 055; Zhongzhi Zhang (Theor. Comput. Sci., 2023)

Viral Marketing in Social Networks with Competing Products. - Ahad N. Zehmakan; Xiaotian Zhou; Zhongzhi Zhang (AAMAS, 2024)

Resistance Eccentricity in Graphs: Distribution, Computation and Optimization. - Zenan Lu; Xiaotian Zhou; Ahad N. Zehmakan; Zhongzhi Zhang (ICDE, 2024)

Fast Query of Biharmonic Distance in Networks. - Changan Liu; Ahad N. Zehmakan; Zhongzhi Zhang (KDD, 2024)

Fast Computation for the Forest Matrix of an Evolving Graph. - Haoxin Sun; Xiaotian Zhou; Zhongzhi Zhang (KDD, 2024)

Fast Computation of Kemeny's Constant for Directed Graphs. - Haisong Xia; Zhongzhi Zhang (KDD, 2024)

Efficient Computation for Diagonal of Forest Matrix via Variance-Reduced Forest Sampling. - Haoxin Sun; Zhongzhi Zhang (WWW, 2024)

Efficient Approximation of Kemeny's Constant for Large Graphs. - Haisong Xia; Zhongzhi Zhang (Proc. ACM Manag. Data, 2024)

Resistance distances in directed graphs: Definitions, properties, and applications. - Mingzhe Zhu; Liwang Zhu; Huan Li 002; Wei Li 055; Zhongzhi Zhang (Theor. Comput. Sci., 2024)

Defending Against Malicious Influence Control in Online Leader-Follower Social Networks. - Liwang Zhu; Xiaotian Zhou; Jiahe Tian; Wei Li 055; Zhongzhi Zhang (IEEE Trans. Inf. Forensics Secur., 2024)

Finding Influencers in Complex Networks: An Effective Deep Reinforcement Learning Approach. - Changan Liu; Changjun Fan; Zhongzhi Zhang (Comput. J., 2024)

Hitting Times of Random Walks on Edge Corona Product Graphs. - Mingzhe Zhu; Wanyue Xu; Wei Li 055; Zhongzhi Zhang; Haibin Kan (Comput. J., 2024)

A Fast Algorithm for Moderating Critical Nodes via Edge Removal. - Changan Liu; Xiaotian Zhou; Ahad N. Zehmakan; Zhongzhi Zhang (IEEE Trans. Knowl. Data Eng., 2024)

Linear Opinion Dynamics Model With Higher Order Interactions. - Wanyue Xu; Zhongzhi Zhang (IEEE Trans. Comput. Soc. Syst., 2024)

Opinion dynamics in social networks incorporating higher-order interactions. - Zuobai Zhang; Wanyue Xu; Zhongzhi Zhang; Guanrong Chen (Data Min. Knowl. Discov., 2024)

Friedkin-Johnsen Model for Opinion Dynamics on Signed Graphs. - Xiaotian Zhou; Haoxin Sun; Wanyue Xu; Wei Li 055; Zhongzhi Zhang (IEEE Trans. Knowl. Data Eng., 2024)

Fast Maximization of Current Flow Group Closeness Centrality. - Haisong Xia; Zhongzhi Zhang (ICDE, 2025)

Fast Estimation and Optimization of Resistance Diameter on Graphs. - Zenan Lu; Xiaotian Zhou; Zhongzhi Zhang (WWW, 2025)

Scalable Algorithms for Forest-Based Centrality on Large Graphs. - Yubo Sun; Haoxin Sun; Zhongzhi Zhang (WWW, 2025)

Diagonal of pseudoinverse of graph Laplacian: Fast estimation and exact results. - Zenan Lu; Wanyue Xu; Zhongzhi Zhang (Theor. Comput. Sci., 2025)

Opinion maximization in social networks via link recommendation. - Liwang Zhu; Zhongzhi Zhang (Theor. Comput. Sci., 2025)

Means of Hitting Times for Random Walks on Graphs: Connections, Computation, and Optimization. - Haisong Xia; Wanyue Xu; Zuobai Zhang; Zhongzhi Zhang (ACM Trans. Knowl. Discov. Data, 2025)

Maximizing the smallest eigenvalue of grounded Laplacian matrix. - Xiaotian Zhou; Run Wang; Wei Li 055; Zhongzhi Zhang (J. Glob. Optim., 2025)

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges. - Xiaotian Zhou; Ahad N. Zehmakan; Zhongzhi Zhang (IEEE Trans. Knowl. Data Eng., 2025)

Efficient Algorithms for Relevant Quantities of Friedkin-Johnsen Opinion Dynamics Model. - Gengyu Wang; Runze Zhang; Zhongzhi Zhang (CoRR, 2025)