The physical position neighbourhood evolving network model

Many social, technological, biological and economical systems are properly described by evolved network models. In this paper, a new evolving network model with the concept of physical position neighbourhood connectivity is proposed and studied. This concept exists in many real complex networks such as communication networks. The simulation results for network parameters such as the first nonzero eigenvalue and maximal eigenvalue of the graph Laplacian, clustering coefficients, average distances and degree distributions for different evolving parameters of this model are presented. The dynamical behaviour of each node on the consensus problem is also studied. It is found that the degree distribution of this new model represents a transition between power-law and exponential scaling, while the Barábasi-Albert scale-free model is only one of its special (limiting) cases. It is also found that the time to reach a consensus becomes shorter sharply with increasing of neighbourhood scale of the nodes.     

A neighbourhood evolving network model

Many social, technological, biological and economical systems are best described by evolved network models. In this short Letter, we propose and study a new evolving network model. The model is based on the new concept of neighbourhood connectivity, which exists in many physical complex networks. The statistical properties and dynamics of the proposed model is analytically studied and compared with those of Barabási–Albert scale-free model. Numerical simulations indicate that this network model yields a transition between power-law and exponential scaling, while the Barabási–Albert scale-free model is only one of its special (limiting) cases. Particularly, this model can be used to enhance the evolving mechanism of complex networks in the real world, such as some social networks development.     

Multi-agent coordination in directed moving neighbourhood random networks

This paper considers the consensus problem of dynamical multiple agents that communicate via a directed moving neighbourhood random network.Each agent performs random walk on a weighted directed network.Agents interact with each other through random unidirectional information flow when they coincide in the underlying network at a given instant.For such a framework,we present sufficient conditions for almost sure asymptotic consensus.Numerical examples are taken to show the effectiveness of the obtained results.     

Pinning consensus analysis of multi-agent networks with arbitrary topology

In this paper the pinning consensus of multi-agent networks with arbitrary topology is investigated. Based on the properties of M-matrix, some criteria of pinning consensus are established for the continuous multi-agent network and the results show that the pinning consensus of the dynamical system depends on the smallest real part of the eigenvalue of the matrix which is composed of the Laplacian matrix of the multi-agent network and the pinning control gains. Meanwhile, the relevant work for the discrete-time system is studied and the corresponding criterion is also obtained. Particularly, the fundamental problem of pinning consensus, that is, what kind of node should be pinned, is investigated and the positive answers to this question are presented. Finally, the correctness of our theoretical findings is demonstrated by some numerical simulated examples.     

Social networks: Evolving graphs with memory dependent edges

The plethora of digital communication technologies, and their mass take up, has resulted in a wealth of interest in social network data collection and analysis in recent years. Within many such networks the interactions are transient: thus those networks evolve over time. In this paper we introduce a class of models for such networks using evolving graphs with memory dependent edges, which may appear and disappear according to their recent history. We consider time discrete and time continuous variants of the model. We consider the long term asymptotic behaviour as a function of parameters controlling the memory dependence. In particular we show that such networks may continue evolving forever, or else may quench and become static (containing immortal and/or extinct edges). This depends on the existence or otherwise of certain infinite products and series involving age dependent model parameters. We show how to differentiate between the alternatives based on a finite set of observations. To test these ideas we show how model parameters may be calibrated based on limited samples of time dependent data, and we apply these concepts to three real networks: summary data on mobile phone use from a developing region; online social-business network data from China; and disaggregated mobile phone communications data from a reality mining experiment in the US. In each case we show that there is evidence for memory dependent dynamics, such as that embodied within the class of models proposed here.     

基于Sierpinski分形垫的确定性复杂网络演化模型研究

近年来,人们发现大量真实网络都表现出小世界和无尺度的特性,由此复杂网络演化模型成为学术界研究的热点问题.本文基于Sierpinski分形垫,通过迭代的方式构造了两个确定性增长的复杂网络模型,即小世界网络模型(S-DSWN)和无尺度网络模型(S-DSFN);其次,给出了确定性网络模型的迭代生成算法,解析计算了其主要拓扑特性,结果表明两个网络模型在度分布、集聚系数和网络直径等结构特性方面与许多现实网络相符合;最后,提出了一个确定性的统一模型(S-DUM),将S-DSWN与S-DSFN纳入到一个框架之下,为复杂网络的相关研究提供理论基础.特别地,发现这些网络模型都是极大平面图.     

