A Collaboration Network Model with Multiple Evolving Factors

To describe the empirical data of collaboration networks, several evolving mechanisms have been proposed, which usually introduce different dynamics factors controlling the network growth. These models can reasonably reproduce the empirical degree distributions for a number of we11-studied real-world collaboration networks. On the basis of the previous studies, in this work we propose a collaboration network model in which the network growth is simultaneously controlled by three factors, including partial preferential attachment, partial random attachment and network growth speed. By using a rate equation method, we obtain an analytical formula for the act degree distribution. We discuss the dependence of the act degree distribution on these different dynamics factors. By fitting to the empirical data of two typical collaboration networks, we can extract the respective contributions of these dynamics factors to the evolution of each networks.

Graph Theory Methods for Decomposition w.r.t. Outputs of Boolean Control Networks

This paper focuses graph theory method for the problem of decomposition w.r.t. outputs for Boolean control networks(BCNs). First, by resorting to the semi-tensor product of matrices and the matrix expression of BCNs, the definition of decomposition w.r.t. outputs is introduced. Second, by referring to the graphical structure of BCNs, a necessary and sufficient condition for the decomposition w.r.t. outputs is obtained based on graph theory method. Third, an effective algorithm to realize the maximum decomposition w.r.t. outputs is proposed. Finally, some examples are addressed to validate the theoretical results.

On the centers of quantum groups of A_n-type

Let g be the finite dimensional simple Lie algebra of type A_n, and let U = U_q(g,Λ)and U= U_q(g,Q)be the quantum groups defined over the weight lattice and over the root lattice, respectively. In this paper, we find two algebraically independent central elements in U for all n ≥ 2 and give an explicit formula of the Casimir elements for the quantum group U = U_q(g,Λ), which corresponds to the Casimir element of the enveloping algebra U(g). Moreover, for n = 2 we give explicitly generators of the center subalgebras of the quantum groups U = U_q(g,Λ) and U = U_q(g,Q).

A quasi-dynamic model and a symplectic algorithm of super slender Kirchhoff rod

Recently the Kirchhoff rod and the methods of dynamical analogue have been widely used in modeling DNA.The features of a DNA such as its super slender and super large deformation raise new challenges in modeling and numerical simulations of a Kirchhoff rod.In this paper,Euler parameters are introduced to set up the quasi-Hamilton system of an elastic rod,then a symplectic algorithm is applied in its numerical simulations.Finally,a simplified surface model of the rod is given based on the hypothesis of rigid cross-section.

Distributed Penalized Modal Regression for Massive Data

Nowadays,researchers are frequently confronted with challenges from massive data computing by a number of limitations of computer primary memory.Modal regression(MR)is a good alternative of the mean regression and likelihood based methods,because of its robustness and high efficiency.To this end,the authors extend MR to massive data analysis and propose a computationally and statistically efficient divide and conquer MR method(DC-MR).The major novelty of this method consists of splitting one entire dataset into several blocks,implementing the MR method on data in each block,and deriving final results through combining these regression results via a weighted average,which provides approximate estimates of regression results on the entire dataset.The proposed method significantly reduces the required amount of primary memory,and the resulting estimator is theoretically as efficient as the traditional MR on the entire data set.The authors also investigate a multiple hypothesis testing variable selection approach to select significant parametric components and prove the approach possessing the oracle property.In addition,the authors propose a practical modified modal expectation-maximization(MEM)algorithm for the proposed procedures.Numerical studies on simulated and real datasets are conducted to assess and showcase the practical and effective performance of our proposed methods.

ALTERNATING DIRECTION IMPLICIT SCHEMES FOR THE TWO-DIMENSIONAL TIME FRACTIONAL NONLINEAR SUPER-DIFFUSION EQUATIONS

As is known,there exist numerous alternating direction implicit(ADI)schemes for the two-dimensional linear time fractional partial differential equations(PDEs).However,if the ADI schemes for linear problems combined with local linearization techniques are applied to solve nonlinear problems,the stability and convergence of the methods are often not clear.In this paper,two ADI schemes are developed for solving the two-dimensional time fractional nonlinear super-diffusion equations based on their equivalent partial integrodifferential equations.In these two schemes,the standard second-order central difference approximation is used for the spatial discretization,and the classical first-order approximation is applied to discretize the Riemann-Liouville fractional integral in time.The solvability,unconditional stability and L2 norm convergence of the proposed ADI schemes are proved rigorously.The convergence order of the schemes is 0(τ+hx^2+hy^2),where τ is the temporal mesh size,hx and hy are spatial mesh sizes in the x and y directions,respectively.Finally,numerical experiments are carried out to support the theoretical results and demonstrate the performances of two ADI schemes.

A superlinear convergence scheme for nonlinear fractional differential equations and its fast implement

In this paper,we first construct an efficient scheme for nonlinear Caputo fractional differential equations with the initial value and the fractional degree 0<α<1.Then,the unconditional stability and the superlinear convergence with the order 1+αof the proposed scheme are strictly proved and discussed.Due to the nonlocal property of fractional operators,the new scheme is time-consuming for long-time simulations.Thus,a fast implement of the proposed scheme is presented based on the sum-of-exponentials(SOE)approximation for the kernel tα−1 on the interval[h,T]in the Riemann-Liouville integral,where h is the stepsize.Some numerical experiments are provided to support the theoretical results of the new scheme and demonstrate the computational performance of its fast implement.

A superlinear numerical scheme for multi-term fractional nonlinear ordinary differential equations

In this paper,we present a superlinear numerical method for multi-term fractional nonlinear ordinary differential equations(MTFNODEs).First,the presented problem is equivalently transformed into its integral form with multi-term Riemann-Liouville integrals.Second,the compound product trapezoidal rule is used to approximate the fractional integrals.Then,the unconditional stability and convergence with the order 1+αN−1−αN−2 of the proposed scheme are strictly established,whereαN−1 andαN−2 are the maximum and the second maximum fractional indexes in the considered MTFNODEs,respectively.Finally,two numerical examples are provided to support the theoretical results.