46 citations · 91 across the 15 of their papers we have counts for
15 papers
A Sample-Based Algorithm for Approximately Testing -Robustness of a Digraph
Yuhao Yi, Yuan Wang, Xingkang He +2
One of the intensely studied concepts of network robustness is -robustness, which is a network topology property quantified by an integer . It is required by mean subsequence…
Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models
Yuhao Yi, Liren Shan, Philip E. Paré +1
This paper studies algorithmic strategies to effectively reduce the number of infections in susceptible-infected-recovered (SIR) epidemic models. We consider a Markov chain SIR mod…
Edge corona product as an approach to modeling complex simplical networks
Yucheng Wang, Yuhao Yi, Wanyue Xu +1
Many graph products have been applied to generate complex networks with striking properties observed in real-world systems. In this paper, we propose a simple generative model for…
Diffusion and Consensus in a Weakly Coupled Network of Networks
Yuhao Yi, Anirban Das, Stacy Patterson +2
We study diffusion and consensus dynamics in a Network of Networks model. In this model, there is a collection of sub-networks, connected to one another using a small number of lin…
Disagreement and Polarization in Two-Party Social Networks
Yuhao Yi, Stacy Patterson
We investigate disagreement and polarization in a social network with two polarizing sources of information. First, we define disagreement and polarization indices in two-party lea…
Shifting Opinions in a Social Network Through Leader Selection
Yuhao Yi, Timothy Castiglia, Stacy Patterson
We study the French-DeGroot opinion dynamics in a social network with two polarizing parties. We consider a network in which the leaders of one party are given, and we pose the pro…
Improving information centrality of a node in complex networks by adding edges
Liren Shan, Yuhao Yi, Zhongzhi Zhang
The problem of increasing the centrality of a network node arises in many practical applications. In this paper, we study the optimization problem of maximizing the information cen…
Maximizing the Number of Spanning Trees in a Connected Graph
Huan Li, Stacy Patterson, Yuhao Yi +1
We study the problem of maximizing the number of spanning trees in a connected graph by adding at most edges from a given candidate edge set. We give both algorithmic and hardn…
Current Flow Group Closeness Centrality for Complex Networks
Huan Li, Richard Peng, Liren Shan +2
Current flow closeness centrality (CFCC) has a better discriminating ability than the ordinary closeness centrality based on shortest paths. In this paper, we extend this notion to…
Scale-free Loopy Structure is Resistant to Noise in Consensus Dynamics in Complex Networks
Yuhao Yi, Zhongzhi Zhang, Stacy Patterson
The vast majority of real-world networks are scale-free, loopy, and sparse, with a power-law degree distribution and a constant average degree. In this paper, we study first-order…
Consensus in Self-similar Hierarchical Graphs and Sierpiński Graphs: Convergence Speed, Delay Robustness, and Coherence
Yi Qi, Zhongzhi Zhang, Yuhao Yi +1
The hierarchical graphs and Sierpiński graphs are constructed iteratively, which have the same number of vertices and edges at any iteration, but exhibit quite different structural…
Biharmonic Distance and the Performance of Second-Order Consensus Networks with Stochastic Disturbances
Yuhao Yi, Bingjia Yang, Zhongzhi Zhang +1
We study second order consensus dynamics with random additive disturbances. We investigate three different performance measures: the steady-state variance of pairwise differences b…
A Resistance Distance-Based Approach for Optimal Leader Selection in Noisy Consensus Networks
Stacy Patterson, Yuhao Yi, Zhongzhi Zhang
We study the performance of leader-follower noisy consensus networks, and in particular, the relationship between this performance and the locations of the leader nodes. Two types…
Anomalous behavior of trapping in extended dendrimers with a perfect trap
Zhongzhi Zhang, Huan Li, Yuhao Yi
Compact and extended dendrimers are two important classes of dendritic polymers. The impact of the underlying structure of compact dendrimers on dynamical processes has been much s…
Corona graphs as a model of small-world networks
Qian Lv, Yuhao Yi, Zhongzhi Zhang
We introduce recursive corona graphs as a model of small-world networks. We investigate analytically the critical characteristics of the model, including order and size, degree dis…