Heider Balance in Human Networks

Recently, a continuous dynamics was proposed to simulate dynamics of interpersonal relations in a society represented by a fully connected graph. Final state of such a society was found to be identical with the so-called Heider balance (HB), where the society is divided into two mutually hostile groups. In the continuous model, a polarization of opinions was found in HB. Here we demonstrate that the polarization occurs also in Barabasi-Albert networks, where the Heider balance is not necessarily present. In the second part of this work we demonstrate the results of our formalism, when applied to reference examples: the Southern women and the Zachary club.Comment: 9 pages, 5 figures. Presented on 8th Granada Seminar on Computational and Statistical Physics, Modeling Cooperative Behavior in the Social Sciences, Granada, Spain, 7-11 February 200

If others jump to the queue front, how long I will wait?

Two models of a queue are proposed: a human queue and two lines of vehicles before a narrowing. In both models, a queuer tries to evaluate his waiting time, taking into account the delay caused by intruders who jump to the queue front. As the collected statistics of such events is very limited, the evaluation can give very long times. The results provide an example, when direct observations should be supplemented by an inference from the context.Comment: 4 pages, 3 figure

Dynamics of Multi-Player Games

We analyze the dynamics of competitions with a large number of players. In our model, n players compete against each other and the winner is decided based on the standings: in each competition, the mth ranked player wins. We solve for the long time limit of the distribution of the number of wins for all n and m and find three different scenarios. When the best player wins, the standings are most competitive as there is one-tier with a clear differentiation between strong and weak players. When an intermediate player wins, the standings are two-tier with equally-strong players in the top tier and clearly-separated players in the lower tier. When the worst player wins, the standings are least competitive as there is one tier in which all of the players are equal. This behavior is understood via scaling analysis of the nonlinear evolution equations.Comment: 8 pages, 8 figure

A novel method for localising a randomly distributed wireless sensor network

Wireless sensor networks are dependent on sending and receiving signals; the system will not be capable of functioning if communication between sensors is not established. Localisation is one of the most important functions in this technology to localise nodes, events or the data source. In this study, we present a new method for outdoor randomly distributed nodes with no need for any excess devices, such as GPS devices or directional anten- nas or ultrasonic sensors. The method is based on using only the simple node component to provide the node and event position and has the ability to adapt mobility and scalability without affecting network functionality. All of the results are based on an ideal environment