oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 66 )

2018 ( 1026 )

2017 ( 1089 )

2016 ( 1120 )

Custom range...

Search Results: 1 - 10 of 101709 matches for " Guanrong Zhang "
All listed articles are free for downloading (OA Articles)
Page 1 /101709
Display every page Item
Random walks on weighted networks
Zhongzhi Zhang,Tong Shan,Guanrong Chen
Physics , 2012, DOI: 10.1103/PhysRevE.87.012112
Abstract: Random walks constitute a fundamental mechanism for a large set of dynamics taking place on networks. In this article, we study random walks on weighted networks with an arbitrary degree distribution, where the weight of an edge between two nodes has a tunable parameter. By using the spectral graph theory, we derive analytical expressions for the stationary distribution, mean first-passage time (MFPT), average trapping time (ATT), and lower bound of the ATT, which is defined as the average MFPT to a given node over every starting point chosen from the stationary distribution. All these results depend on the weight parameter, indicating a significant role of network weights on random walks. For the case of uncorrelated networks, we provide explicit formulas for the stationary distribution as well as ATT. Particularly, for uncorrelated scale-free networks, when the target is placed on a node with the highest degree, we show that ATT can display various scalings of network size, depending also on the same parameter. Our findings could pave a way to delicately controlling random-walk dynamics on complex networks.
Complete spectrum of stochastic master equation for random walks on treelike fractals
Zhongzhi Zhang,Bin Wu,Guanrong Chen
Physics , 2011, DOI: 10.1209/0295-5075/96/40009
Abstract: We study random walks on a family of treelike regular fractals with a trap fixed on a central node. We obtain all the eigenvalues and their corresponding multiplicities for the associated stochastic master equation, with the eigenvalues being provided through an explicit recursive relation. We also evaluate the smallest eigenvalue and show that its reciprocal is approximately equal to the mean trapping time. We expect that our technique can also be adapted to other regular fractals with treelike structures.
Using topological characteristics to evaluate complex network models can be misleading
Zhengping Fan,Guanrong Chen,Yunong Zhang
Computer Science , 2010,
Abstract: Graphical models are frequently used to represent topological structures of various complex networks. Current criteria to assess different models of a network mainly rely on how close a model matches the network in terms of topological characteristics. Typical topological metrics are clustering coefficient, distance distribution, the largest eigenvalue of the adjacency matrix, and the gap between the first and the second largest eigenvalues, which are widely used to evaluate and compare different models of a network. In this paper, we show that evaluating complex network models based on the current topological metrics can be quite misleading. Taking several models of the AS-level Internet as examples, we show that although a model seems to be good to describe the Internet in terms of the aforementioned topological characteristics, it is far from being realistic to represent the real Internet in performances such as robustness in resisting intentional attacks and traffic load distributions. We further show that it is not useful to assess network models by examining some topological characteristics such as clustering coefficient and distance distribution, if robustness of the Internet against random node removals is the only concern. Our findings shed new lights on how to reasonably evaluate different models of a network, not only the Internet but also other types of complex networks.
Cryptanalysis of an image encryption scheme based on the Hill cipher
Chengqing Li,Dan Zhang,Guanrong Chen
Computer Science , 2007, DOI: 10.1631/jzus.A0720102
Abstract: This paper studies the security of an image encryption scheme based on the Hill cipher and reports its following problems: 1) there is a simple necessary and sufficient condition that makes a number of secret keys invalid; 2) it is insensitive to the change of the secret key; 3) it is insensitive to the change of the plain-image; 4) it can be broken with only one known/chosen-plaintext; 5) it has some other minor defects.
Mean first-passage time for random walks on undirected networks
Zhongzhi Zhang,Alafate Julaiti,Baoyu Hou,Hongjuan Zhang,Guanrong Chen
Physics , 2011, DOI: 10.1140/epjb/e2011-20834-1
Abstract: In this paper, by using two different techniques we derive an explicit formula for the mean first-passage time (MFPT) between any pair of nodes on a general undirected network, which is expressed in terms of eigenvalues and eigenvectors of an associated matrix similar to the transition matrix. We then apply the formula to derive a lower bound for the MFPT to arrive at a given node with the starting point chosen from the stationary distribution over the set of nodes. We show that for a correlated scale-free network of size $N$ with a degree distribution $P(d)\sim d^{-\gamma}$, the scaling of the lower bound is $N^{1-1/\gamma}$. Also, we provide a simple derivation for an eigentime identity. Our work leads to a comprehensive understanding of recent results about random walks on complex networks, especially on scale-free networks.
Counting spanning trees in self-similar networks by evaluating determinants
Yuan Lin,Bin Wu,Zhongzhi Zhang,Guanrong Chen
Physics , 2011, DOI: 10.1063/1.3659687
Abstract: Spanning trees are relevant to various aspects of networks. Generally, the number of spanning trees in a network can be obtained by computing a related determinant of the Laplacian matrix of the network. However, for a large generic network, evaluating the relevant determinant is computationally intractable. In this paper, we develop a fairly generic technique for computing determinants corresponding to self-similar networks, thereby providing a method to determine the numbers of spanning trees in networks exhibiting self-similarity. We describe the computation process with a family of networks, called $(x,y)$-flowers, which display rich behavior as observed in a large variety of real systems. The enumeration of spanning trees is based on the relationship between the determinants of submatrices of the Laplacian matrix corresponding to the $(x,y)$-flowers at different generations and is devoid of the direct laborious computation of determinants. Using the proposed method, we derive analytically the exact number of spanning trees in the $(x,y)$-flowers, on the basis of which we also obtain the entropies of the spanning trees in these networks. Moreover, to illustrate the universality of our technique, we apply it to some other self-similar networks with distinct degree distributions, and obtain explicit solutions to the numbers of spanning trees and their entropies. Finally, we compare our results for networks with the same average degree but different structural properties, such as degree distribution and fractal dimension, and uncover the effect of these topological features on the number of spanning trees.
Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks
Zhongzhi Zhang,Yibin Sheng,Zhengyi Hu,Guanrong Chen
Physics , 2012, DOI: 10.1063/1.4768665
Abstract: For a random walk on a network, the mean first-passage time from a node $i$ to another node $j$ chosen stochastically according to the equilibrium distribution of Markov chain representing the random walk is called Kemeny constant, which is closely related to the navigability on the network. Thus, the configuration of a network that provides optimal or suboptimal navigation efficiency is a question of interest. It has been proved that complete graphs have the exact minimum Kemeny constant over all graphs. In this paper, by using another method we first prove that complete graphs are the optimal networks with a minimum Kemeny constant, which grows linearly with the network size. Then, we study the Kemeny constant of a class of sparse networks that exhibit remarkable scale-free and fractal features as observed in many real-life networks, which cannot be described by complete graphs. To this end, we determine the closed-form solutions to all eigenvalues and their degeneracies of the networks. Employing these eigenvalues, we derive the exact solution to the Kemeny constant, which also behaves linearly with the network size for some particular cases of networks. We further use the eigenvalue spectra to determine the number of spanning trees in the networks under consideration, which is in complete agreement with previously reported results. Our work demonstrates that scale-free and fractal properties are favorable for efficient navigation, which could be considered when designing networks with high navigation efficiency.
Trapping in dendrimers and regular hyperbranched polymers
Bin Wu,Yuan Lin,Zhongzhi Zhang,Guanrong Chen
Physics , 2012, DOI: 10.1063/1.4737635
Abstract: Dendrimers and regular hyperbranched polymers are two classic families of macromolecules, which can be modeled by Cayley trees and Vicsek fractals, respectively. In this paper, we study the trapping problem in Cayley trees and Vicsek fractals with different underlying geometries, focusing on a particular case with a perfect trap located at the central node. For both networks, we derive the exact analytic formulas in terms of the network size for the average trapping time (ATT)---the average of node-to-trap mean first-passage time over the whole networks. The obtained closed-form solutions show that for both Cayley trees and Vicsek fractals, the ATT display quite different scalings with various system sizes, which implies that the underlying structure plays a key role on the efficiency of trapping in polymer networks. Moreover, the dissimilar scalings of ATT may allow to differentiate readily between dendrimers and hyperbranched polymers.
Exact eigenvalue spectrum of a class of fractal scale-free networks
Zhongzhi Zhang,Zhengyi Hu,Yibin Sheng,Guanrong Chen
Physics , 2012, DOI: 10.1209/0295-5075/99/10007
Abstract: The eigenvalue spectrum of the transition matrix of a network encodes important information about its structural and dynamical properties. We study the transition matrix of a family of fractal scale-free networks and analytically determine all the eigenvalues and their degeneracies. We then use these eigenvalues to evaluate the closed-form solution to the eigentime for random walks on the networks under consideration. Through the connection between the spectrum of transition matrix and the number of spanning trees, we corroborate the obtained eigenvalues and their multiplicities.
Dynamical Analysis of a Networked Control System
Guofeng Zhang,Guanrong Chen,Tongwen Chen,Maria D'Amico
Mathematics , 2014, DOI: 10.1142/S0218127407017173
Abstract: A new network data transmission strategy was proposed in Zhang \& Chen [2005] (arXiv:1405.2404), where the resulting nonlinear system was analyzed and the effectiveness of the transmission strategy was demonstrated via simulations. In this paper, we further generalize the results of Zhang \& Chen [2005] in the following ways: 1) Construct first-return maps of the nonlinear systems formulated in Zhang \& Chen [2005] and derive several existence conditions of periodic orbits and study their properties. 2) Formulate the new system as a hybrid system, which will ease the succeeding analysis. 3) Prove that this type of hybrid systems is not structurally stable based on phase transition which can be applied to higher-dimensional cases effortlessly. 4) Simulate a higher-dimensional model with emphasis on their rich dynamics. 5) Study a class of continuous-time hybrid systems as the counterparts of the discrete-time systems discussed above. 6) Propose new controller design methods based on this network data transmission strategy to improve the performance of each individual system and the whole network. We hope that this research and the problems posed here will rouse interests of researchers in such fields as control, dynamical systems and numerical analysis.
Page 1 /101709
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.