Full command of a network by a new node: some results and examples

Q1 Mathematics

Computational Social Networks Pub Date : 2019-12-26 DOI:10.1186/s40649-019-0074-1

Clara Grácio, Sara Fernandes, Luís Mário Lopes

引用次数: 0

Abstract

We consider that a network of chaotic identical dynamical systems is connected to a new node. Depending on some properties of the network and on the way that connection is made, the new node may control the network. We consider a full-command connection and analyze the possibility of the network being full-commandable by the new node. For full-commandable networks, we define the full-command-window, a set that includes some of the values that the coupling strength of the new node may assume. We present several results and examples that enlight us how a network can become more vulnerable or resistant to full-command.

查看原文本刊更多论文

新节点对网络的完全命令:一些结果和示例

我们考虑一个混沌相同动力系统网络连接到一个新节点。根据网络的某些属性和建立连接的方式，新节点可以控制网络。我们考虑一个全命令连接，并分析网络被新节点完全可命令的可能性。对于完全可命令的网络，我们定义了完全命令窗口，这是一个包含新节点耦合强度可能假设的一些值的集合。我们提出了几个结果和例子，告诉我们网络如何变得更脆弱或抵抗完全命令。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Computational Social Networks Mathematics-Modeling and Simulation

自引率

0.00%

发文量

审稿时长

13 weeks

期刊介绍： Computational Social Networks showcases refereed papers dealing with all mathematical, computational and applied aspects of social computing. The objective of this journal is to advance and promote the theoretical foundation, mathematical aspects, and applications of social computing. Submissions are welcome which focus on common principles, algorithms and tools that govern network structures/topologies, network functionalities, security and privacy, network behaviors, information diffusions and influence, social recommendation systems which are applicable to all types of social networks and social media. Topics include (but are not limited to) the following: -Social network design and architecture -Mathematical modeling and analysis -Real-world complex networks -Information retrieval in social contexts, political analysts -Network structure analysis -Network dynamics optimization -Complex network robustness and vulnerability -Information diffusion models and analysis -Security and privacy -Searching in complex networks -Efficient algorithms -Network behaviors -Trust and reputation -Social Influence -Social Recommendation -Social media analysis -Big data analysis on online social networks This journal publishes rigorously refereed papers dealing with all mathematical, computational and applied aspects of social computing. The journal also includes reviews of appropriate books as special issues on hot topics.