scholarly journals Is Network Structure Important for Protest Mobilization? Findings from Agent-Based Modeling

2021 ◽  
Author(s):  
Alexander P. Ch. Petrov ◽  
Andrei S. Akhremenko ◽  
Sergey A. Zheglov ◽  
Ekaterina V. Kruchinskaia
Keyword(s):  
Network Topology ◽  
Online Communication ◽  
Structural Factors ◽  
Social Environments ◽  
Russian Science ◽  
Agent Based ◽  
Joint Influence ◽  
Interpersonal Communications ◽  
Network Topologies ◽  
Network Properties

In recent decades, the focus of civic engagement research has shifted towards studying social environments’ effects on individuals’ decisions on whether to participate in a given activity or not. Online communication has been increasingly influencing the scale of social environments as well as the features of both online and offline interpersonal communications. Surely, then, individuals’ decisions concerning protest mobilization are bound to be affected by network properties. Using a series of ABM models with different network structures, we try to identify the structural factors of networks that can influence individuals who are deciding whether to join a protest. The established research in this field traditionally points to two structural factors: network topology and homophily. To our knowledge, however, the literature has not considered two above-mentioned structural factors in combination. In other words, their joint influence on protest mobilization has not been tested. To fill this research gap, we combine several network topologies with enabled/disabled homophily and examine how the combination influences protest turnout and survival. Numerical experiments show that homophily is positively associated with the survival of the protest, but negatively with its size for any network topology. Since we infer this conclusion from a theory-based computational model, we also propose how empirical testing can be conducted. Acknowledgments: This research is supported by the Russian Science Foundation under grant no. 20-18-00274, HSE University.

scholarly journals Emergent Robotic Personality Traits via Agent-Based Simulation of Abstract Social Environments

Information ◽  
2021 ◽  
Vol 12 (3) ◽  
pp. 103
Author(s):  
Casey C. Bennett
Keyword(s):  
Personality Traits ◽  
Human Robot Interaction ◽  
Social Environments ◽  
Agent Based Simulation ◽  
Theoretical Frameworks ◽  
Behavioral Learning ◽  
Agent Based ◽  
Current State ◽  
The Stability ◽  
Markovian Approach

This paper discusses the creation of an agent-based simulation model for interactive robotic faces, built based on data from physical human–robot interaction experiments, to explore hypotheses around how we might create emergent robotic personality traits, rather than pre-scripted ones based on programmatic rules. If an agent/robot can visually attend and behaviorally respond to social cues in its environment, and that environment varies, then idiosyncratic behavior that forms the basis of what we call a “personality” should theoretically be emergent. Here, we evaluate the stability of behavioral learning convergence in such social environments to test this idea. We conduct over 2000 separate simulations of an agent-based model in scaled-down, abstracted forms of the environment, each one representing an “experiment”, to see how different parameters interact to affect this process. Our findings suggest that there may be systematic dynamics in the learning patterns of an agent/robot in social environments, as well as significant interaction effects between the environmental setup and agent perceptual model. Furthermore, learning from deltas (Markovian approach) was more effective than only considering the current state space. We discuss the implications for HRI research, the design of interactive robotic faces, and the development of more robust theoretical frameworks of social interaction.

scholarly journals Optimal Coordination of Over-Current Relays in Microgrids Using Unsupervised Learning Techniques

2021 ◽  
Vol 11 (3) ◽  
pp. 1241
Author(s):  
Sergio D. Saldarriaga-Zuluaga ◽  
Jesús M. López-Lezama ◽  
Nicolás Muñoz-Galeano
Keyword(s):  
Unsupervised Learning ◽  
Distributed Generation ◽  
Network Topology ◽  
International Electrotechnical Commission ◽  
Number Of Clusters ◽  
Learning Techniques ◽  
Topology Changes ◽  
Network Topologies ◽  
Optimal Coordination ◽  
Operational Modes

Microgrids constitute complex systems that integrate distributed generation (DG) and feature different operational modes. The optimal coordination of directional over-current relays (DOCRs) in microgrids is a challenging task, especially if topology changes are taken into account. This paper proposes an adaptive protection approach that takes advantage of multiple setting groups that are available in commercial DOCRs to account for network topology changes in microgrids. Because the number of possible topologies is greater than the available setting groups, unsupervised learning techniques are explored to classify network topologies into a number of clusters that is equal to the number of setting groups. Subsequently, optimal settings are calculated for every topology cluster. Every setting is saved in the DOCRs as a different setting group that would be activated when a corresponding topology takes place. Several tests are performed on a benchmark IEC (International Electrotechnical Commission) microgrid, evidencing the applicability of the proposed approach.