Simplification of the Gram Matrix Eigenvalue Problem for Quadrature Amplitude Modulation Signals

In quantum information science, it is very important to solve the eigenvalue problem of the Gram matrix for quantum signals. This allows various quantities to be calculated, such as the error probability, mutual information, channel capacity, and the upper and lower bounds of the reliability function. Solving the eigenvalue problem also provides a matrix representation of quantum signals, which is useful for simulating quantum systems. In the case of symmetric signals, analytic solutions to the eigenvalue problem of the Gram matrix have been obtained, and efficient computations are possible. However, for asymmetric signals, there is no analytic solution and universal numerical algorithms that must be used, rendering the computations inefficient. Recently, we have shown that, for asymmetric signals such as amplitude-shift keying coherent-state signals, the Gram matrix eigenvalue problem can be simplified by exploiting its partial symmetry. In this paper, we clarify a method for simplifying the eigenvalue problem of the Gram matrix for quadrature amplitude modulation (QAM) signals, which are extremely important for applications in quantum communication and quantum ciphers. The results presented in this paper are applicable to ordinary QAM signals as well as modified QAM signals, which enhance the security of quantum cryptography.     

脉冲展宽下水下激光PPM信号解调方法的研究

在水下激光脉位调制(PPM)通信中,脉冲的时域展宽容易导致时隙串扰,进而严重影响通信质量。针对这一问题,对光PPM取样信号最大似然时隙(MLC)解调和最大累加计数样值(MAS)解调进行了改进。并根据激光脉冲水下传输后其能量分布的特点,在MAS解调的基础上,提出最大变权重累加计数(MVA)解调。计算机仿真结果表明,相比MAS解调,MVA解调时能明显改善时隙串扰情况下的PPM信号解调性能,并且对水下光信道的随机性有较好的自适应能力,证明了MVA解调方法的有效性,对水下激光无线通信的应用具有重要的实际意义。     

一种新型电力网络局域世界演化模型

现实世界中的许多系统都可以用复杂网络来描述,电力系统是人类创造的最为复杂的网络系统之一.当前经典的网络模型与实际电力网络存在较大差异.从电力网络本身的演化机理入手,提出并研究了一种可以模拟电力网络演化规律的新型局域世界网络演化模型.理论分析表明该模型的度分布具有幂尾特性,且幂律指数在3—∞之间可调.最后通过对中国北方电网和美国西部电网的仿真以及和无标度网络、随机网络的对比,验证了该模型可以很好地反映电力网络的演化规律,并且进一步证实了电力网络既不是无标度网络,也不是完全的随机网络. 关键词： 电力网络 演化模型 局域世界 幂律分布     

Spatio-temporal dynamics of security investments in an interdependent risk environment

In a globalised world where risks spread through contagion, the decision of an entity to invest in securing its premises from stochastic risks no longer depends solely on its own actions but also on the actions of other interacting entities in the system. This phenomenon is commonly seen in many domains including airline, logistics and computer security and is referred to as Interdependent Security (IDS). An IDS game models this decision problem from a game-theoretic perspective and deals with the behavioural dynamics of risk-reduction investments in such settings. This paper enhances this model and investigates the spatio-temporal aspects of the IDS games. The spatio-temporal dynamics are studied using simple replicator dynamics on a variety of network structures and for various security cost tradeoffs that lead to different Nash equilibria in an IDS game. The simulation results show that the neighbourhood configuration has a greater effect on the IDS game dynamics than network structure. An in-depth empirical analysis of game dynamics is carried out on regular graphs, which leads to the articulation of necessary and sufficient conditions for dominance in IDS games under spatial constraints.     

Emergent collective behaviors on coopetition networks

