Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAltering control modes of complex networks based on edge removal
100
0
0.0
(
0
)
Added by
Xizhe Zhang
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Controlling a complex network is of great importance in many applications. The network can be controlled by inputting external control signals through some selected nodes, which are called input nodes. Previous works found that the majority of the nodes in dense networks are either the input nodes or not, which leads to the bimodality in controlling the complex networks. Due to the physical or economic constraints of many real control scenarios, altering the control mode of a network may be critical to many applications. Here we develop a graph-based algorithm to alter the control mode of a network. The main idea is to change the control connectivity of nodes by removing carefully selected edges. We rigorously prove the correctness of our algorithm and evaluate its performance on both synthetic and real networks. The experimental results show that the control mode of a network can be easily changed by removing few selected edges. Our methods provide the ability to design the desired control mode for different control scenarios, which may be useful in many applications.
rate research
Read More
Cooperative Intelligent Transportation Systems (C-ITS) will change the modes of road safety and traffic management, especially at intersections without traffic lights, namely unsignalized intersections. Existing researches focus on vehicle control within a small area around an unsignalized intersection. In this paper, we expand the control domain to a large area with multiple intersections. In particular, we propose a Multi-intersection Vehicular Cooperative Control (MiVeCC) to enable cooperation among vehicles in a large area with multiple unsignalized intersections. Firstly, a vehicular end-edge-cloud computing framework is proposed to facilitate end-edge-cloud vertical cooperation and horizontal cooperation among vehicles. Then, the vehicular cooperative control problems in the cloud and edge layers are formulated as Markov Decision Process (MDP) and solved by two-stage reinforcement learning. Furthermore, to deal with high-density traffic, vehicle selection methods are proposed to reduce the state space and accelerate algorithm convergence without performance degradation. A multi-intersection simulation platform is developed to evaluate the proposed scheme. Simulation results show that the proposed MiVeCC can improve travel efficiency at multiple intersections by up to 4.59 times without collision compared with existing methods.
We study the robustness of complex networks subject to edge removal. Several network models and removing strategies are simulated. Rather than the existence of the giant component, we use total connectedness as the criterion of breakdown. The network topologies are introduced a simple traffic dynamics and the total connectedness is interpreted not only in the sense of topology but also in the sense of function. We define the topological robustness and the functional robustness, investigate their combined effect and compare their relative importance to each other. The results of our study provide an alternative view of the overall robustness and highlight efficient ways to improve the robustness of the network models.
Controlling a complex network towards a desired state is of great importance in many applications. A network can be controlled by inputting suitable external signals into some selected nodes, which are called driver nodes. Previous works found there exist two control modes in dense networks: distributed and centralized modes. For networks with the distributed mode, most of the nodes can be act as driver nodes; and those with the centralized mode, most of the nodes never be the driver nodes. Here we present an efficient algorithm to change the control type of nodes, from input nodes to redundant nodes, which is done by reversing edges of the network. We conclude four possible cases when reversing an edge and show the control mode can be changed by reversing very few in-edges of driver nodes. We evaluate the performance of our algorithm on both synthetic and real networks. The experimental results show that the control mode of a network can be easily changed by reversing a few elaborately selected edges, and the number of possible driver nodes is dramatically decreased. Our methods provide the ability to design the desired control modes of the network for different control scenarios, which may be used in many application regions.
Stochastic processes can model many emerging phenomena on networks, like the spread of computer viruses, rumors, or infectious diseases. Understanding the dynamics of such stochastic spreading processes is therefore of fundamental interest. In this work we consider the wide-spread compartment model where each node is in one of several states (or compartments). Nodes change their state randomly after an exponentially distributed waiting time and according to a given set of rules. For networks of realistic size, even the generation of only a single stochastic trajectory of a spreading process is computationally very expensive. Here, we propose a novel simulation approach, which combines the advantages of event-based simulation and rejection sampling. Our method outperforms state-of-the-art methods in terms of absolute run-time and scales significantly better, while being statistically equivalent.
Stochastic models in which agents interact with their neighborhood according to a network topology are a powerful modeling framework to study the emergence of complex dynamic patterns in real-world systems. Stochastic simulations are often the preferred - sometimes the only feasible - way to investigate such systems. Previous research focused primarily on Markovian models where the random time until an interaction happens follows an exponential distribution. In this work, we study a general framework to model systems where each agent is in one of several states. Agents can change their state at random, influenced by their complete neighborhood, while the time to the next event can follow an arbitrary probability distribution. Classically, these simulations are hindered by high computational costs of updating the rates of interconnected agents and sampling the random residence times from arbitrary distributions. We propose a rejection-based, event-driven simulation algorithm to overcome these limitations. Our method over-approximates the instantaneous rates corresponding to inter-event times while rejection events counterbalance these over-approximations. We demonstrate the effectiveness of our approach on models of epidemic and information spreading.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
