Zhongzhi Zhang

Orcid: 0000-0003-1260-2079

Affiliations:
  • Fudan University, Shanghai, China
  • Hunan City University, China


According to our database1, Zhongzhi Zhang authored at least 95 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Friedkin-Johnsen Model for Opinion Dynamics on Signed Graphs.
IEEE Trans. Knowl. Data Eng., December, 2024

Opinion dynamics in social networks incorporating higher-order interactions.
Data Min. Knowl. Discov., November, 2024

Linear Opinion Dynamics Model With Higher Order Interactions.
IEEE Trans. Comput. Soc. Syst., June, 2024

A Fast Algorithm for Moderating Critical Nodes via Edge Removal.
IEEE Trans. Knowl. Data Eng., April, 2024

Hitting Times of Random Walks on Edge Corona Product Graphs.
Comput. J., February, 2024

Finding Influencers in Complex Networks: An Effective Deep Reinforcement Learning Approach.
Comput. J., February, 2024

Defending Against Malicious Influence Control in Online Leader-Follower Social Networks.
IEEE Trans. Inf. Forensics Secur., 2024

Resistance distances in directed graphs: Definitions, properties, and applications.
Theor. Comput. Sci., 2024

Efficient Approximation of Kemeny's Constant for Large Graphs.
Proc. ACM Manag. Data, 2024

Efficient Computation for Diagonal of Forest Matrix via Variance-Reduced Forest Sampling.
Proceedings of the ACM on Web Conference 2024, 2024

Fast Computation of Kemeny's Constant for Directed Graphs.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Fast Computation for the Forest Matrix of an Evolving Graph.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Fast Query of Biharmonic Distance in Networks.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Resistance Eccentricity in Graphs: Distribution, Computation and Optimization.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Viral Marketing in Social Networks with Competing Products.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition.
Theor. Comput. Sci., November, 2023

Modeling spatial networks by contact graphs of disk packings.
Theor. Comput. Sci., September, 2023

Resistance Distances In Simplicial Networks.
Comput. J., August, 2023

Optimal Scale-Free Small-World Graphs with Minimum Scaling of Cover Time.
ACM Trans. Knowl. Discov. Data, 2023

Measures and Optimization for Robustness and Vulnerability in Disconnected Networks.
IEEE Trans. Inf. Forensics Secur., 2023

Diagonal of Pseudoinverse of Graph Laplacian: Fast Estimation and Exact Results.
CoRR, 2023

Combinatorial Properties for a Class of Simplicial Complexes Extended from Pseudo-fractal Scale-free Web.
CoRR, 2023

Opinion Maximization in Social Networks via Leader Selection.
Proceedings of the ACM Web Conference 2023, 2023

A Sublinear Time Algorithm for Opinion Optimization in Directed Social Networks via Edge Recommendation.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Minimizing Polarization in Noisy Leader-Follower Opinion Dynamics.
Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

Opinion Optimization in Directed Social Networks.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks.
IEEE Trans. Inf. Theory, 2022

Fast Approximation of Coherence for Second-Order Noisy Consensus Networks.
IEEE Trans. Cybern., 2022

Coherence Scaling of Noisy Second-Order Scale-Free Consensus Networks.
IEEE Trans. Cybern., 2022

Discriminating Power of Centrality Measures in Complex Networks.
IEEE Trans. Cybern., 2022

Modeling Higher-Order Interactions in Complex Networks by Edge Product of Graphs.
Comput. J., 2022

Some Combinatorial Problems in Power-Law Graphs.
Comput. J., 2022

Benchmark for Discriminating Power of Edge Centrality Metrics.
Comput. J., 2022

A Nearly-Linear Time Algorithm for Minimizing Risk of Conflict in Social Networks.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Effects of Stubbornness on Opinion Dynamics.
Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

2021
Diffusion and Consensus in a Weakly Coupled Network of Networks.
IEEE Trans. Control. Netw. Syst., 2021

Maximizing the Smallest Eigenvalue of Grounded Laplacian Matrix.
CoRR, 2021

Role Similarity Metric Based on Spanning Rooted Forest.
CoRR, 2021

Edge Domination Number and the Number of Minimum Edge Dominating Sets in Pseudofractal Scale-Free Web and Sierpiński Gasket.
CoRR, 2021

Spectra, Hitting Times and Resistance Distances of q- Subdivision Graphs.
Comput. J., 2021

Real-World Networks Are Not Always Fast Mixing.
Comput. J., 2021

Fast Evaluation for Relevant Quantities of Opinion Dynamics.
Proceedings of the WWW '21: The Web Conference 2021, 2021

Minimizing Polarization and Disagreement in Social Networks via Link Recommendation.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Maximizing Influence of Leaders in Social Networks.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Minimizing Spectral Radius of Non-Backtracking Matrix by Edge Removal.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020
Maximizing the Number of Spanning Trees in a Connected Graph.
IEEE Trans. Inf. Theory, 2020

Scale-Free Loopy Structure is Resistant to Noise in Consensus Dynamics in Complex Networks.
IEEE Trans. Cybern., 2020

