Weigang Sun

Verified

Weigang verified their affiliation via an institutional email.

Learn more

Verified

Weigang verified their affiliation via an institutional email.

Learn more

• Doctor of Philosophy
• Professor (Full) at Hangzhou Dianzi University

In this paper, we study lag synchronization between two coupled networks via pinning control, including the linear and adaptive feedback pinning schemes. Using the Schur complement and Barbalat’s lemma, we obtain two theorems for the lag synchronization between these two coupled networks with identical topologies and observe that the node dynamics...

In this study, we focus on the non-local impact of saddles in a multiply connected gene regulation network. We find that so-called saddle-ghosts, that is to say the impact saddles impart on dynamics even if the saddles are remote, is significant and can be essentially dominating the nature of the dynamics the network presents. We focused our enquir...

This brief investigates a leader selection problem within leader-follower consensus systems based on node centrality indices. The performance of leader-follower networks is characterized in terms of its coherence quantified by the eigenvalues of the principal submatrix derived from the Laplacian matrix. To obtain exact connections between leaders s...

In this paper, we study the consensus of a family of recursive trees with novel features that include the initial states that are controlled by a parameter. The consensus problem in a linear system with additive noises is characterized as network coherence, which is defined by a Laplacian spectrum. Based on the structures of our recursive treelike...

Parkinson’s disease is the neurodegenerative disorder which involves both neurons and non-neurons, and whose symptoms are usually represented by the error index and synchronization index in the computational study. This paper combines with the classical basal ganglia-thalamic network model and tripartite synapse model to explore the internal effect...

Accurately distinguishing stages of Alzheimer’s disease (AD) is crucial for diagnosis and treatment. In this paper, we introduce a stacking classifier method that combines six single classifiers into a stacking classifier. Using brain network models and network metrics, we employ t-tests to identify abnormal brain regions, from which we construct a...

In a supply chain network (SCN), the failure of one node may result in cascading failures and lead to the paralysis of the entire network. The accurate identification of the critical nodes in a SCN is important for securing the supply chain. This study proposes a new method for identifying critical nodes in SCNs based on the topological and functio...

Background Chemical graph theory is a crucial tool for characterizing molecular properties and reactions. It utilizes a rigorous mathematical framework to reveal the complex structures and dynamics of molecules. Methods The atomic structure of boron is incorporated into an n-dimensional oxide network to create two sets of boron-embedded benzenoid...

The Kirchhoff index is a fundamental topological metric that provides insights into the structural and electrical characteristics of networks. It is defined as the sum of resistance distances between all pairs of nodes, serving as a key factor in understanding the dynamics within networks. To investigate the impact of structural variations on the K...

In this paper, we investigate the structural robustness and optimization of leader-follower coherence, quantified by the eigenvalues of the grounded Laplacian matrix, which measures the deviation between leaders and followers. To examine the impacts of network couplings and leader assignments on coherence, we select star-coupled networks as base mo...

This paper introduces an improved weighted nuclear norm with a total variation model tailored for removing multiplicative noise. The model incorporates a weight matrix to regularize the residual matrix, effectively leveraging image redundancy to differentiate various statistical properties of the noise. Since there is no guarantee of a unique solut...

Random walk is a stochastic process that moves through a network between different states according to a set of probability rules. This mechanism is crucial for understanding the importance of nodes and their similarities, and it is widely used in page ranking, information retrieval and community detection. In this study, we introduce a family of r...

Unlabelled: The role of network metrics in exploring brain networks of mental illness is crucial. This study focuses on quantifying a node controllability index (CA-scores) and developing a novel framework for studying the dysfunction of attention deficit hyperactivity disorder (ADHD) brains. By analyzing fMRI data from 143 healthy controls and 10...

This paper investigates a leader–follower consensus problem of multi-layer networks and understands the role of leader’s allocations in the process of consensus. Leader–follower coherence quantified by the spectrum measures the extent of consensus between leaders and followers in the system under additive noise. In order to study the exact interpla...