scholarly journals A Novel Multi-Agent Model for Robustness with Component Failure and Malware Propagation in Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (14) ◽  
pp. 4873
Author(s):  
Biao Xu ◽  
Minyan Lu ◽  
Hong Zhang ◽  
Cong Pan
Keyword(s):  
Wireless Sensor ◽  
Component Reliability ◽  
Agent Based ◽  
Agent Model ◽  
Cross Domain ◽  
Malware Propagation ◽  
Network Topologies ◽  
Multi Agent ◽  
Agent Characteristics ◽  
Information Domain

A wireless sensor network (WSN) is a group of sensors connected with a wireless communications infrastructure designed to monitor and send collected data to the primary server. The WSN is the cornerstone of the Internet of Things (IoT) and Industry 4.0. Robustness is an essential characteristic of WSN that enables reliable functionalities to end customers. However, existing approaches primarily focus on component reliability and malware propagation, while the robustness and security of cascading failures between the physical domain and the information domain are usually ignored. This paper proposes a cross-domain agent-based model to analyze the connectivity robustness of a system in the malware propagation process. The agent characteristics and transition rules are also described in detail. To verify the practicality of the model, three scenarios based on different network topologies are proposed. Finally, the robustness of the scenarios and the topologies are discussed.

scholarly journals Network topology optimization by turning non-scale-free networks into scale-free networks using nonlinear preferential rewiring method

2018 ◽  
Vol 14 (11) ◽  
pp. 155014771878447 ◽  
Author(s):  
Feng Su ◽  
Peijiang Yuan ◽  
Yuanwei Liu ◽  
Shuangqian Cao
Keyword(s):  
Topology Optimization ◽  
Network Topology ◽  
Random Networks ◽  
Practical Application ◽  
Performance Simulation ◽  
Scale Free ◽  
Scale Free Networks ◽  
Network Topologies ◽  
Network Topology Optimization ◽  
Rigorous Mathematical Model

In practical application, the generation and evolution of many real networks always do not follow rigorous mathematical model, making network topology optimization a great challenge in the field of complex networks. In this research, we optimize the topology of non-scale-free networks by turning it into scale-free networks using a nonlinear preferential rewiring method. For different kinds of original networks generated by Watts and Strogatz model, we systematically demonstrate the optimization process and the modified networks to verify the performance of nonlinear preferential rewiring. We conduct further researches to explore the effect of nonlinear preferential rewiring’s parameters on performance. Simulation results show that various non-scale-free networks with different network topologies generated by WS model, including random networks and various networks between regular and random, are turned into scale-free networks perfectly by nonlinear preferential rewiring method.

A MODEL FOR BRAND COMPETITION WITHIN A SOCIAL NETWORK

2010 ◽  
Vol 21 (12) ◽  
pp. 1457-1467
Author(s):  
R. HUERTA-QUINTANILLA ◽  
E. CANTO-LUGO ◽  
M. RODRÍGUEZ-ACHACH
Keyword(s):  
Social Network ◽  
Network Topology ◽  
Decision Rules ◽  
Nearest Neighbors ◽  
Product Market ◽  
Economic Benefits ◽  
Model Parameters ◽  
Agent Based ◽  
Absorbing State ◽  
Brand Competition

An agent-based model was built representing an economic environment in which m brands are competing for a product market. These agents represent companies that interact within a social network in which a certain agent persuades others to update or shift their brands; the brands of the products they are using. Decision rules were established that caused each agent to react according to the economic benefits it would receive; they updated/shifted only if it was beneficial. Each agent can have only one of the m possible brands, and she can interact with its two nearest neighbors and another set of agents which are chosen according to a particular set of rules in the network topology. An absorbing state was always reached in which a single brand monopolized the network (known as condensation). The condensation time varied as a function of model parameters is studied including an analysis of brand competition using different networks.

Research on MPLS Network Topology Aggregation Algorithm With The Effective Connected Dominating Sets

2012 ◽  
Vol 155-156 ◽  
pp. 1025-1029 ◽  
Author(s):  
Jing Feng ◽  
Sheng Qian Ma ◽  
Man Hong Fan ◽  
Ke Ning Wang
Keyword(s):  
Network Topology ◽  
Dominating Set ◽  
Dominating Sets ◽  
Breadth First Search ◽  
Label Switching ◽  
Switching Path ◽  
Topology Aggregation ◽  
Multi Protocol Label Switching ◽  
Network Topologies ◽  
The Cost

