相关论文: Structure controllability of complex network based…

We consider a minimal controllability problem (MCP), which determines the minimum number of input nodes for a descriptor system to be structurally controllable. We investigate the "forbidden nodes" in descriptor systems, denoting nodes that…

Nodes of minimum connected dominating set (MCDS) form a virtual backbone in a wireless adhoc network. In this paper, a modified approach is presented to determine MCDS of an underlying graph of a Wireless Adhoc network. Simulation results…

Networks with a given degree distribution may be very resilient to one type of failure or attack but not to another. The goal of this work is to determine network design guidelines which maximize the robustness of networks to both random…

This paper investigates observability/controllability of a networked dynamic system (NDS) in which system matrices of its subsystems are expressed through linear fractional transformations (LFT). Some relations have been obtained between…

We consider a network of identical, first-order linear systems, and investigate how replacing a subset of the systems composing the network with higher-order ones, either taken to be generic or specifically designed, may affect its…

The problem Power Dominating Set (PDS) is motivated by the placement of phasor measurement units to monitor electrical networks. It asks for a minimum set of vertices in a graph that observes all remaining vertices by exhaustively applying…

We investigate choice-driven network growth. In this model, nodes are added one by one according to the following procedure: for each addition event a set of target nodes is selected, each according to linear preferential attachment, and a…

This paper introduces a method to generate hierarchically modular networks with prescribed node degree list by link switching. Unlike many existing network generating models, our method does not use link probabilities to achieve modularity.…

We present an analysis of the topologies of a class of networks which are optimal in terms of the requirements of having as short a route as possible between any two nodes while yet keeping the congestion in the network as low as possible.…

Structure and dynamics of complex networks usually deal with degree distributions, clustering, shortest path lengths and other graph properties. Although these concepts have been analysed for graphs on abstract spaces, many networks happen…

In network control theory, driving all the nodes in the Feedback Vertex Set (FVS) forces the network into one of its attractors (long-term dynamic behaviors). The FVS is often composed of more nodes than can be realistically manipulated in…

How to observe the state of a network from a limited number of measurements has become an important issue in complex networks, engineering, communication, epidemiology, etc. Under some scenarios, it is neither unfeasible nor unnecessary to…

To understand the controllability of complex networks is a forefront problem relevant to different fields of science and engineering. Despite recent advances in network controllability theories, an outstanding issue is to understand the…

In the study of ad hoc sensor networks, clustering plays an important role in energy conservation therefore analyzing the mechanics of such topology can be helpful to make logistic decisions .Using the theory of complex network the…

This paper studies structural controllability for a networked dynamic system (NDS), in which each subsystem may have different dynamics, and unknown parameters may exist both in subsystem dynamics and in subsystem interconnections. In…

The increasing complexity and interconnectedness of systems across various fields have led to a growing interest in studying complex networks, particularly Scale-Free (SF) networks, which best model real-world systems. This paper…

We introduce a new type of fully computable problems, for DSS dedicated to maximal spanning tree problems, based on deduction and choice: preferential consistency problems. To show its interest, we describe a new compact representation of…

The power dominating set (PDS) problem is the following extension of the well-known dominating set problem: find a smallest-size set of nodes $S$ that power dominates all the nodes, where a node $v$ is power dominated if (1) $v$ is in $S$…

The characterization of the "most connected" nodes in static or slowly evolving complex networks has helped in understanding and predicting the behavior of social, biological, and technological networked systems, including their robustness…

Extensive researches have been dedicated to investigating the performance of real networks and synthetic networks against random failures or intentional attack guided by degree (degree attack). Degree is one of straightforward measures to…