Coupled star networks coupled by hub nodes have attracted significant interest due to the interplay between their coupling forms and dynamics. This paper introduces a novel family of chain star networks that are connected via a small number of leaf nodes. The coherence of these star networks is quantified using the Laplacian spectrum. By leveraging t...

We study the impact of the distance between two hubs on network coherence defined by Laplacian eigenvalues. Network coherence is a measure of the extent of consensus in a linear system with additive noise. To obtain an exact determination of coherence based on the distance, we choose a family of tree networks with two hubs controlled by two paramet...

In this paper, we aim to study the role of hubs in the network coherence quantified by the Laplacian spectra and choose two families of unicyclic and bicyclic networks with the same network size as our network models. In order to investigate the influence of adding links on the coherence, we construct four types of bicyclic networks with the same a...

To explore the difference in the impact of transverse bracing on the seismic effect of through concrete-filled steel tube arch bridges with non-isolated and earthquake-isolated, nine non-isolated and earthquake-isolated structural models under different cross-bracing arrangements were established, and Elcentro seismic waves were selected. The inter...

In this paper, we aim to study the effect of the leader's positions in leader-follower coherence quantified by the spectrum in noisy asymmetric networks with a set of hub nodes. In order to compare the impact of leader selection in different ways on the studied coherence, we choose a family of ring-trees networks to conveniently assign the leaders...

In this paper, circuit implementation and anti-synchronization are studied in coupled nonidentical fractional-order chaotic systems where a fractance module is introduced to approximate the fractional derivative. Based on the open-plus-closed-loop control, a nonlinear coupling strategy is designed to realize the anti-synchronization in the fraction...

In this paper, we propose a general acute myeloid leukemia (AML) model and introduce an immune response and time delays into this model to investigate their effects on the dynamics. Based on the existence, stability and local bifurcation of three types of equilibria, we show that the immune response is a best strategy for the control of the AML on...

To explore the different influence of traveling wave effect on the isolated and non-isolated arch bridge, the isolated and non-isolated multi-span arch bridges models are established respectively, three measured seismic waves were selected, and under the eight kinds of apparent wave velocities and multi-point consistent excitations, the structural...

In this paper, the synchronizability characterized by the Laplacian spectrum is applied to windmill networks where three types of parameters are introduced to control the number of deleted nodes. Using the network’s structures, exact solutions of the Laplacian eigenvalues are obtained and metrics of the synchronizability are correspondingly shown....

The Laplacian spectra are often used to characterize topological properties and dynamical characteristics of the networks. In this paper, we analytically calculate the network coherence quantified by the Laplacian spectra, which is a measurement of the extent of consensus in the coupled systems with the noise. Due to complex interactions between tw...

In this paper, the leaderless coherence and leader–follower coherence defined by the Laplacian spectrum are applied to noisy trees with given parameters. The asymmetry of the trees is controlled by the degrees of hub nodes. Based on the tree’s structures, analytical solutions are obtained for these two types of consensus algorithms. In order to com...

In this paper, we propose a family of unicyclic graphs to study robustness of network coherence quantified by the Laplacian spectrum, which measures the extent of consensus under the noise. We adjust the network parameters to change the structural asymmetries with an aim of studying their effects on the coherence. Using the graph’s structures and m...

In this paper, we study noisy consensus dynamics in two families of weighted ring-trees networks and recursive trees with a controlled initial state. Based on the topological structures, we obtain exact expressions for the first- and second-order network coherence as a function of the involved parameters and provide the scalings of network coherenc...

This paper studies consensus dynamics in symmetric and asymmetric trees with leader selection under additive noise environment, which is characterized as leader-follower coherence determined by the spectrum. In order to compare the effect of the leader's positions on the coherence, we choose a tree-like network model and employ three different ways...

In this work, we study the behavior of a time-delayed mutually repressive auto-activating three-gene system. Delays are introduced to account for the location difference between DNA transcription that leads to production of messenger RNA and its translation that result in protein synthesis. We study the dynamics of the system using numerical simula...

