920 results on '"Guan, Jihong"'
Search Results
52. A novel privacy preserving method for data publication
- Author
-
Liu, Chaobin, Chen, Shixi, Zhou, Shuigeng, Guan, Jihong, and Ma, Yao
- Published
- 2019
- Full Text
- View/download PDF
53. FedMDR: Federated Model Distillation with Robust Aggregation
- Author
-
Mi, Yuxi, primary, Mu, Yutong, additional, Zhou, Shuigeng, additional, and Guan, Jihong, additional
- Published
- 2021
- Full Text
- View/download PDF
54. Detecting Collusive Cliques in Futures Markets Based on Trading Behaviors from Real Data
- Author
-
Wang, Junjie, Zhou, Shuigeng, and Guan, Jihong
- Subjects
Quantitative Finance - Trading and Market Microstructure ,Computer Science - Neural and Evolutionary Computing - Abstract
In financial markets, abnormal trading behaviors pose a serious challenge to market surveillance and risk management. What is worse, there is an increasing emergence of abnormal trading events that some experienced traders constitute a collusive clique and collaborate to manipulate some instruments, thus mislead other investors by applying similar trading behaviors for maximizing their personal benefits. In this paper, a method is proposed to detect the hidden collusive cliques involved in an instrument of future markets by first calculating the correlation coefficient between any two eligible unified aggregated time series of signed order volume, and then combining the connected components from multiple sparsified weighted graphs constructed by using the correlation matrices where each correlation coefficient is over a user-specified threshold. Experiments conducted on real order data from the Shanghai Futures Exchange show that the proposed method can effectively detect suspect collusive cliques. A tool based on the proposed method has been deployed in the exchange as a pilot application for futures market surveillance and risk management., Comment: 13 pages, 5 figures and 3 tables. submitted to Neurocomputing
- Published
- 2011
55. Rumor Evolution in Social Networks
- Author
-
Zhang, Yichao, Zhou, Shi, Guan, Jihong, and Zhou, Shuigeng
- Subjects
Physics - Physics and Society ,Computer Science - Social and Information Networks - Abstract
Social network is a main tunnel of rumor spreading. Previous studies are concentrated on a static rumor spreading. The content of the rumor is invariable during the whole spreading process. Indeed, the rumor evolves constantly in its spreading process, which grows shorter, more concise, more easily grasped and told. In an early psychological experiment, researchers found about 70% of details in a rumor were lost in the first 6 mouth-to-mouth transmissions \cite{TPR}. Based on the facts, we investigate rumor spreading on social networks, where the content of the rumor is modified by the individuals with a certain probability. In the scenario, they have two choices, to forward or to modify. As a forwarder, an individual disseminates the rumor directly to its neighbors. As a modifier, conversely, an individual revises the rumor before spreading it out. When the rumor spreads on the social networks, for instance, scale-free networks and small-world networks, the majority of individuals actually are infected by the multi-revised version of the rumor, if the modifiers dominate the networks. Our observation indicates that the original rumor may lose its influence in the spreading process. Similarly, a true information may turn to be a rumor as well. Our result suggests the rumor evolution should not be a negligible question, which may provide a better understanding of the generation and destruction of a rumor., Comment: a regular paper with 6 pages, 3 figures
- Published
- 2011
56. Diffusion-annihilation proecesses in weighted scale-free networks with identical degree sequence
- Author
-
Zhang, Yichao, Guan, Jihong, Zhang, Zhongzhi, Zhou, Shi, and Zhou, Shuigeng
- Subjects
Condensed Matter - Disordered Systems and Neural Networks ,Condensed Matter - Statistical Mechanics - Abstract
The studies based on $A+A \rightarrow \emptyset$ and $A+B\rightarrow \emptyset$ diffusion-annihilation processes have so far been studied on weighted uncorrelated scale-free networks and fractal scale-free networks. In the previous reports, it is widely accepted that the segregation of particles in the processes is introduced by the fractal structure. In this paper, we study these processes on a family of weighted scale-free networks with identical degree sequence. We find that the depletion zone and segregation are essentially caused by the disassortative mixing, namely, high-degree nodes tend to connect with low-degree nodes. Their influence on the processes is governed by the correlation between the weight and degree. Our finding suggests both the weight and degree distribution don't suffice to characterize the diffusion-annihilation processes on weighted scale-free networks., Comment: 15 pages, 10 figures
- Published
- 2010
- Full Text
- View/download PDF
57. Characteristics of Real Futures Trading Networks
- Author
-
Wang, Junjie, Zhou, Shuigeng, and Guan, Jihong
- Subjects
Quantitative Finance - Statistical Finance ,Condensed Matter - Statistical Mechanics - Abstract
Futures trading is the core of futures business, and it is considered as one of the typical complex systems. To investigate the complexity of futures trading, we employ the analytical method of complex networks. First, we use real trading records from the Shanghai Futures Exchange to construct futures trading networks, in which nodes are trading participants, and two nodes have a common edge if the two corresponding investors appear simultaneously in at least one trading record as a purchaser and a seller respectively. Then, we conduct a comprehensive statistical analysis on the constructed futures trading networks. Empirical results show that the futures trading networks exhibit features such as scale-free behavior with interesting odd-even-degree divergence in low-degree regions, small-world effect, hierarchical organization, power-law betweenness distribution, disassortative mixing, and shrinkage of both the average path length and the diameter as network size increases. To the best of our knowledge, this is the first work that uses real data to study futures trading networks, and we argue that the research results can shed light on the nature of real futures business., Comment: 18 pages, 9 figures. Final version published in Physica A
- Published
- 2010
- Full Text
- View/download PDF
58. Determining global mean-first-passage time of random walks on Vicsek fractals using eigenvalues of Laplacian matrices
- Author
-
Zhang, Zhongzhi, Wu, Bin, Zhang, Hongjuan, Zhou, Shuigeng, Guan, Jihong, and Wang, Zhigang
- Subjects
Condensed Matter - Statistical Mechanics - Abstract
The family of Vicsek fractals is one of the most important and frequently-studied regular fractal classes, and it is of considerable interest to understand the dynamical processes on this treelike fractal family. In this paper, we investigate discrete random walks on the Vicsek fractals, with the aim to obtain the exact solutions to the global mean first-passage time (GMFPT), defined as the average of first-passage time (FPT) between two nodes over the whole family of fractals. Based on the known connections between FPTs, effective resistance, and the eigenvalues of graph Laplacian, we determine implicitly the GMFPT of the Vicsek fractals, which is corroborated by numerical results. The obtained closed-form solution shows that the GMFPT approximately grows as a power-law function with system size (number of all nodes), with the exponent lies between 1 and 2. We then provide both the upper bound and lower bound for GMFPT of general trees, and show that leading behavior of the upper bound is the square of system size and the dominating scaling of the lower bound varies linearly with system size. We also show that the upper bound can be achieved in linear chains and the lower bound can be reached in star graphs. This study provides a comprehensive understanding of random walks on the Vicsek fractals and general treelike networks., Comment: Definitive version accepted for publication in Physical Review E
- Published
- 2010
- Full Text
- View/download PDF
59. An alternative approach to determining average distance in a class of scale-free modular networks
- Author
-
Zhang, Zhongzhi, Lin, Yuan, Zhou, Shuigeng, Wang, Zhigang, and Guan, Jihong
- Subjects
Physics - Physics and Society ,Condensed Matter - Statistical Mechanics - Abstract
Various real-life networks of current interest are simultaneously scale-free and modular. Here we study analytically the average distance in a class of deterministically growing scale-free modular networks. By virtue of the recursive relations derived from the self-similar structure of the networks, we compute rigorously this important quantity, obtaining an explicit closed-form solution, which recovers the previous result and is corroborated by extensive numerical calculations. The obtained exact expression shows that the average distance scales logarithmically with the number of nodes in the networks, indicating an existence of small-world behavior. We present that this small-world phenomenon comes from the peculiar architecture of the network family., Comment: Submitted for publicaction
- Published
- 2009
- Full Text
- View/download PDF
60. Analytic Solution to Clustering Coefficients on Weighted Networks
- Author
-
Zhang, Yichao, Zhang, Zhongzhi, Guan, Jihong, and Zhou, Shuigeng
- Subjects
Condensed Matter - Disordered Systems and Neural Networks ,Condensed Matter - Statistical Mechanics ,Physics - Physics and Society - Abstract
Clustering coefficient is an important topological feature of complex networks. It is, however, an open question to give out its analytic expression on weighted networks yet. Here we applied an extended mean-field approach to investigate clustering coefficients in the typical weighted networks proposed by Barrat, Barth\'elemy and Vespignani (BBV networks). We provide analytical solutions of this model and find that the local clustering in BBV networks depends on the node degree and strength. Our analysis is well in agreement with results of numerical simulations., Comment: A paper with 9 pages, 3 figures
- Published
- 2009
- Full Text
- View/download PDF
61. Average distance in a hierarchical scale-free network: an exact solution
- Author
-
Zhang, Zhongzhi, Lin, Yuan, Gao, Shuyang, Zhou, Shuigeng, and Guan, Jihong
- Subjects
Condensed Matter - Statistical Mechanics ,Physics - Physics and Society - Abstract
Various real systems simultaneously exhibit scale-free and hierarchical structure. In this paper, we study analytically average distance in a deterministic scale-free network with hierarchical organization. Using a recursive method based on the network construction, we determine explicitly the average distance, obtaining an exact expression for it, which is confirmed by extensive numerical calculations. The obtained rigorous solution shows that the average distance grows logarithmically with the network order (number of nodes in the network). We exhibit the similarity and dissimilarity in average distance between the network under consideration and some previously studied networks, including random networks and other deterministic networks. On the basis of the comparison, we argue that the logarithmic scaling of average distance with network order could be a generic feature of deterministic scale-free networks., Comment: Definitive version published in Journal of Statistical Mechanics
- Published
- 2009
- Full Text
- View/download PDF
62. Deterministic weighted scale-free small-world networks
- Author
-
Zhang, Yichao, Zhang, Zhongzhi, Zhou, Shuigeng, and Guan, Jihong
- Subjects
Condensed Matter - Statistical Mechanics ,Condensed Matter - Disordered Systems and Neural Networks ,Physics - Physics and Society - Abstract
We propose a deterministic weighted scale-free small-world model for considering pseudofractal web with the coevolution of topology and weight. In the model, we have the degree distribution exponent $\gamma$ restricted to a range between 2 and 3, simultaneously tunable with two parameters. At the same time, we provide a relatively complete view of topological structure and weight dynamics characteristics of the networks: weight and strength distribution; degree correlations; average clustering coefficient and degree-cluster correlations; as well as the diameter. We show that our model is particularly effective at mimicing weighted scale-free small-world networks with a high and relatively stable clustering coefficient, which rapidly decline with the network size in most previous models., Comment: a paper with 15 pages and 5 figures
- Published
- 2009
- Full Text
- View/download PDF
63. Trapping in scale-free networks with hierarchical organization of modularity
- Author
-
Zhang, Zhongzhi, Lin, Yuan, Gao, Shuyang, Zhou, Shuigeng, Guan, Jihong, and Li, Mo
- Subjects
Condensed Matter - Statistical Mechanics ,Physics - Physics and Society - Abstract
A wide variety of real-life networks share two remarkable generic topological properties: scale-free behavior and modular organization, and it is natural and important to study how these two features affect the dynamical processes taking place on such networks. In this paper, we investigate a simple stochastic process--trapping problem, a random walk with a perfect trap fixed at a given location, performed on a family of hierarchical networks that exhibit simultaneously striking scale-free and modular structure. We focus on a particular case with the immobile trap positioned at the hub node having the largest degree. Using a method based on generating functions, we determine explicitly the mean first-passage time (MFPT) for the trapping problem, which is the mean of the node-to-trap first-passage time over the entire network. The exact expression for the MFPT is calculated through the recurrence relations derived from the special construction of the hierarchical networks. The obtained rigorous formula corroborated by extensive direct numerical calculations exhibits that the MFPT grows algebraically with the network order. Concretely, the MFPT increases as a power-law function of the number of nodes with the exponent much less than 1. We demonstrate that the hierarchical networks under consideration have more efficient structure for transport by diffusion in contrast with other analytically soluble media including some previously studied scale-free networks. We argue that the scale-free and modular topologies are responsible for the high efficiency of the trapping process on the hierarchical networks., Comment: Definitive version accepted for publication in Physical Review E
- Published
- 2009
- Full Text
- View/download PDF
64. Distinct scalings for mean first-passage time of random walks on scale-free networks with the same degree sequence
- Author
-
Zhang, Zhongzhi, Xie, Weilen, Zhou, Shuigeng, Li, Mo, and Guan, Jihong
- Subjects
Condensed Matter - Statistical Mechanics - Abstract
In general, the power-law degree distribution has profound influence on various dynamical processes defined on scale-free networks. In this paper, we will show that power-law degree distribution alone does not suffice to characterize the behavior of trapping problem on scale-free networks, which is an integral major theme of interest for random walks in the presence of an immobile perfect absorber. In order to achieve this goal, we study random walks on a family of one-parameter (denoted by $q$) scale-free networks with identical degree sequence for the full range of parameter $q$, in which a trap is located at a fixed site. We obtain analytically or numerically the mean first-passage time (MFPT) for the trapping issue. In the limit of large network order (number of nodes), for the whole class of networks, the MFPT increases asymptotically as a power-law function of network order with the exponent obviously different for different parameter $q$, which suggests that power-law degree distribution itself is not sufficient to characterize the scaling behavior of MFPT for random walks, at least trapping problem, performed on scale-free networks., Comment: 9 pages, 10 figures
- Published
- 2009
- Full Text
- View/download PDF
65. Mean first-passage time for random walks on the T-graph
- Author
-
Zhang, Zhongzhi, Lin, Yuan, Zhou, Shuigeng, Wu, Bin, and Guan, Jihong
- Subjects
Condensed Matter - Statistical Mechanics - Abstract
For random walks on networks (graphs), it is a theoretical challenge to explicitly determine the mean first-passage time (MFPT) between two nodes averaged over all pairs. In this paper, we study the MFPT of random walks in the famous T-graph, linking this important quantity to the resistance distance in electronic networks. We obtain an exact formula for the MFPT that is confirmed by extensive numerical calculations. The interesting quantity is derived through the recurrence relations resulting from the self-similar structure of the T-graph. The obtained closed-form expression exhibits that the MFPT approximately increases as a power-law function of the number of nodes, with the exponent lying between 1 and 2. Our research may shed light on the deeper understanding of random walks on the T-graph., Comment: Definitive version accepted for publication in New Journal of Physics
- Published
- 2009
- Full Text
- View/download PDF
66. Explicit determination of mean first-passage time for random walks on deterministic uniform recursive trees
- Author
-
Zhang, Zhongzhi, Qi, Yi, Zhou, Shuigeng, Gao, Shuyang, and Guan, Jihong
- Subjects
Condensed Matter - Statistical Mechanics - Abstract
The determination of mean first-passage time (MFPT) for random walks in networks is a theoretical challenge, and is a topic of considerable recent interest within the physics community. In this paper, according to the known connections between MFPT, effective resistance, and the eigenvalues of graph Laplacian, we first study analytically the MFPT between all node pairs of a class of growing treelike networks, which we term deterministic uniform recursive trees (DURTs), since one of its particular cases is a deterministic version of the famous uniform recursive tree. The interesting quantity is determined exactly through the recursive relation of the Laplacian spectra obtained from the special construction of DURTs. The analytical result shows that the MFPT between all couples of nodes in DURTs varies as $N \ln N$ for large networks with node number $N$. Second, we study trapping on a particular network of DURTs, focusing on a special case with the immobile trap positioned at a node having largest degree. We determine exactly the average trapping time (ATT) that is defined as the average of FPT from all nodes to the trap. In contrast to the scaling of the MFPT, the leading behavior of ATT is a linear function of $N$. Interestingly, we show that the behavior for ATT of the trapping problem is related to the trapping location, which is in comparison with the phenomenon of trapping on fractal T-graph although both networks exhibit treestructure. Finally, we believe that the methods could open the way to exactly calculate the MFPT and ATT in a wide range of deterministic media., Comment: 8 pages, 6 figures, definitive version published in Physical Review E
- Published
- 2009
- Full Text
- View/download PDF
67. Contact graphs of disk packings as a model of spatial planar networks
- Author
-
Zhang, Zhongzhi, Guan, Jihong, Ding, Bailu, Chen, Lichao, and Zhou, Shuigeng
- Subjects
Condensed Matter - Statistical Mechanics - Abstract
Spatially constrained planar networks are frequently encountered in real-life systems. In this paper, based on a space-filling disk packing we propose a minimal model for spatial maximal planar networks, which is similar to but different from the model for Apollonian networks [J. S. Andrade, Jr. et al., Phys. Rev. Lett. {\bf 94}, 018702 (2005)]. We present an exhaustive analysis of various properties of our model, and obtain the analytic solutions for most of the features, including degree distribution, clustering coefficient, average path length, and degree correlations. The model recovers some striking generic characteristics observed in most real networks. To address the robustness of the relevant network properties, we compare the structural features between the investigated network and the Apollonian networks. We show that topological properties of the two networks are encoded in the way of disk packing. We argue that spatial constrains of nodes are relevant to the structure of the networks., Comment: 12 pages, 7 figures. Definitive version accepted for publication in New Journal of Physics
- Published
- 2009
- Full Text
- View/download PDF
68. Anomalous behavior of trapping on a fractal scale-free network
- Author
-
Zhang, Zhongzhi, Xie, Wenlei, Zhou, Shuigeng, Gao, Shuyang, and Guan, Jihong
- Subjects
Condensed Matter - Statistical Mechanics - Abstract
It is known that the heterogeneity of scale-free networks helps enhancing the efficiency of trapping processes performed on them. In this paper, we show that transport efficiency is much lower in a fractal scale-free network than in non-fractal networks. To this end, we examine a simple random walk with a fixed trap at a given position on a fractal scale-free network. We calculate analytically the mean first-passage time (MFPT) as a measure of the efficiency for the trapping process, and obtain a closed-form expression for MFPT, which agrees with direct numerical calculations. We find that, in the limit of a large network order $V$, the MFPT $
$ behaves superlinearly as $ \sim V^{{3/2}}$ with an exponent 3/2 much larger than 1, which is in sharp contrast to the scaling $ \sim V^{\theta}$ with $\theta \leq 1$, previously obtained for non-fractal scale-free networks. Our results indicate that the degree distribution of scale-free networks is not sufficient to characterize trapping processes taking place on them. Since various real-world networks are simultaneously scale-free and fractal, our results may shed light on the understanding of trapping processes running on real-life systems., Comment: 6 pages, 5 figures; Definitive version accepted for publication in EPL (Europhysics Letters) - Published
- 2009
- Full Text
- View/download PDF
69. A unified model for Sierpinski networks with scale-free scaling and small-world effect
- Author
-
Guan, Jihong, Wu, Yuewen, Zhang, Zhongzhi, Zhou, Shuigeng, and Wu, Yonghui
- Subjects
Condensed Matter - Disordered Systems and Neural Networks ,Physics - Physics and Society - Abstract
In this paper, we propose an evolving Sierpinski gasket, based on which we establish a model of evolutionary Sierpinski networks (ESNs) that unifies deterministic Sierpinski network [Eur. Phys. J. B {\bf 60}, 259 (2007)] and random Sierpinski network [Eur. Phys. J. B {\bf 65}, 141 (2008)] to the same framework. We suggest an iterative algorithm generating the ESNs. On the basis of the algorithm, some relevant properties of presented networks are calculated or predicted analytically. Analytical solution shows that the networks under consideration follow a power-law degree distribution, with the distribution exponent continuously tuned in a wide range. The obtained accurate expression of clustering coefficient, together with the prediction of average path length reveals that the ESNs possess small-world effect. All our theoretical results are successfully contrasted by numerical simulations. Moreover, the evolutionary prisoner's dilemma game is also studied on some limitations of the ESNs, i.e., deterministic Sierpinski network and random Sierpinski network., Comment: final version accepted for publication in Physica A
- Published
- 2009
- Full Text
- View/download PDF
70. Random walks on the Apollonian network with a single trap
- Author
-
Zhang, Zhongzhi, Guan, Jihong, Xie, Wenlei, Qi, Yi, and Zhou, Shuigeng
- Subjects
Condensed Matter - Statistical Mechanics - Abstract
Explicit determination of the mean first-passage time (MFPT) for trapping problem on complex media is a theoretical challenge. In this paper, we study random walks on the Apollonian network with a trap fixed at a given hub node (i.e. node with the highest degree), which are simultaneously scale-free and small-world. We obtain the precise analytic expression for the MFPT that is confirmed by direct numerical calculations. In the large system size limit, the MFPT approximately grows as a power-law function of the number of nodes, with the exponent much less than 1, which is significantly different from the scaling for some regular networks or fractals, such as regular lattices, Sierpinski fractals, T-graph, and complete graphs. The Apollonian network is the most efficient configuration for transport by diffusion among all previously studied structure., Comment: Definitive version accepted for publication in EPL (Europhysics Letters)
- Published
- 2009
- Full Text
- View/download PDF
71. Recursive solutions for Laplacian spectra and eigenvectors of a class of growing treelike networks
- Author
-
Zhang, Zhongzhi, Qi, Yi, Zhou, Shuigeng, Lin, Yuan, and Guan, Jihong
- Subjects
Condensed Matter - Statistical Mechanics - Abstract
The complete knowledge of Laplacian eigenvalues and eigenvectors of complex networks plays an outstanding role in understanding various dynamical processes running on them; however, determining analytically Laplacian eigenvalues and eigenvectors is a theoretical challenge. In this paper, we study the Laplacian spectra and their corresponding eigenvectors of a class of deterministically growing treelike networks. The two interesting quantities are determined through the recurrence relations derived from the structure of the networks. Beginning from the rigorous relations one can obtain the complete eigenvalues and eigenvectors for the networks of arbitrary size. The analytical method opens the way to analytically compute the eigenvalues and eigenvectors of some other deterministic networks, making it possible to accurately calculate their spectral characteristics., Comment: Definitive version accepted for publication in Physical Reivew E
- Published
- 2009
- Full Text
- View/download PDF
72. Epidemic spreading with nonlinear infectivity in weighted scale-free networks
- Author
-
Chu, Xiangwei, Zhang, Zhongzhi, Guan, Jihong, and Zhou, Shuigeng
- Subjects
Quantitative Biology - Populations and Evolution ,Physics - Physics and Society - Abstract
In this paper, we investigate the epidemic spreading for SIR model in weighted scale-free networks with nonlinear infectivity, where the transmission rate in our analytical model is weighted. Concretely, we introduce the infectivity exponent $\alpha$ and the weight exponent $\beta$ into the analytical SIR model, then examine the combination effects of $\alpha$ and $\beta$ on the epidemic threshold and phase transition. We show that one can adjust the values of $\alpha$ and $\beta$ to rebuild the epidemic threshold to a finite value, and it is observed that the steady epidemic prevalence $R$ grows in an exponential form in the early stage, then follows hierarchical dynamics. Furthermore, we find $\alpha$ is more sensitive than $\beta$ in the transformation of the epidemic threshold and epidemic prevalence, which might deliver some useful information or new insights in the epidemic spreading and the correlative immunization schemes., Comment: 17 pages, 12 figures
- Published
- 2009
73. Exact solution for mean first-passage time on a pseudofractal scale-free web
- Author
-
Zhang, Zhongzhi, Qi, Yi, Zhou, Shuigeng, Xie, Wenlei, and Guan, Jihong
- Subjects
Condensed Matter - Statistical Mechanics - Abstract
The explicit determinations of the mean first-passage time (MFPT) for trapping problem are limited to some simple structure, e.g., regular lattices and regular geometrical fractals, and determining MFPT for random walks on other media, especially complex real networks, is a theoretical challenge. In this paper, we investigate a simple random walk on the the pseudofractal scale-free web (PSFW) with a perfect trap located at a node with the highest degree, which simultaneously exhibits the remarkable scale-free and small-world properties observed in real networks. We obtain the exact solution for the MFPT that is calculated through the recurrence relations derived from the structure of PSFW. The rigorous solution exhibits that the MFPT approximately increases as a power-law function of the number of nodes, with the exponent less than 1. We confirm the closed-form solution by direct numerical calculations. We show that the structure of PSFW can improve the efficiency of transport by diffusion, compared with some other structure, such as regular lattices, Sierpinski fractals, and T-graph. The analytical method can be applied to other deterministic networks, making the accurate computation of MFPT possible., Comment: 6 pages, 1 figure; definitive version published in Physical Review E
- Published
- 2009
- Full Text
- View/download PDF
74. Traffic Fluctuations on Weighted Networks
- Author
-
Zhang, Yichao, Zhou, Shi, Zhang, Zhongzhi, Guan, Jihong, Zhou, Shuigeng, and Chen, Guanrong
- Subjects
Condensed Matter - Statistical Mechanics ,Condensed Matter - Disordered Systems and Neural Networks - Abstract
Traffic fluctuation has so far been studied on unweighted networks. However many real traffic systems are better represented as weighted networks, where nodes and links are assigned a weight value representing their physical properties such as capacity and delay. Here we introduce a general random diffusion (GRD) model to investigate the traffic fluctuation in weighted networks, where a random walk's choice of route is affected not only by the number of links a node has, but also by the weight of individual links. We obtain analytical solutions that characterise the relation between the average traffic and the fluctuation through nodes and links. Our analysis is supported by the results of numerical simulations. We observe that the value ranges of the average traffic and the fluctuation, through nodes or links, increase dramatically with the level of heterogeneity in link weight. This highlights the key role that link weight plays in traffic fluctuation and the necessity to study traffic fluctuation on weighted networks., Comment: a paper with 11 pages, 6 figures, 40 references
- Published
- 2009
75. Boosting scRNA-seq data clustering by cluster-aware feature weighting
- Author
-
Li, Rui-Yi, Guan, Jihong, and Zhou, Shuigeng
- Published
- 2021
- Full Text
- View/download PDF
76. Protein–protein interaction prediction based on ordinal regression and recurrent convolutional neural networks
- Author
-
Xu, Weixia, Gao, Yangyun, Wang, Yang, and Guan, Jihong
- Published
- 2021
- Full Text
- View/download PDF
77. CPP: Towards comprehensive privacy preserving for query processing in information networks
- Author
-
Liu, Chaobin, Zhou, Shuigeng, Hu, Haibo, Tang, Yuzhe, Guan, Jihong, and Ma, Yao
- Published
- 2018
- Full Text
- View/download PDF
78. Weakly Correlated Multimodal Sentiment Analysis: New Dataset and Topic-oriented Model
- Author
-
Liu, Wuchao, primary, Li, Wengen, primary, Ruan, Yu-Ping, primary, Shu, Yulou, primary, Chen, Juntao, primary, Li, Yina, primary, Yu, Caili, primary, zhang, Yichao, primary, Guan, Jihong, primary, and Zhou, Shuigeng, primary
- Published
- 2023
- Full Text
- View/download PDF
79. Bird Object Detection: Dataset Construction, Model Performance Evaluation, and Model Lightweighting
- Author
-
Wang, Yang, primary, Zhou, Jiaogen, additional, Zhang, Caiyun, additional, Luo, Zhaopeng, additional, Han, Xuexue, additional, Ji, Yanzhu, additional, and Guan, Jihong, additional
- Published
- 2023
- Full Text
- View/download PDF
80. MuSTC: A Multi-Stage Spatio–Temporal Clustering Method for Uncovering the Regionality of Global SST
- Author
-
Peng, Han, primary, Li, Wengen, additional, Jin, Chang, additional, Yang, Hanchen, additional, and Guan, Jihong, additional
- Published
- 2023
- Full Text
- View/download PDF
81. Self-supervised learning with chemistry-aware fragmentation for effective molecular property prediction
- Author
-
Xie, Ailin, primary, Zhang, Ziqiao, additional, Guan, Jihong, additional, and Zhou, Shuigeng, additional
- Published
- 2023
- Full Text
- View/download PDF
82. All in One: Multi-Task Prompting for Graph Neural Networks
- Author
-
Sun, Xiangguo, primary, Cheng, Hong, additional, Li, Jia, additional, Liu, Bo, additional, and Guan, Jihong, additional
- Published
- 2023
- Full Text
- View/download PDF
83. PCGAN: a generative approach for protein complex identification from protein interaction networks
- Author
-
Pan, Yuliang, primary, Wang, Yang, additional, Guan, Jihong, additional, and Zhou, Shuigeng, additional
- Published
- 2023
- Full Text
- View/download PDF
84. Molecular property prediction by semantic-invariant contrastive learning
- Author
-
Zhang, Ziqiao, primary, Xie, Ailin, additional, Guan, Jihong, additional, and Zhou, Shuigeng, additional
- Published
- 2023
- Full Text
- View/download PDF
85. Structural and spectral properties of a family of deterministic recursive trees: Rigorous solutions
- Author
-
Qi, Yi, Zhang, Zhongzhi, Ding, Bailu, Zhou, Shuigeng, and Guan, Jihong
- Subjects
Condensed Matter - Statistical Mechanics - Abstract
As one of the most significant models, the uniform recursive tree (URT) has found many applications in a variety of fields. In this paper, we study rigorously the structural features and spectral properties of the adjacency matrix for a family of deterministic uniform recursive trees (DURTs) that are deterministic versions of URT. Firstly, from the perspective of complex networks, we investigate analytically the main structural characteristics of DURTs, and obtain the accurate solutions for these properties, which include degree distribution, average path length, distribution of node betweenness, and degree correlations. Then we determine the complete eigenvalues and their corresponding eigenvectors of the adjacency matrix for DURTs. Our research may shed light in better understanding of the features for URT. Also, the analytical methods used here is capable of extending to many other deterministic networks, making the precise computation of their properties (especially the full spectrum characteristics) possible., Comment: Definitive version published in Journal of Physics A: Mathematical and Theoretical
- Published
- 2008
- Full Text
- View/download PDF
86. Different thresholds of bond percolation in scale-free networks with identical degree sequence
- Author
-
Zhang, Zhongzhi, Zhou, Shuigeng, Zou, Tao, Chen, Lichao, and Guan, Jihong
- Subjects
Condensed Matter - Statistical Mechanics - Abstract
Generally, the threshold of percolation in complex networks depends on the underlying structural characterization. However, what topological property plays a predominant role is still unknown, despite the speculation of some authors that degree distribution is a key ingredient. The purpose of this paper is to show that power-law degree distribution itself is not sufficient to characterize the threshold of bond percolation in scale-free networks. To achieve this goal, we first propose a family of scale-free networks with the same degree sequence and obtain by analytical or numerical means several topological features of the networks. Then, by making use of the renormalization group technique we determine the threshold of bond percolation in our networks. We find an existence of non-zero thresholds and demonstrate that these thresholds can be quite different, which implies that power-law degree distribution does not suffice to characterize the percolation threshold in scale-free networks., Comment: Definitive version published in Physical Review E
- Published
- 2008
- Full Text
- View/download PDF
87. The rigorous solution for the average distance of a Sierpinski network
- Author
-
Zhang, Zhongzhi, Chen, Lichao, Fang, Lujun, Zhou, Shuigeng, Zhang, Yichao, and Guan, Jihong
- Subjects
Condensed Matter - Statistical Mechanics - Abstract
The closed-form solution for the average distance of a deterministic network--Sierpinski network--is found. This important quantity is calculated exactly with the help of recursion relations, which are based on the self-similar network structure and enable one to derive the precise formula analytically. The obtained rigorous solution confirms our previous numerical result, which shows that the average distance grows logarithmically with the number of network nodes. The result is at variance with that derived from random networks., Comment: Definitive version (9 pages, 6 figures) published in J. Stat. Mech
- Published
- 2008
- Full Text
- View/download PDF
88. Mapping Koch curves into scale-free small-world networks
- Author
-
Zhang, Zhongzhi, Gao, Shuyang, Chen, Lichao, Zhou, Shuigeng, Zhang, Hongjuan, and Guan, Jihong
- Subjects
Condensed Matter - Statistical Mechanics ,Mathematical Physics ,Physics - Physics and Society - Abstract
The class of Koch fractals is one of the most interesting families of fractals, and the study of complex networks is a central issue in the scientific community. In this paper, inspired by the famous Koch fractals, we propose a mapping technique converting Koch fractals into a family of deterministic networks, called Koch networks. This novel class of networks incorporates some key properties characterizing a majority of real-life networked systems---a power-law distribution with exponent in the range between 2 and 3, a high clustering coefficient, small diameter and average path length, and degree correlations. Besides, we enumerate the exact numbers of spanning trees, spanning forests, and connected spanning subgraphs in the networks. All these features are obtained exactly according to the proposed generation algorithm of the networks considered. The network representation approach could be used to investigate the complexity of some real-world systems from the perspective of complex networks., Comment: Definitive version accepted for publication in Journal of Physics A
- Published
- 2008
- Full Text
- View/download PDF
89. Standard random walks and trapping on the Koch network with scale-free behavior and small-world effect
- Author
-
Zhang, Zhongzhi, Zhou, Shuigeng, Xie, Wenlei, Chen, Lichao, Lin, Yuan, and Guan, Jihong
- Subjects
Physics - Physics and Society ,Condensed Matter - Statistical Mechanics - Abstract
A vast variety of real-life networks display the ubiquitous presence of scale-free phenomenon and small-world effect, both of which play a significant role in the dynamical processes running on networks. Although various dynamical processes have been investigated in scale-free small-world networks, analytical research about random walks on such networks is much less. In this paper, we will study analytically the scaling of the mean first-passage time (MFPT) for random walks on scale-free small-world networks. To this end, we first map the classical Koch fractal to a network, called Koch network. According to this proposed mapping, we present an iterative algorithm for generating the Koch network, based on which we derive closed-form expressions for the relevant topological features, such as degree distribution, clustering coefficient, average path length, and degree correlations. The obtained solutions show that the Koch network exhibits scale-free behavior and small-world effect. Then, we investigate the standard random walks and trapping issue on the Koch network. Through the recurrence relations derived from the structure of the Koch network, we obtain the exact scaling for the MFPT. We show that in the infinite network order limit, the MFPT grows linearly with the number of all nodes in the network. The obtained analytical results are corroborated by direct extensive numerical calculations. In addition, we also determine the scaling efficiency exponents characterizing random walks on the Koch network., Comment: 12 pages, 8 figures. Definitive version published in Physical Review E
- Published
- 2008
- Full Text
- View/download PDF
90. Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks
- Author
-
Zhang, Zhongzhi, Zhang, Yichao, Zhou, Shuigeng, Yin, Ming, and Guan, Jihong
- Subjects
Physics - Physics and Society ,Condensed Matter - Statistical Mechanics - Abstract
Various real-life networks exhibit degree correlations and heterogeneous structure, with the latter being characterized by power-law degree distribution $P(k)\sim k^{-\gamma}$, where the degree exponent $\gamma$ describes the extent of heterogeneity. In this paper, we study analytically the average path length (APL) of and random walks (RWs) on a family of deterministic networks, recursive scale-free trees (RSFTs), with negative degree correlations and various $\gamma \in (2,1+\frac{\ln 3}{\ln 2}]$, with an aim to explore the impacts of structure heterogeneity on APL and RWs. We show that the degree exponent $\gamma$ has no effect on APL $d$ of RSFTs: In the full range of $\gamma$, $d$ behaves as a logarithmic scaling with the number of network nodes $N$ (i.e. $d \sim \ln N$), which is in sharp contrast to the well-known double logarithmic scaling ($d \sim \ln \ln N$) previously obtained for uncorrelated scale-free networks with $2 \leq \gamma <3$. In addition, we present that some scaling efficiency exponents of random walks are reliant on degree exponent $\gamma$., Comment: The definitive verion published in Journal of Mathematical Physics
- Published
- 2008
- Full Text
- View/download PDF
91. Transition from fractal to non-fractal scalings in growing scale-free networks
- Author
-
Zhang, Zhongzhi, Zhou, Shuigeng, Chen, Lichao, and Guan, Jihong
- Subjects
Condensed Matter - Other Condensed Matter - Abstract
Real networks can be classified into two categories: fractal networks and non-fractal networks. Here we introduce a unifying model for the two types of networks. Our model network is governed by a parameter $q$. We obtain the topological properties of the network including the degree distribution, average path length, diameter, fractal dimensions, and betweenness centrality distribution, which are controlled by parameter $q$. Interestingly, we show that by adjusting $q$, the networks undergo a transition from fractal to non-fractal scalings, and exhibit a crossover from `large' to small worlds at the same time. Our research may shed some light on understanding the evolution and relationships of fractal and non-fractal networks., Comment: 7 pages, 3 figures, definitive version accepted for publication in EPJB
- Published
- 2008
- Full Text
- View/download PDF
92. Exact solution of mean geodesic distance for Vicsek fractals
- Author
-
Zhang, Zhongzhi, Zhou, Shuigeng, Chen, Lichao, Yin, Ming, and Guan, Jihong
- Subjects
Condensed Matter - Disordered Systems and Neural Networks - Abstract
The Vicsek fractals are one of the most interesting classes of fractals and the study of their structural properties is important. In this paper, the exact formula for the mean geodesic distance of Vicsek fractals is found. The quantity is computed precisely through the recurrence relations derived from the self-similar structure of the fractals considered. The obtained exact solution exhibits that the mean geodesic distance approximately increases as an exponential function of the number of nodes, with the exponent equal to the reciprocal of the fractal dimension. The closed-form solution is confirmed by extensive numerical calculations., Comment: 4 pages, 3 figures
- Published
- 2008
- Full Text
- View/download PDF
93. Random Sierpinski network with scale-free small-world and modular structure
- Author
-
Zhang, Zhongzhi, Zhou, Shuigeng, Su, Zhan, Zou, Tao, and Guan, Jihong
- Subjects
Condensed Matter - Statistical Mechanics - Abstract
In this paper, we define a stochastic Sierpinski gasket, on the basis of which we construct a network called random Sierpinski network (RSN). We investigate analytically or numerically the statistical characteristics of RSN. The obtained results reveal that the properties of RSN is particularly rich, it is simultaneously scale-free, small-world, uncorrelated, modular, and maximal planar. All obtained analytical predictions are successfully contrasted with extensive numerical simulations. Our network representation method could be applied to study the complexity of some real systems in biological and information fields., Comment: 7 pages, 9 figures; final version accepted for publication in EPJB
- Published
- 2008
- Full Text
- View/download PDF
94. Finite epidemic thresholds in fractal scale-free `large-world' networks
- Author
-
Zhang, Zhongzhi, Zhou, Shuigeng, Zou, Tao, and Guan, Jihong
- Subjects
Condensed Matter - Other Condensed Matter - Abstract
It is generally accepted that scale-free networks is prone to epidemic spreading allowing the onset of large epidemics whatever the spreading rate of the infection. In the paper, we show that disease propagation may be suppressed in particular fractal scale-free networks. We first study analytically the topological characteristics of a network model and show that it is simultaneously scale-free, highly clustered, "large-world", fractal and disassortative. Any previous model does not have all the properties as the one under consideration. Then, by using the renormalization group technique we analyze the dynamic susceptible-infected-removed (SIR) model for spreading of infections. Interestingly, we find the existence of an epidemic threshold, as compared to the usual epidemic behavior without a finite threshold in uncorrelated scale-free networks. This phenomenon indicates that degree distribution of scale-free networks does not suffice to characterize the epidemic dynamics on top of them. Our results may shed light in the understanding of the epidemics and other spreading phenomena on real-life networks with similar structural features as the considered model., Comment: 9 pages, 3 figures
- Published
- 2008
95. Topologies and Laplacian spectra of a deterministic uniform recursive tree
- Author
-
Zhang, Zhongzhi, Zhou, Shuigeng, Qi, Yi, and Guan, Jihong
- Subjects
Condensed Matter - Statistical Mechanics - Abstract
The uniform recursive tree (URT) is one of the most important models and has been successfully applied to many fields. Here we study exactly the topological characteristics and spectral properties of the Laplacian matrix of a deterministic uniform recursive tree, which is a deterministic version of URT. Firstly, from the perspective of complex networks, we determine the main structural characteristics of the deterministic tree. The obtained vigorous results show that the network has an exponential degree distribution, small average path length, power-law distribution of node betweenness, and positive degree-degree correlations. Then we determine the complete Laplacian spectra (eigenvalues) and their corresponding eigenvectors of the considered graph. Interestingly, all the Laplacian eigenvalues are distinct., Comment: 7 pages, 1 figures, definitive version accepted for publication in EPJB
- Published
- 2008
- Full Text
- View/download PDF
96. Optimal Trade Execution Based on Deep Deterministic Policy Gradient
- Author
-
Ye, Zekun, primary, Deng, Weijie, additional, Zhou, Shuigeng, additional, Xu, Yi, additional, and Guan, Jihong, additional
- Published
- 2020
- Full Text
- View/download PDF
97. Degree and component size distributions in generalized uniform recursive tree
- Author
-
Zhang, Zhongzhi, Zhou, Shuigeng, Zhao, Shanghong, Guan, Jihong, and Zou, Tao
- Subjects
Condensed Matter - Statistical Mechanics - Abstract
We propose a generalized model for uniform recursive tree (URT) by introducing an imperfect growth process, which may generate disconnected components (clusters). The model undergoes an interesting phase transition from a singly connected network to a graph consisting of fully isolated nodes. We investigate the distributions of degree and component sizes by both theoretical predictions and numerical simulations. For the nontrivial cases, we show that the network has an exponential degree distribution while its component size distribution follows a power law, both of which are related to the imperfect growth process. We also predict the growth dynamics of the individual components. All analytical solutions are successfully contrasted with computer simulations., Comment: 4 pages, 3 figures
- Published
- 2007
- Full Text
- View/download PDF
98. A Synthetical Weights' Dynamic Mechanism for Weighted Networks
- Author
-
Fang, Lujun, Zhang, Zhongzhi, Zhou, Shuigeng, and Guan, Jihong
- Subjects
Physics - Physics and Society - Abstract
We propose a synthetical weights' dynamic mechanism for weighted networks which takes into account the influences of strengths of nodes, weights of links and incoming new vertices. Strength/Weight preferential strategies are used in these weights' dynamic mechanisms, which depict the evolving strategies of many real-world networks. We give insight analysis to the synthetical weights' dynamic mechanism and study how individual weights' dynamic strategies interact and cooperate with each other in the networks' evolving process. Power-law distributions of strength, degree and weight, nontrivial strength-degree correlation, clustering coefficients and assortativeness are found in the model with tunable parameters representing each model. Several homogenous functionalities of these independent weights' dynamic strategy are generalized and their synergy are studied., Comment: 14pages, 9 figures
- Published
- 2007
99. Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
- Author
-
Zhang, Zhongzhi, Zhou, Shuigeng, Fang, Lujun, Guan, Jihong, and Zhang, Yichao
- Subjects
Physics - Physics and Society - Abstract
Many real networks share three generic properties: they are scale-free, display a small-world effect, and show a power-law strength-degree correlation. In this paper, we propose a type of deterministically growing networks called Sierpinski networks, which are induced by the famous Sierpinski fractals and constructed in a simple iterative way. We derive analytical expressions for degree distribution, strength distribution, clustering coefficient, and strength-degree correlation, which agree well with the characterizations of various real-life networks. Moreover, we show that the introduced Sierpinski networks are maximal planar graphs., Comment: 6 pages, 5 figures, accepted by EPL
- Published
- 2007
- Full Text
- View/download PDF
100. Exact analytical solution of average path length for Apollonian networks
- Author
-
Zhang, Zhongzhi, Chen, Lichao, Zhou, Shuigeng, Fang, Lujun, Guan, Jihong, and Zou, Tao
- Subjects
Condensed Matter - Statistical Mechanics ,Physics - Physics and Society - Abstract
The exact formula for the average path length of Apollonian networks is found. With the help of recursion relations derived from the self-similar structure, we obtain the exact solution of average path length, $\bar{d}_t$, for Apollonian networks. In contrast to the well-known numerical result $\bar{d}_t \propto (\ln N_t)^{3/4}$ [Phys. Rev. Lett. \textbf{94}, 018702 (2005)], our rigorous solution shows that the average path length grows logarithmically as $\bar{d}_t \propto \ln N_t$ in the infinite limit of network size $N_t$. The extensive numerical calculations completely agree with our closed-form solution., Comment: 8 pages, 4 figures
- Published
- 2007
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.