We use Monte Carlo simulations and arguments from percolation theory in order to determine how “confidential” information propagates or localizes on a scale-free network. The basic assumption of our models is that this type of information propagates through the subnetwork of “best...

We examine the evolution of the vocabulary of a group of individuals (linguistic agents) on a scale-free network, using Monte Carlo simulations and assumptions from evolutionary game theory. It is known that when the agents are arranged in a two-dimensional lattice structure and interact by...

We use Monte Carlo simulations and assumptions from evolutionary game theory in order to study the evolution of words and the population dynamics of a system made of two interacting species which initially speak two different languages. The species are characterized by their identity,...

We use the detrended fluctuation analysis (DFA) and the Grassberger–Proccacia analysis (GP) methods in order to study language characteristics. Despite that we construct our signals using only word lengths or word frequencies, excluding in this way huge amount of information from language, the...

We use the formulation of equilibrium statistical mechanics in order to study some important characteristics of language. Using a simple expression for the Hamiltonian of a language system, which is directly implied by the Zipf law, we are able to explain several characteristic features of human...

Healthy sleep can be characterized by several stages: deep sleep, light sleep, and REM sleep. Here we show that these sleep stages lead to different autonomic regulation of breathing. Using the detrended fluctuation analysis up to the fourth order we find that breath-to-breath intervals and...

We examine the detrended fluctuation analysis (DFA), which is a well-established method for the detection of long-range correlations in time series. We show that deviations from scaling which appear at small time scales become stronger in higher orders of DFA, and suggest a modified DFA method...

We generate optimal paths between two given sites on a lattice representing a disordered energy landscape by applying the Dijkstra algorithm. We study the geometrical and energetic scaling properties of the optimal path under two different energy distributions that yield the weak and strong...

We study phase synchronization between atmospheric variables such as daily mean temperature and daily precipitation records. We find significant phase synchronization between records of Oxford and Vienna as well as between the records of precipitation and temperature in each city. To find the...

We study the tolerance of a scale-free network (having a connectivity distribution P(k)∼k−γ) under systematic variation of the attack strategy. In an attack, the probability that a given node is destroyed, depends on the number of its links k via W(k)∼kα, where α varies from −∞...