In the present study, two types of consensus algorithms, including the leaderless coherence and the leader–follower coherence quantified by the Laplacian spectrum, are applied to noisy windmill graphs. Based on the graph construction, exact solutions are obtained for the leader–follower coherence with freely assigned leaders. In order to compare co...

This paper investigates leader-follower network coherence in a noisy ring-trees network model with preassigned leaders at the initial state. Different from existing works on designing consensus algorithms in the multi-agent systems, the leader-follower coherence characterized by the eigenvalues of a principal submatrix obtained from the Laplacian m...

In this paper, we study network coherence characterizing the consensus behaviors with additive noise in a family of book graphs. It is shown that the network coherence is determined by the eigenvalues of the Laplacian matrix. Using the topological structures of book graphs, we obtain recursive relationships for the Laplacian matrix and Laplacian ei...

This paper investigates the robustness of first-order coherence characterized by the Laplacian spectrum in duplex networks with varying interlayer linking topologies and node connections of two layers under degree, closeness and eigenvector centrality indicators. The interlayer linking weight and linking rate play an important role in the coherence...

The first-return time (FRT) is an effective measurement of random walks. Presently, it has attracted considerable attention with a focus on its scalings with regard to network size. In this paper, we propose a family of generalized and weighted transfractal networks and obtain the scalings of the FRT for a prescribed initial hub node. By employing...

In this paper, we investigate adaptive outer synchronization for identifying unknown network topology and parameters between two coupled complex networks with time-varying delays existing in the node dynamics and coupling forms. By designing adaptive controllers and updating laws, we obtain two theorems on the appearance of outer synchronization us...

This brief investigates robustness of the consensus characterized as coherence in the noisy scale-free networks under average degree, random nodal failures and target attacks. A new centrality index named as leader centrality is proposed to identify more influential spreaders based on the coherence. It is shown that the leaderless and leader-follow...

In this paper, we study the scaling for mean first-passage time (MFPT) of random walks on the hypercube and obtain a closed-form formula for the MFPT over all node pairs. We also determine the exponent of scaling efficiency characterizing the random walks and compare it with those of the existing networks. Finally we study the random walks on the h...

In this paper, we study anti-synchronization between two coupled networks where the node dynamics has an unknown system parameter. By designing adaptive and pinning control schemes, we realize the anti-synchronization. By Lyapunov stability theory, we obtain two theorems on the appearance of anti-synchronization. In addition, we derive a criterion...

In response to a pulsed electric field, spatial distributed heterogeneities in excitable media can serve as nucleation sites for the generation of intramural electrical waves, a phenomenon called as “wave emission from heterogeneities” (WEH effect). Heterogeneities in cardiac tissue strongly influence each other in the WEH effect. We study the WEH...

In this paper, we use a hybrid feedback control method to study lag synchronization in uncertain drive-response dynamical networks with a feature that the unknown system parameter exists in the node dynamics. We then design two hybrid feedback control methods to achieve the lag synchronization including the linear and adaptive feedback control. Wit...

In this paper, we propose a new matching (called a conditional matching), where the condition refers to the matching of the new constructed network which includes all the nodes in the original network. We then enumerate the conditional matchings of the new network and prove that the number of conditional matchings is just the product of degree sequ...

In this paper, we study a nonlinear third-order multipoint boundary value problem by the monotone iterative method. We then obtain the existence of monotone positive solutions and establish iterative schemes for approximating the solutions. In addition, we extend the considered problem to the Riemann-Liouville-type fractional analogue. Finally, we...

In this paper, we study lag synchronization between two dynamical networks with nonderivative and derivative couplings via pinning control. We design two types of pinning control schemes, including linear and adaptive feedback controllers. With the corresponding control algorithms, we obtain two theorems on the lag synchronization based on Schur co...

In this paper, we calculate the Hosoya index in a family of deterministic recursive trees with a special feature that includes new nodes which are connected to existing nodes with a certain rule. We then obtain a recursive solution of the Hosoya index based on the operations of a determinant. The computational complexity of our proposed algorithm i...