Edge corona product as an approach to modeling complex simplical networks.
CoRR, 2020

Hitting Times for Random Walks on Sierpiński Graphs and Hierarchical Graphs.
Comput. J., 2020

Effects of Edge Centrality on Random Walks on Graphs.
Comput. J., 2020

Power-Law Graphs Have Minimal Scaling of Kemeny Constant for Random Walks.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

Nearly Linear Time Algorithm for Mean Hitting Times of Random Walks on a Graph.
Proceedings of the WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, 2020

Opinion Dynamics Incorporating Higher-Order Interactions.
Proceedings of the 20th IEEE International Conference on Data Mining, 2020

2019
Spectral Properties of Extended Sierpiński Graphs and Their Applications.
IEEE Trans. Netw. Sci. Eng., 2019

Low-Mean Hitting Time for Random Walks on Heterogeneous Networks.
IEEE Trans. Inf. Theory, 2019

Consensus in Self-Similar Hierarchical Graphs and Sierpiński Graphs: Convergence Speed, Delay Robustness, and Coherence.
IEEE Trans. Cybern., 2019

Combinatorial properties of Farey graphs.
Theor. Comput. Sci., 2019

A Resistance-Distance-Based Approach for Optimal Leader Selection in Noisy Consensus Networks.
IEEE Trans. Control. Netw. Syst., 2019

The k-Power Domination Number in Some Self-Similar Graphs.
CoRR, 2019

Topological and Spectral Properties of Small-World Hierarchical Graphs.
Comput. J., 2019

Non-Backtracking Centrality Based Random Walk on Networks.
Comput. J., 2019

Current Flow Group Closeness Centrality for Complex Networks?
Proceedings of the World Wide Web Conference, 2019

Forest Distance Closeness Centrality in Disconnected Graphs.
Proceedings of the 2019 IEEE International Conference on Data Mining, 2019

2018
Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket.
Theor. Comput. Sci., 2018

Hitting times and resistance distances of q-triangulation graphs: Accurate results and applications.
CoRR, 2018

Extended Corona Product as an Exactly Tractable Model for Weighted Heterogeneous Networks.
Comput. J., 2018

Kirchhoff Index as a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Biharmonic Distance Related Centrality for Edges in Weighted Networks.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Improving Information Centrality of a Node in Complex Networks by Adding Edges.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Convergence Rate of Consensus in a Network of Networks.
Proceedings of the 57th IEEE Conference on Decision and Control, 2018

Biharmonic Distance and Performance of Second-Order Consensus Networks with Stochastic Disturbances.
Proceedings of the 2018 Annual American Control Conference, 2018

2017
Robustness of First- and Second-Order Consensus Algorithms for a Noisy Scale-Free Small-World Koch Network.
IEEE Trans. Control. Syst. Technol., 2017

Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph.
Theor. Comput. Sci., 2017

Maximum matchings in scale-free networks with identical degree distribution.
Theor. Comput. Sci., 2017

Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs.
Theor. Comput. Sci., 2017

Improving the convergence rate of the DIRECT global optimization algorithm.
J. Glob. Optim., 2017

A New Method for Extracting the Hierarchical Organization of Networks.
Int. J. Inf. Technol. Decis. Mak., 2017

Effects of reciprocity on random walks in weighted networks.
CoRR, 2017

Assessing Percolation Threshold Based on High-Order Non-Backtracking Matrices.
Proceedings of the 26th International Conference on World Wide Web, 2017

2016
The number and degree distribution of spanning trees in the Tower of Hanoi graph.
Theor. Comput. Sci., 2016

The normalized Laplacian spectrum of subdivisions of a graph.
Appl. Math. Comput., 2016

On the spectrum of the normalized Laplacian of iterated triangulations of graphs.
Appl. Math. Comput., 2016

2015
Pfaffian orientations and perfect matchings of scale-free networks.
Theor. Comput. Sci., 2015

Corona Graph as a Small-world Model.
CoRR, 2015

Small-World Topology Can Significantly Improve the Performance of Noisy Consensus in a Complex Network.
Comput. J., 2015

2014
The number of spanning trees in Apollonian networks.
Discret. Appl. Math., 2014

2012
The Number of Spanning Trees of an Infinite Family of Outerplanar, Small-World and Self-Similar Graphs
CoRR, 2012

2011
Farey graphs as models for complex networks.
Theor. Comput. Sci., 2011

2010
A evolutionary method for finding communities in bipartite networks
CoRR, 2010

Impact of degree heterogeneity on the behavior of trapping in Koch networks
CoRR, 2010

2009
Complex networks and computing.
Frontiers Comput. Sci. China, 2009

2008
Self-similar planar graphs as models for complex networks.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

2005
On the Hermitian-Generalized Hamiltonian Solutions of Linear Matrix Equations.
SIAM J. Matrix Anal. Appl., 2005

2004
Least-squares solutions of inverse problem for hermitian generalized Hamiltonian matrices.
Appl. Math. Lett., 2004

Convergence property of a class of variable metric methods.
Appl. Math. Lett., 2004


  Loading...