插值多项式对函数|x|α的逼近

研究插值多项式对|x|α达到最佳逼近度的一种构造方法,证明了当n=2m,m∈N,α∈(0,1]时, Fn(a)＜[2(2/3)]/na, 其中F2m(α)=max1≤x≤1||x|α-R2m(x)|,R2m(x)是以x0=0,xj=cos(j-1/2)π/2m(j=1,2,…,2m)为插值结点的对|x|α的Lagrange插值多项式,从而推广了M.Revers的结论.     

A modified evidential methodology of identifying influential nodes in weighted networks

How to identify influential nodes in complex networks is still an open hot issue. In the existing evidential centrality (EVC), node degree distribution in complex networks is not taken into consideration. In addition, the global structure information has also been neglected. In this paper, a new Evidential Semi-local Centrality (ESC) is proposed by modifying EVC in two aspects. Firstly, the Basic Probability Assignment (BPA) of degree generated by EVC is modified according to the actual degree distribution, rather than just following uniform distribution. BPA is the generation of probability in order to model uncertainty. Secondly, semi-local centrality combined with modified EVC is extended to be applied in weighted networks. Numerical examples are used to illustrate the efficiency of the proposed method.     

Community structure discovery method based on the Gaussian kernel similarity matrix

Community structure discovery in complex networks is a popular issue, and overlapping community structure discovery in academic research has become one of the hot spots. Based on the Gaussian kernel similarity matrix and spectral bisection, this paper proposes a new community structure discovery method. First, by adjusting the Gaussian kernel parameter to change the scale of similarity, we can find the corresponding non-overlapping community structure when the value of the modularity is the largest relatively. Second, the changes of the Gaussian kernel parameter would lead to the unstable nodes jumping off, so with a slight change in method of non-overlapping community discovery, we can find the overlapping community nodes. Finally, synthetic data, karate club and political books datasets are used to test the proposed method, comparing with some other community discovery methods, to demonstrate the feasibility and effectiveness of this method.     

Efficient overlapping community detection in huge real-world networks

The detection of overlapping community structure in networks can give insight into the structures and functions of many complex systems. In this paper, we propose a simple but efficient overlapping community detection method for very large real-world networks. Taking a high-quality, non-overlapping partition generated by existing, efficient, non-overlapping community detection methods as input, our method identifies overlapping nodes between each pair of connected non-overlapping communities in turn. Through our analysis on modularity, we deduce that, to become an overlapping node without demolishing modularity, nodes should satisfy a specific condition presented in this paper. The proposed algorithm outputs high quality overlapping communities by efficiently identifying overlapping nodes that satisfy the above condition. Experiments on synthetic and real-world networks show that in most cases our method is better than other algorithms either in the quality of results or the computational performance. In some cases, our method is the only one that can produce overlapping communities in the very large real-world networks used in the experiments.     

多元分次Lagrange插值

对多元多项式分次插值适定结点组的构造理论进行了深入的研究与探讨.在沿无重复分量代数曲线进行Lagrange插值的基础上,给出了沿无重复分量分次代数曲线进行分次Lagrane插值的方法,并利用这一结果进一步给出了在R~2上构造分次Lagrange插值适定结点组的基本方法.另外,利用弱Gr(o|¨)bner基这一新的数学概念,以及构造平面代数曲线上插值适定结点组的理论,进一步给出了构造平面分次代数曲线上分次插值适定结点组的方法,从而基本上弄清了多元分次Lagrange插值适定结点组的几何结构和基本特征.     

Generalized function projective (lag, anticipated and complete) synchronization between two different complex networks with nonidentical nodes

Generalized function projective (lag, anticipated and complete) synchronization between two different complex networks with nonidentical nodes is investigated in this paper. Based on Barbalat’s lemma, some sufficient synchronization criteria are derived by applying the nonlinear feedback control. Although previous work studied function projective synchronization on complex dynamical networks, the dynamics of the nodes are coupled partially linear chaotic systems. In our work, the dynamics of the nodes of the complex networks are any chaotic systems without the limitation of the partial linearity. In addition, each network can be undirected or directed, connected or disconnected, and nodes in either network may have identical or different dynamics. The proposed strategy is applicable to almost all kinds of complex networks. Numerical simulations further verify the effectiveness and feasibility of the proposed synchronization method. Numeric evidence shows that the synchronization rate is sensitively influenced by the feedback strength, the time delay, the network size and the network topological structure.     

A novel criterion for cluster synchronization of complex dynamical networks with coupling time-varying delays

This paper investigates the cluster synchronization problem for the time-varying delays coupling networks with nonidentical delayed dynamical systems by using pinning control method. We derive some simple and useful criteria for cluster synchronization for any initial values through an effective feedback control scheme and propose an adaptive feedback strategy that adjusts automatically the coupling strength. Finally, some numerical examples are then given to illustrate the theoretical results.     

二分网上的靴襻渗流

靴襻渗流最早应用于统计物理学中研究磁铁因非磁性杂质导致磁有序的降低并最终消失的现象. 随着复杂网络研究的深入, 许多学者展开网络上的靴襻渗流研究. 在自然界中, 许多系统自然呈现出二分结构, 二分网络是复杂网络中的一种重要的网络模式. 本文通过建立动力学方程和计算机仿真模拟的方法研究二分网上的靴襻渗流, 关注的参数是二分网中两类节点初始的活跃比例和活跃阈值, 分别用f₁, f₂和Ω₁, Ω₂表示, 得到二分网两类节点终态活跃比例随初始活跃比例的变化会发生相变等结论. 同时 验证了动力学方程与仿真模拟的一致性.     

An improved GPS method with a new pseudo-peripheral nodes finder in finite element analysis

Finding pseudo-peripheral nodes with the largest eccentricity is important in matrix bandwidth and profile reduction algorithms in finite element analysis. A heuristic parameter, called the “width-depth ratio” and denoted by κ, is presented for finding the pseudo-peripheral nodes with larger pseudo-diameter compared with the GPS (Gibbs-Poole-Stockmeyer) pseudo-peripheral nodes finder. A novel nodes renumbering algorithm is thus developed by using our nodes finder based on GPS method. Simulations show that proposed nodes finder is reliable and effective in locating the proper pseudo-peripheral nodes with larger pseudo-diameters. A shielded microstrip line is given as an example to testify the ability of the proposed algorithm in application. The results, including time, pseudo-diameter, bandwidths and profiles, all indicate that our method is more competitive than GPS algorithm to be used as the nodes renumbering algorithm.