Xinping Xu

Xinping Xu

Auto-generated profile, based on publicly available information

Xinping Xu

Institute of Particle Physics Huazhong Normal University 430079 Wuhan China

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2007 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Closed access
XXXinping Xu
Xinping Xu
JHJunhui Hu
Junhui Hu
FLFeng Liu
Feng Liu
Structural properties of the ship-transport network of China (STNC) are studied in the light of recent investigations of complex networks. STNC is composed of a set of routes and ports located along the sea or river. Network properties including the degree distribution, degree correlations, clustering, shortest path length, centrality, and betweenness are studied in different definitions of network topology. It is found that geographical constraint plays an important role in the network topology of STNC. We also study the traffic flow of STNC based on the weighted network representation, and demonstrate the weight distribution can be described by power-law or exponential function depending on the assumed definition of network topology. Other features related to STNC are also investigated.

18 March 2014 in Entropy
Verified
Journal Article
Open access
PDF file
YIYusuke Ide
Yusuke Ide
NKNorio Konno
Norio Konno
ESEtsuo Segawa
Etsuo Segawa
XXXin-Ping Xu
Xin-Ping Xu
In this paper, we consider the time averaged distribution of discrete time quantum walks on the glued trees. In order to analyze the walks on the glued trees, we consider a reduction to the walks on path graphs. Using a spectral analysis of the Jacobi matrices defined by the corresponding random walks on the path graphs, we have a spectral decomposition of the time evolution operator of the quantum walks. We find significant contributions of the eigenvalues, ±1, of the Jacobi matrices to the time averaged limit distribution of the quantum walks. As a consequence, we obtain the lower bounds of the time averaged distribution.

20 August 2007 in arXiv
Verified
Preprint
Open access
PDF file
XXXinping Xu
Xinping Xu
Recently, the classical configuration model for random graphs with given degree distribution has been extensively used as a null model in contraposition to real networks with the same degree distribution. In this paper, we briefly review the applications of this model and derive analytical expression for connection probability by the expanding coefficient method. We also use our expanding coefficient method to obtain the connection probability for the directed configuration model.

20 August 2007 in arXiv
Verified
Preprint
Open access
PDF file
XXXinping Xu
Xinping Xu
JHJunhui Hu
Junhui Hu
FLFeng Liu
Feng Liu
Structural properties of the ship-transport network of China (STNC) are studied in the light of recent investigations of complex networks. STNC is composed of a set of routes and ports located along the sea or river. Network properties including the degree distribution, degree correlations, clustering, shortest path length, centrality and betweenness are studied in different definition of network topology. It is found that geographical constraint plays an important role in the network topology of STNC. We also study the traffic flow of STNC based on the weighted network representation, and demonstrate the weight distribution can be described by power law or exponential function depending on the assumed definition of network topology. Other features related to STNC are also investigated.

28 March 2014 in arXiv
Verified
Preprint
Open access
PDF file
YIYusuke Ide
Yusuke Ide
NKNorio Konno
Norio Konno
ESEtsuo Segawa
Etsuo Segawa
XXXin-Ping Xu
Xin-Ping Xu
In this paper, we consider the time averaged distribution of discrete time quantum walks on the glued trees. In order to analyse the walks on the glued trees, we consider a reduction to the walks on path graphs. Using a spectral analysis of the Jacobi matrices defined by the corresponding random walks on the path graphs, we have spectral decomposition of the time evolution operator of the quantum walks. We find significant contributions of the eigenvalues $\pm 1$ of the Jacobi matrices to the time averaged limit distribution of the quantum walks. As a consequence we obtain lower bounds of the time averaged distribution.

20 August 2007 in arXiv
Verified
Preprint
Open access
PDF file
XXXinping Xu
Xinping Xu
FLFeng Liu
Feng Liu
Recently, random graphs in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices have attracted much attention. Here, we present a specific realization of a class of random network models in which the connection probability between two vertices (i,j) is a specific function of degrees ki and kj. In the framework of the configuration model of random graphs, we find analytical expressions for the degree correlation and clustering as a function of the variance of the desired degree distribution. The expressions obtained are checked by means of numerical simulations. Possible applications of our model are discussed.