In the present 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...

The influence of node–node degree correlations on distances in complex networks has been studied. We have found that even the presence of strong correlations in complex networks does not break a universal scaling of distances between vertices of such networks as science collaboration networks,...

Time changes of noise level at Warsaw Stock Market are analyzed using a recently developed method basing on properties of the coarse grained entropy. The condition of the minimal noise level is used to build an efficient portfolio. Our noise level approach seems to be a much better tool for risk...

Using a recently developed method of noise level estimation that makes use of properties of the coarse grained-entropy we have analyzed the noise level for the Dow Jones index and a few stocks from the New York Stock Exchange. We have found that the noise level ranges from 40 to 80 percent of...

Wikipedia, as a social phenomenon of collaborative knowledge creation, has been studied extensively from various points of view. The category system of Wikipedia, introduced in 2004, has attracted relatively little attention. In this study, we focus on the documentation of knowledge, and the...

We investigate the ordering of voter model on fractal lattices: Sierpinski Carpets and Sierpinski Gasket. We obtain a power-law ordering in all cases, but the dynamics is found to differ significantly for finite and infinite ramification order of investigated fractals.

We analyze emotionally annotated massive data from Internet relay chat (IRC) as well as from BBC forum website and model the dialogues between chat participants by assuming that the driving force for the discussion is the entropy growth of emotional probability distribution. This process is...

Higher order clustering coefficients C(x) are introduced for random networks. The coefficients express probabilities that the shortest distance between any two nearest neighbours of a certain vertex i equals x, when one neglects all paths crossing the node i. Using C(x) we found that in the...

We present an empirical study of user activity in online BBC discussion forums, measured by the number of posts written by individual debaters and the average sentiment of these posts. Nearly 2.5 million posts from over 18 thousand users were investigated. Scale-free distributions were observed...

We present a new type of deterministic dynamical behaviour that is less predictable than white noise. We call it anti-deterministic (AD) because time series corresponding to the dynamics of such systems do not generate deterministic lines in recurrence plots for small thresholds. We show that...