Many of the topological and dynamical properties of a network are related to its Laplacian spectrum; these properties include network diameter, Kirchho index, and mean first-passage time. This paper investigates consensus dynamics in a linear dynamical system with additive stochastic disturbances, which is characterized as network coherence by the...

In this paper, we calculate the number of spanning trees in prism and antiprism graphs corresponding to the skeleton of a prism and an antiprism. By the electrically equivalent transformations and rules of weighted generating function, we obtain a relationship for the weighted number of spanning trees at the successive two generations. Using the kn...

In this paper, we propose a novel method to calculate the Hosoya index of a tree by associating a vertex with a weight. Compared to the existing methods that include calculating the sum of the absolute values of all coefficients of the characteristic polynomial or computing the determinant of a tree's matrix, the complexity of computability of our...

In this paper, we study random walks in a family of delayed tree-like networks controlled by two network parameters, where an immobile trap is located at the initial node. The novel feature of this family of networks is that the existing nodes have a time delay to give birth to new nodes. By the self-similar network structure, we obtain exact solut...

We consider practical synchronization on complex dynamical networks under linear feedback control designed by optimal control theory. The control goal is to minimize global synchronization error and control strength over a given finite time interval, and synchronization error at terminal time. By utilizing the Pontryagin's minimum principle, and ba...

In this paper, we calculate the number of spanning trees on two families of generalized pseudo- fractal networks with two controllable parameters. The initial state is a complete graph with an arbitrary number of nodes as a generalization of a triangle. In the subsequent steps, each existing edge (newly produced edge) gives birth to finite new node...

In this paper, we study consensus problems in a family of tree networks and investigate first and second order consensus denoted as network coherence characterized by Laplacian spectrum. According to the tree structures, we obtain the recursive relationships of Laplacian matrix and its Laplacian eigenvalues at two successive generations. We then ob...

Recent research works have been pursued in connection with network synchronizability under various constraints for different topological structures and evolving mechanisms. However, the fundamental question of how the synchronizability of the networks relates to accelerated growth and ad hoc property in the evolving processes remains underexplored....

In this paper, we study two types of synchronization between two coupled networks with interactions, including inner synchronization inside each network and outer synchronization between two networks with the adaptive controllers. By Barbalat's lemma and linear matrix inequality (LMI), we obtain a sufficient condition for each network to be asympto...

Based on a reactive multiple particle collision method, we construct a mesoscopic dynamics model to simulate chemical system. The validity of the reactive multiple particle collision method under various conditions in a double-feedback bi-stable chemical system is studied. Then, we extend it to simulate diffusion-limited reactions with fast reactio...

This paper investigates generalized outer synchronization between two uncertain dynamical networks with a novel feature that the couplings of each network are unknown functions. With nonlinear control schemes, two sufficient criteria for generalized outer synchronization with or without time delay are obtained by Lyapunov stability theory and Barba...

In this paper, we obtain exact scalings of mean first-passage time (MFPT) of random walks on a family of small-world treelike networks formed by two parameters, which includes three kinds. First, we determine the MFPT for a trapping problem with an immobile trap located at the initial node, which is defined as the average of the first-passage times...

In this paper, we calculate the Laplacian spectra of a 3-prism graph and apply them. This graph is both planar and polyhedral, and belongs to the generalized Petersen graph. Using the regular structures of this graph, we obtain the recurrent relationships for Laplacian matrix between this graph and its initial state — a triangle — and further deriv...

For deterministically growing networks, it is a theoretical challenge to determine the topological properties and dynamical processes. In this paper, we study random walks on generalized Koch networks with features that include an initial state that is a globally connected network to r nodes. In each step, every existing node produces m complete gr...

Recently a great deal of effort has been made to explicitly determine the mean first-passage time (MFPT) between two nodes averaged over all pairs of nodes on a fractal network. In this paper, we first propose a family of generalized delayed recursive trees characterized by two parameters, where the existing nodes have a time delay to produce new n...

In this paper we study the problem of enumerating spanning trees on Apollonian networks and obtain an exact expression for the number of spanning trees, which is relevant to some dynamical characteristics of networks, such as reliability, synchronization and random walks. In addition, we compare the entropy of spanning trees on our networks with th...