Cooperation and competition are two typical interactional relationships for intra-networks and inter-networks. This paper investigates the modeling of coopetition networks and the collective dynamics on such networks. The coopetition networks are firstly modeled by directed signed graphs. The evolutionary relationships among individuals on the coopetition networks are described by a neighbor-based dynamics model, which is also called multi-agent system (MAS). Then, under a weak connectivity assumption that the signed network has a spanning tree, some sufficient conditions are derived for the consensus, polarization or fragmentation behaviors of the MAS with the help of the structural balance theory. At the same time, signless Laplacian matrix and signed Laplacian matrix are introduced to analyze the collective dynamics of the MAS on coopetition networks. Finally, simulation results are provided to demonstrate the emergence of diverse collective behaviors on coopetition networks.     

Reference model based consensus control of second-order multi-agent systems

This paper deals with the consensus problem of multi-agent systems with second-order dynamics.The objective is to design algorithms such that all agents will have same positions and velocities.First,a reference model based consensus algorithm is proposed.It is proved that the consensus can be achieved if the communication graph has a spanning tree.Different from most of the consensus algorithms proposed in the literature,the parameters of the control laws are different among agents.Therefore,each agent can design its control law independently.Secondly,it gives a consensus algorithm for the case that the velocities of the agents are not available.Thirdly,the effectiveness of the input delay and the communication delay is considered.It shows that consensus can be achieved if the input delay of every agent is smaller than a bound related to parameters in its control law.Finally,some numerical examples are given to illustrate the proposed results.     

On the distributions of Laplacian eigenvalues versus node degrees in complex networks

In this paper, the important issue of Laplacian eigenvalue distributions is investigated through theory-guided extensive numerical simulations, for four typical complex network models, namely, the ER random-graph networks, WS and NW small-world networks, and BA scale-free networks. It is found that these four types of complex networks share some common features, particularly similarities between the Laplacian eigenvalue distributions and the node degree distributions.     

Inverse Eigenvalue Problems for Exploring the Dynamics of Systems Biology Models

This paper describes inverse eigenvalue problems that arise in studying qualitative dynamics in systems biology models. An algorithm based on lift-and-project iterations is proposed, where the lifting step entails solving a constrained matrix inverse eigenvalue problem. In particular, prior to carrying out the iterative steps, $a$-$priori$ bounds on the entries of the Jacobian matrix are computed by relying on the reaction network structure as well as the form of the rate law expressions for the model under consideration. Numerical results on a number of models show that the proposed algorithm can be used to computationally explore the possible dynamical scenarios while identifying the important mechanisms via the use of sparsity-promoting regularization.     

Time-dependent collective behavior in a computer network model

The collective dynamics of large-scale computer networks remains elusive due to not only the internal adaptive behaviors of network-wide flows, but also the spatial–temporal changes in the external environment. In this paper, we investigate the time-dependent collective behavior by using a computer network model, recently developed to study space–time characteristics of congestion in large networks. We use the evolving correlation pattern, the largest eigenvalue, and the information entropy to analyze the macroscopic pattern of changing network congestion. We find the collective behavior becomes more pronounced during transient periods of pattern shifting, and the macroscopic pattern becomes gradually indistinct as the observed timescale increases to some extent. We also find that the evolving pattern of spatial–temporal correlation is more useful to reveal the time-dependent collective behavior of our model at different forcing levels.     

A survey on UAV placement optimization for UAV-assisted communication in 5G and beyond networks