Using dominating set can aggregate the complex physical network topologies into simple virtual topologies and reduce the cost of the networks. In the Multi-Protocol Label Switching (MPLS) network, the dominating set constructed based on label router can effectively aggregate MPLS network topology and reduce the amount of Label Switching Path (LSP), so as to save the expenses of network maintain information. However, simply considering the size of dominating set can't guarantee the best performance of the networks after aggregating. Therefore, an improved algorithm based on breadth-first search spanning tree is proposed, considering the size of the dominating set, bandwidth performance of the nodes and path length between nodes, which can effectively extend the MPLS network, with excellent bandwidth performance and reduce the data transmission delay.

scholarly journals Implementation Basic Network Design with Netkit For Evaluation of Network Learning

2019 ◽  
Vol 15 (08) ◽  
pp. 18
Author(s):  
Yuri Ariyanto ◽  
Budi Harijanto ◽  
Yan Watequlis S.
Keyword(s):  
Network Design ◽  
Network Topology ◽  
Computer Network ◽  
Virtual Laboratory ◽  
Virtual Laboratories ◽  
Network Topologies ◽  
Low Costs ◽  
Network Emulator ◽  
Practical Trial ◽  
Basic Network

A virtual laboratory with a network emulator environment using NetKit is one of series of basic network laboratories on basic computer network competencies where students are given practical trial opportunities at low costs and little effort in their implementation. Teaching computer network subjects to be easily understood by students needs an instructional media as a tool in delivering material. This media uses computer virtualization technology, i.e. creating a virtual laboratory, as a means of students in conducting experiments from the material that has been obtained. In virtual laboratories it is possible to implement network topology designs based on actual network topologies. This implementation is used as a testing tool before the network topology is implemented on the actual network. Therefore, errors can be identified first without disturbing the system that is already running. For testing, the students are given training using a basic network design consisting of the implementation of routing tests, firewalls, ftp server implementation and web server. This paper is aimed at describing ways to develop a virtual laboratory with a network emulator environment using NetKit. Moreover, several exercises on network topology implementation that are applied directly to the real world with NetKit are introduced, such as describing laboratory settings, describing the main parts of the lab, illustrating lab instructions, and reporting lab feeds.

scholarly journals Modelling community formation driven by the status of individual in a society

2017 ◽  
Vol 5 (6) ◽  
pp. 817-838 ◽  
Author(s):  
Jan E Snellman ◽  
Gerardo Iñiguez ◽  
Tzipe Govezensky ◽  
R A Barrio ◽  
Kimmo K Kaski
Keyword(s):  
Social Status ◽  
Network Size ◽  
Community Formation ◽  
Human Society ◽  
Agent Based ◽  
The Social ◽  
The Status ◽  
Network Properties ◽  
Willingness To Compete ◽  
New Strategies

Abstract In human societies, people’s willingness to compete and strive for better social status, as well as being envious of those perceived in some way superior, lead to social structures that are intrinsically hierarchical. Here, we propose an agent-based, network model to mimic the ranking behaviour of individuals and its possible repercussions in human society. The main ingredient of the model is the assumption that the relevant feature of social interactions is each individual’s keenness to maximize his or her status relative to others. The social networks produced by the model are homophilous and assortative, as frequently observed in human communities, and most of the network properties seem quite independent of its size. However, we see that for a small number of agents the resulting network consists of disjoint weakly connected communities, while being highly assortative and homophilic. On the other hand, larger networks turn out to be more cohesive with larger communities but less homophilic. We find that the reason for these changes is that larger network size allows agents to use new strategies for maximizing their social status, allowing for more diverse links between them.

Multitriangle: A Constant Node Degree Interconnection Network

1997 ◽  
Vol 08 (02) ◽  
pp. 187-209 ◽  
Author(s):  
Jie Wu ◽  
Haifeng Qian
Keyword(s):  
Network Topology ◽  
Interconnection Network ◽  
Average Distance ◽  
Node Degree ◽  
Formal Definition ◽  
Corner Cutting ◽  
Network Topologies ◽  
Salient Features ◽  
Definition Of ◽  
Node Routing

We propose a constant node degree network topology, multitriangle, which is hierarchical, recursive, and expansive. First we introduce a corner cutting approach that generates a set of new network topologies (including multitriangles), followed by a formal definition of the multitriangle network and discussion of its properties. The salient features of this network are that it is a constant node degree network and it can be viewed as a hierarchical ring, a popular topology which has been adopted in several commercial systems. Algorithms for node-to-node routing, hierarchical ring routing, optimal ring routing, and broadcasting are presented. The multitriangle network is analyzed in terms of diameter, degree, average distance, and message density, and results are compared with other relevant networks.

Sign in / Sign up

Export Citation Format

Share Document