SearcharxivSearch

arXiv subjects

Anna M. Chmiel

Publications and source records attributed to Anna M. Chmiel.

3 recordsLinked to original sources

Emotional agents at the square lattice

We introduce and investigate by numerical simulations a number of models of emotional agents at the square lattice. Our models describe the most general features of emotions such as the spontaneous emotional arousal, emotional relaxation, and transfers of emotions between different agents. Group emotions in the considered models are periodically fluctuating between two opposite valency levels and as result the mean value of such group emotions is zero. The oscillations amplitude depends strongly on probability ps of the individual spontaneous arousal. For small values of relaxation times tau we observed a stochastic resonance, i.e. the signal to noise ratio SNR is maximal for a non-zero ps parameter. The amplitude increases with the probability p of local affective interactions while the mean oscillations period increases with the relaxation time tau and is only weakly dependent on other system parameters. Presence of emotional antenna can enhance positive or negative emotions and for the optimal transition probability the antenna can change agents emotions at longer distances. The stochastic resonance was also observed for the influence of emotions on task execution efficiency.

physics.soc-ph

Scaling of human behavior during portal browsing

We investigate transitions of portals users between different subpages. A weighted network of portals subpages is reconstructed where edge weights are numbers of corresponding transitions. Distributions of link weights and node strengths follow power laws over several decades. Node strength increases faster than linearly with node degree. The distribution of time spent by the user at one subpage decays as power law with exponent around 1.3. Distribution of numbers P(z) of unique subpages during one visit is exponential. We find a square root dependence between the average z and the total number of transitions n during a single visit. Individual path of portal user resembles of self-attracting walk on the weighted network. Analytical model is developed to recover in part the collected data.

physics.soc-ph

Networks of companies and branches in Poland

In this study we consider relations between companies in Poland taking into account common branches they belong to. It is clear that companies belonging to the same branch compete for similar customers, so the market induces correlations between them. On the other hand two branches can be related by companies acting in both of them. To remove weak, accidental links we shall use a concept of threshold filtering for weighted networks where a link weight corresponds to a number of existing connections (common companies or branches) between a pair of nodes.

physics.soc-ph