In a generic model of excitable media, we simulate wave emission from a heterogeneity (WEH) induced by an electric field. Based on the WEH effect, a rotating electric field is proposed to terminate existed spatiotemporal turbulence. Compared with the effects resulted by a periodic pulsed electric field, the rotating electric field displays several...

The Fibonacci numbers are the numbers defined by the linear recurrence equation, in which each subsequent number is the sum of the previous two. In this paper, we propose Fibonacci networks using Fibonacci numbers. The analytical expressions involving degree distribution, average path length and mean first passage time are obtained. This kind of ne...

In this paper, we study the scaling for mean first passage time (MFPT) of random walks on the generalized pseudofractal web (GPFW) with a trap, where an initial state is transformed from a triangle to a r-polygon and every existing edge gives birth to finite nodes in the subsequent step. We then obtain an analytical expression and an exact scaling...

On the basis of Koch networks constructed using Koch fractals, we propose a family of Koch networks with novel features including an initial state that is a complete graph with an arbitrary number of nodes as a generalization of a triangle. In the subsequent evolving steps, existing nodes create finite complete graphs. The analytical expressions fo...

In this paper, we theoretically and numerically investigate anti-synchronization between two weighted dynamical networks. Based on the Barbalat lemma, we propose two adaptive controllers to realize the global anti-synchronization between two networks with both equivalent and different topological structures. In addition, we derive two theorems on t...

We investigate synchronization between two discrete-time networks with mutual couplings, including inner synchronization inside each network and outer synchronization between two networks. We then obtain a synchronized criterion for the inner synchronization inside each network by the method of linear matrix inequality and derive a relationship be...

In this paper, we study mean first-passage time (MFPT) for random walks on a network through edge iteration. The feature of this kind of network is that every existing edge gives birth to finite nodes at each step. According to the network structures, we obtain the analytical expression for MFPT, which shows that the MFPT grows as a power-law funct...

On the basis of recursive trees, we propose a new kind of deterministic recursive trees (DRT) with a feature that the initial state of recursive trees is a lattice with an arbitrary number of nodes. In the subsequent evolving step, existing nodes create finite nodes. We obtain analytical formulae for degree distribution and average path length. We...

In this paper, we study the scaling for the mean first-passage time (MFPT) of the random walks on a generalized Koch network with a trap. Through the network construction, where the initial state is transformed from a triangle to a polygon, we obtain the exact scaling for the MFPT. We show that the MFPT grows linearly with the number of nodes and t...

In this paper, synchronization between two coupled populations of non-identical phase oscillators is investigated. Generalizing the linear reformulation [9], we could find explicit expressions of the synchronization order parameters, which include the phase coherence within each population and the phase coherence between two populations. Finally, n...

We present a novel filled function approach to solve box-constrained system of nonlinear equations. The system is first transformed into an equivalent nonsmooth global minimization problem, and then a new filled function method is proposed to solve this global optimization problem. Numerical experiments on several test problems are conducted and th...

On the basis of pseudofractal networks (PFNs), we propose a family of delayed pseudofractal networks (DPFNs) with a special feature that newly added edges delay producing new nodes, differing from the evolution algorithms of PFNs where all existing edges simultaneously generate new nodes. We obtain analytical formulae for degree distribution, clust...

A stock market is a typical complex network and it can be described by complex network. Recently more related researches have focused on modeling and analyzing of topological structure of complex stock network. For an investor, the best decision is to select the optimal portfolio in order to obtain the maximum income with the given risk level. In t...

On the basis of the recursive trees, we propose a kind of delayed recursive trees with the feature that not all the existing nodes produce new nodes in each evolving step. Using the solutions of difference equation, the analytical expression of the average distance is obtained. This family of delayed recursive trees exhibits small-world characteris...

In this Chapter, we study the outer synchronization between two discrete-time networks with time delay. Firstly we introduce time delay into our models and discuss the delay effects. The synchronization conditions are derived. Finally a numerical example is shown to illustrate our theoretical results.