With the increase in capacity demands and the requirement of ubiquitous coverage in the fifth generation and beyond wireless communications networks, unmanned aerial vehicles (UAVs) have acquired a great attention owing to their outstanding characteristics over traditional base stations and relays. UAVs can be deployed faster and with much lower expenditure than ground base stations. In addition, UAVs can enhance the network performance thanks to their strong line-of-sight link conditions with their associated users and their dynamic nature that adapts to varying network conditions. Optimization of the UAV 3D locations in a UAV-assisted wireless communication network was considered in a large body of research as it is a critical design issue that greatly affects communication performance. Although the topic of UAV placement optimization was considered in few surveys, these surveys reviewed only a small part of the growing literature. In addition, the surveys were brief and did not discuss many important design issues such as the objectives of the optimization problem, the adopted solution techniques, the air-to-ground channel models, the transmission media for access and backhaul links, the limited energy nature of the UAV on-board batteries, co-channel interference and spectrum sharing, the interference management, etc. Motivated by the importance of the topic of UAV placement optimization as well as the need for a detailed review of its recent literature, we survey 100 of the recent research papers and provide in-depth discussion to fill the gaps found in the previous survey papers. The considered research papers are summarized and categorized to highlight the differences in the deployment scenario and system model, the optimization objectives and parameters, the proposed solution techniques, and the decision-making strategies and many other points. We also point to some of the existing challenges and potential research directions that have been considered in the surveyed literature and that requires to be considered     

Competing edge networks

We introduce a model for a pair of nonlinear evolving networks, defined over a common set of vertices, subject to edgewise competition. Each network may grow new edges spontaneously or through triad closure. Both networks inhibit the other?s growth and encourage the other?s demise. These nonlinear stochastic competition equations yield to a mean field analysis resulting in a nonlinear deterministic system. There may be multiple equilibria; and bifurcations of different types are shown to occur within a reduced parameter space. This situation models competitive communication networks such as BlackBerry Messenger displacing SMS; or instant messaging displacing emails.     

Beam steering and deflecting device using step-based micro-blazed grating

The rapidly evolving demands of optical communications and optical switching systems have created a new market for high capacity all-optical beam steering and deflecting techniques. One technology potentially capable of realizing such systems uses the multistep micro-blazed grating optical beam deflectors based on binary and multiple-phase modulation methods. The micro-optical element has been fabricated by introducing very large scale integration (VLSI), stepping photolithography and reactive ion etching (RIE), which can realize beam steering, deflecting, splitting, and switching in free space, and its diffraction properties are determined by the blazed-grating parameters, such as the number of steps, grating depth, grating period, as well as blazed profile. The theoretical analysis and primarily experimental result show that this phase-type element has the advantages of high diffractive efficiency, low cross talk, small feature size, and high reliability due to nonmechanical beam steering without any moving parts. Hence it is ideally suited to applications in optical communication and optical interconnection network.     

Weighted coupling for geographical networks: Application to reducing consensus time in sensor networks

Although many complex real-world networks are weighted, unweighted networks are used in many applications such as sensor networks. In this Letter it is shown using properly weighted networks the performance can be greatly enhanced by reducing the time necessary for the average consensus. Random geographical models are adapted as network models and a method based on mutually coupled phase oscillators is used for providing average consensus over the network. The consensus time is calculated by numerically solving the network's differential equations and monitoring the average error. The simulation results on some sample networks show that the consensus time is dramatically reduced when the proposed weights are used for the links of the underlying network.     

Epidemics in small world networks

For many infectious diseases, a small-world network on an underlying regular lattice is a suitable simplified model for the contact structure of the host population. It is well known that the contact network, described in this setting by a single parameter, the small-world parameter p, plays an important role both in the short term and in the long term dynamics of epidemic spread. We have studied the effect of the network structure on models of immune for life diseases and found that in addition to the reduction of the effective transmission rate, through the screening of infectives, spatial correlations may strongly enhance the stochastic fluctuations. As a consequence, time series of unforced Susceptible-Exposed-Infected-Recovered (SEIR) models provide patterns of recurrent epidemics with realistic amplitudes, suggesting that these models together with complex networks of contacts are the key ingredients to describe the prevaccination dynamical patterns of diseases such as measles and pertussis. We have also studied the role of the host contact strucuture in pathogen antigenic variation, through its effect on the final outcome of an invasion by a viral strain of a population where a very similar virus is endemic. Similar viral strains are modelled by the same infection and reinfection parameters, and by a given degree of cross immunity that represents the antigenic distance between the competing strains. We have found, somewhat surprisingly, that clustering on the network decreases the potential to sustain pathogen diversity.