Xiao Yang, Réka Albert, Lauren Molloy Elreda, & Nilam Ram

Social influence processes can induce desired or undesired behavior change in individual members of a group. Empirical modeling of group processes and the design of network-based interventions meant to promote desired behavior change is somewhat limited be-cause the models often assume that the social influence is assimilative only and that the networks are not fully connected. We introduce a Boolean network method that addresses these two limitations. In line with dynamical systems principles, temporal changes in group members’ behavior are modeled as a Boolean network that also allows for application of control theory design of group management strategies that might direct the groups to-wards desired behavior. To illustrate the utility of the method for psychology, we apply the Boolean network method to empirical data of individuals’ self-disclosure behavior in multi-week therapy groups (N = 135, 18 groups, T = 10 ∼ 16 weeks). Empirical results provide descrip-tion of each group member’s pattern of self-disclosure and social influence and identification of group-specific network control strategies that would elicit self-disclosure from the majori-ty of the group. Of the 18 group models, 16 included both assimilative and repulsive social in-fluence. Useful control strategies were not needed for 10 already well-functioning groups, were identified for 6 groups, and were not available for 2 groups. The findings illustrate the utility of the Boolean network method for modeling the simultaneous existence of assimila-tive and repulsive social influence processes in small groups, and developing strategies that may direct groups toward desired states without manipulating social ties.

Read the full article at: advances.in

HONGZHONG DENG, JI LI, HONGQIAN WU, and BINGFENG GE

Advances in Complex SystemsVol. 26, No. 07n08, 2350011

System structure can affect or decide the system function. Many pioneers have analyzed the impact of system’s macro-statistical characteristics, such as degree distribution and giant component, on system performance. But only few research works were conducted on the relation of mesoscopic structure and agent property with system task performance. In this paper, we designed a scenario that, in a multiagent system, agents will try their best to form a qualified team to fulfill more system tasks under the requirements from agent property, structure and task. The theoretical and simulation results show that the agent link network, agent properties and task requirement will co-affect the dynamic team formation and at last have serious effects on a system’s task completion ratio and performance. Some factors such as network density and task introduction period have positive influence. Task execution time and team size have negative influence. Some factors show a counter-intuitive influence. The clustering coefficient has not much influence as people expected and the task publicity time isn’t bigger the better. Notably, system performance is affected by the coupling effect, instead of the independent effects of all factors. The effect of system structure on system function conditionally relies on the support from agent ability and task requirement.

Read the full article at: www.worldscientific.com

Josh C. Bongard

Communications of the ACM

The automated design, construction, and deployment of autonomous and adaptive machines is an open problem. Industrial robots are an example of autonomous yet nonadaptive machines: they execute the same sequence of actions repeatedly. Conversely, unmanned drones are an example of adaptive yet non-autonomous machines: they exhibit the adaptive capabilities of their remote human operators. To date, the only force known to be capable of producing fully autonomous as well as adaptive machines is biological evolution. In the field of evolutionary robotics,9 one class of population-based metaheuristics—evolutionary algorithms—are used to optimize some or all aspects of an autonomous robot. The use of metaheuristics sets this subfield of robotics apart from the mainstream of robotics research, in which machine learning algorithms are used to optimize the control policya of a robot. As in other branches of computer science the use of a metaheuristic algorithm has a cost and a benefit. The cost is that it is not possible to guarantee if (or when) an optimal control policy will be found for a given robot. The benefit is few assumptions must be made about the problem: evolutionary algorithms can improve both the parameters and the architecture of the robot’s control policy, and even the shape of the robot itself.

Read the full article at: cacm.acm.org

Cory Glover, Albert-László Barabási
The links of a physical network cannot cross, which often forces the network layout into non-optimal entangled states. Here we define a network fabric as a two-dimensional projection of a network and propose the average crossing number as a measure of network entanglement. We analytically derive the dependence of the crossing number on network density, average link length, degree heterogeneity, and community structure and show that the predictions accurately estimate the entanglement of both network models and of real physical networks.

Read the full article at: arxiv.org

Jordi Piñero, Ricard Solé, and Artemy Kolchinsky
Phys. Rev. Research 6, 013275

Harvesting free energy from the environment is essential for the operation of many biological and artificial systems. We use techniques from stochastic thermodynamics to investigate the maximum rate of harvesting achievable by optimizing a set of reactions in a Markovian system, possibly under various kinds of topological, kinetic, and thermodynamic constraints. This question is relevant for the optimal design of new harvesting devices as well as for quantifying the efficiency of existing systems. We first demonstrate that the maximum harvesting rate can be expressed as a constrained convex optimization problem. We illustrate it on bacteriorhodopsin, a light-driven proton pump from Archaea, which we find is close to optimal under realistic conditions. In our second result, we solve the optimization problem in closed-form in three physically meaningful limiting regimes. These closed-form solutions are illustrated on two idealized models of unicyclic harvesting systems.

Read the full article at: link.aps.org