This paper studies the synchronized motions between two complex networks with time delays, which include individual inner synchronization in each network and outer synchronization between two networks. Based on the Lyapunov stability theory and the linear matrix equality (LMI), a synchronous criterion for inner synchronization inside each network i...

In clinical practice, brain death is the irreversible end of all brain activity. Compared to current statistical methods for the determination of brain death, we focus on the approach of complex networks for real-world electroencephalography in its determination. Brain functional networks constructed by correlation analysis are derived, and statist...

This paper studies anti-synchronization and its control between two coupled networks with nonlinear signal's connection and the inter-network actions. If anti-synchronization does not exist between two such networks, adaptive controllers are designed to anti-synchronize them. Different node dynamics and nonidentical topological structures are consi...

In this article, synchronization inside complex networks with double time-delays and nonlinear inner-coupling functions are studied. Here double time-delays mean that each node vector field and every coupling node have retard time, while nonlinear inner-coupling functions refer to all the components of every node that are nonlinearly coupled. The t...

On the basis of Koch networks that were constructed using Koch fractals, we propose a family of Koch networks with novel features that include an initial state that is a complete graph with an arbitrary number of nodes as a generalization of a triangle. In the subsequent evolutionary step, existing nodes create finite complete graphs. The analytica...

In this chapter we study synchronization for two coupled networks. Synchronization conditions between two networks which have same topological connectivity are derived. Then numerical examples are given to demonstrate that synchronization between two networks with directed or undirected topological connections can be achieved.

This paper studies two kinds of synchronization between two discrete-time networks with time delays, including inner synchronization within each network and outer synchronization between two networks. Based on Lyapunov stability theory and linear matrix inequality (LMI), sufficient conditions for two discrete-time networks to be asymptotic stabilit...

In this paper, we study synchronization of delayed map lattices with scale-free interactions. By numerical simulations and theoretical analysis, we find that time delays influence the network synchronization but the heterogeneity seems to have little effect on network synchronization, yet no synchronization happens with the homogeneously topologica...

Real-world systems in nature can be described by complex networks. It is of current interest for researchers to construct network models depicting complex systems. In this paper, the generalized Koch network is proposed, which exhibits some properties of Koch networks. Analytical expressions involving the degree distribution, clustering coefficient...

In this paper a class of networks with multiple connections are discussed. The multiple connections include two different types of links between nodes in complex networks. For this new model, we give a simple generating procedure. Furthermore, we investigate dynamical synchronization behavior in a delayed two-layer network, giving corresponding the...

In this paper, generalized synchronization (GS) between two coupled complex networks is theoretically and numerically studied, where the node vectors in different networks are not the same, and the numbers of nodes of both networks are not necessarily equal. First, a sufficient criterion for GS, one kind of outer synchronizations, of two coupled ne...

In this paper, synchronization between two discrete-time networks, called "outer synchronization" for brevity, is theoretically and numerically studied. First, a sufficient criterion for this outer synchronization between two coupled discrete-time networks which have the same connection topologies is derived analytically. Numerical examples are als...

Based on partial contraction principle, we study the complete synchronisation for approximately globally coupled networks (almost all nodes are connected). By contraction for a system, we mean that initial conditions or temporary disturbances are forgotten exponentially fast, so that all trajectories of this system converge to a unique trajectory....

Synchronization and bifurcation analysis in coupled networks of discrete-time systems are investigated in the present paper. We mainly focus on some special coupling matrix, i.e., the sum of each row equals a nonzero constant u and the network connection is directed. A result that the network can reach a new synchronous state, which is not the asym...

Synchronization between two discrete-time dynamical networks is studied in this paper, this is a substantial generalization of a lot of recent works on synchronization inside a network. We mainly study the case that both networks are of the same topological connectivity, a criterion is derived which guarantees the synchronization. Linearization app...

We study synchronization for two unidirectionally coupled networks. This is a substantial generalization of several recent papers investigating synchronization inside a network. We derive analytically a criterion for the synchronization of two networks which have the same (inside) topological connectivity. Then numerical examples are given which fi...