Kinetically-grown self-avoiding walks have been studied on Watts-Strogatz small-world networks, rewired from a two-dimensional square lattice. The maximum length L of this kind of walks is limited in regular lattices by an attrition effect, which gives finite values for its mean value 〈L 〉....

We consider distributed networks, such as peer-to-peer networks, whose structure can be manipulated by adjusting the rules by which vertices enter and leave the network. We focus in particular on degree distributions and show that, with some mild constraints, it is possible by a suitable choice...

We present results of a numerical study of phase separation dynamics of a two-dimensional quenched system which has a small-world topology, both with and without the conserved order parameter. We examine how the domain coarsening changes with the density of long-range connections (shortcuts). It...

Co-authorship networks of neighbouring scientific disciplines, i.e. granular (G) media and networks (N) are studied in order to observe drastic structural changes in evolving networks. The data is taken from arXives. The system is described as coupled networks. By considering the...

The statistical distances between countries, calculated for various moving average time windows, are mapped into the ultrametric subdominant space as in classical Minimal Spanning Tree methods. The Moving Average Minimal Length Path (MAMLP) algorithm allows a decoupling of fluctuations with...

In complex scale-free networks, ranking the individual nodes based upon their importance has useful applications, such as the identification of hubs for epidemic control, or bottlenecks for controlling traffic congestion. However, in most real situations, only limited sub-structures of entire...

According to Fortunato and Barthélemy, modularity-based community detection algorithms have a resolution threshold such that small communities in a large network are invisible. Here we generalize their work and show that the q-state Potts community detection method introduced by Reichardt and...

A simple model of opinion formation dynamics in which binary-state agents make up their opinions due to the influence of agents in a local neighborhood is studied using different network topologies. Each agent uses two different strategies, the Sznajd rule with a probability q and the Galam...

Using the Sznajd-Weron model as a starting point, we analyzed the effect on the statistical properties of this model under changes in the connectivity of the network and under the introduction of memory to the units, as well as by introducing a communication error that influences the way a unit...

The congestion transition triggered by multiple walkers walking along the shortest path on complex networks is numerically investigated. These networks are composed of nodes that have a finite capacity in analogy to the buffer memory of a computer. It is found that a transition from free-flow...