| Fast Approximation of Coherence for Second-Order Noisy Consensus Networks | 1 | 0.37 | 2022 |
| Coherence Scaling of Noisy Second-Order Scale-Free Consensus Networks | 0 | 0.34 | 2022 |
| Effects of Stubbornness on Opinion Dynamics | 0 | 0.34 | 2022 |
| Discriminating Power of Centrality Measures in Complex Networks | 0 | 0.34 | 2022 |
| Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks | 0 | 0.34 | 2022 |
| A Nearly-Linear Time Algorithm for Minimizing Risk of Conflict in Social Networks | 0 | 0.34 | 2022 |
| Modeling Higher-Order Interactions in Complex Networks by Edge Product of Graphs | 0 | 0.34 | 2022 |
| Some Combinatorial Problems in Power-Law Graphs | 0 | 0.34 | 2022 |
| Diffusion and Consensus in a Weakly Coupled Network of Networks | 0 | 0.34 | 2021 |
| Fast Evaluation for Relevant Quantities of Opinion Dynamics | 0 | 0.34 | 2021 |
| Real-World Networks Are Not Always Fast Mixing | 0 | 0.34 | 2021 |
| Minimizing Spectral Radius of Non-Backtracking Matrix by Edge Removal | 0 | 0.34 | 2021 |
| Maximizing Influence of Leaders in Social Networks | 0 | 0.34 | 2021 |
| Hitting Times for Random Walks on Sierpiński Graphs and Hierarchical Graphs | 0 | 0.34 | 2020 |
| Nearly Linear Time Algorithm for Mean Hitting Times of Random Walks on a Graph. | 0 | 0.34 | 2020 |
| Effects of Edge Centrality on Random Walks on Graphs | 0 | 0.34 | 2020 |
| Power-Law Graphs Have Minimal Scaling of Kemeny Constant for Random Walks | 0 | 0.34 | 2020 |
| Topological and Spectral Properties of Small-World Hierarchical Graphs | 0 | 0.34 | 2019 |
| Combinatorial properties of Farey graphs. | 0 | 0.34 | 2019 |
| A Resistance-Distance-Based Approach for Optimal Leader Selection in Noisy Consensus Networks | 1 | 0.35 | 2019 |
| Low-Mean Hitting Time for Random Walks on Heterogeneous Networks. | 1 | 0.36 | 2019 |
| Spectral properties of extended Sierpiński graphs and their applications | 2 | 0.38 | 2019 |
| Non-Backtracking Centrality Based Random Walk on Networks. | 0 | 0.34 | 2019 |
| Forest Distance Closeness Centrality in Disconnected Graphs | 1 | 0.35 | 2019 |
| Consensus in Self-similar Hierarchical Graphs and Sierpiński Graphs: Convergence Speed, Delay Robustness, and Coherence. | 3 | 0.37 | 2019 |
| Biharmonic Distance Related Centrality for Edges in Weighted Networks. | 1 | 0.35 | 2018 |
| Hitting times and resistance distances of q-triangulation graphs: Accurate results and applications. | 0 | 0.34 | 2018 |
| Extended corona product as an exactly tractable model for weighted heterogeneous networks. | 3 | 0.38 | 2018 |
| Kirchhoff Index As a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms. | 0 | 0.34 | 2018 |
| Current Flow Group Closeness Centrality for Complex Networks. | 0 | 0.34 | 2018 |
| Improving information centrality of a node in complex networks by adding edges. | 0 | 0.34 | 2018 |
| Maximizing the Number of Spanning Trees in a Connected Graph. | 0 | 0.34 | 2018 |
| Scale-free Loopy Structure is Resistant to Noise in Consensus Dynamics in Complex Networks. | 3 | 0.39 | 2018 |
| Biharmonic Distance And Performance Of Second-Order Consensus Networks With Stochastic Disturbances | 0 | 0.34 | 2018 |
| Convergence Rate of Consensus in a Network of Networks | 0 | 0.34 | 2018 |
| Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket. | 3 | 0.37 | 2018 |
| Maximum matchings in scale-free networks with identical degree distribution. | 1 | 0.35 | 2017 |
| A Resistance Distance-Based Approach for Optimal Leader Selection in Noisy Consensus Networks. | 1 | 0.36 | 2017 |
| Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs. | 2 | 0.35 | 2017 |
| Effects Of Reciprocity On Random Walks In Weighted Networks | 0 | 0.34 | 2017 |
| Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph. | 5 | 0.40 | 2017 |
| Robustness of First- and Second-Order Consensus Algorithms for a Noisy Scale-Free Small-World Koch Network. | 3 | 0.36 | 2017 |
| Assessing Percolation Threshold Based on High-Order Non-Backtracking Matrices. | 0 | 0.34 | 2017 |
| A New Method For Extracting The Hierarchical Organization Of Networks | 0 | 0.34 | 2017 |
| The normalized Laplacian spectrum of subdivisions of a graph | 7 | 1.03 | 2016 |
| On the spectrum of the normalized Laplacian of iterated triangulations of graphs | 10 | 0.90 | 2016 |
| Pfaffian orientations and perfect matchings of scale-free networks | 6 | 0.44 | 2015 |
| The number and degree distribution of spanning trees in the Tower of Hanoi graph. | 4 | 0.51 | 2015 |
| Small-World Topology Can Significantly Improve the Performance of Noisy Consensus in a Complex Network | 7 | 0.59 | 2015 |
| Corona Graph as a Small-world Model. | 0 | 0.34 | 2015 |
