Recently, it was found by Schneider et al.[Proc. Natl. Acad. Sci. USA 108, 3838 (2011)
PNASA6 0027-8424 10.1073/pnas. 1009440108], using simulations, that scale-free …

The Ising model in clustered scale-free networks has been studied by Monte Carlo
simulations. These networks are characterized by a degree distribution of the form P (k)∼ k …

In this paper, we numerically investigate the robustness of cooperation clusters in prisoner's
dilemma played on scale-free networks, where the network topologies change by …

Various types of walks on complex networks have been used in recent years to model
search and navigation in several kinds of systems, with particular emphasis on random …

We analyze a three-state Potts model built over a lattice ring, with coupling J 0, and the fully
connected graph, with coupling J. This model is effectively mean-field and can be exactly …

We examine two properties of complex networks, the robustness against targeted node
removal (attack) and the transport efficiency in terms of degree correlation in node …

We study the equilibrium and nonequilibrium properties of Boolean decision problems with
competing interactions on scale-free networks in an external bias (magnetic field). Previous …

We study the critical behavior of Boolean variables on scale-free networks with competing
interactions (Ising spin glasses). Our analytical results for the disorder–network-decay …

Given an arbitrary finite dimensional Hamiltonian H 0, we consider the model H= H 0+ ΔH,
where ΔH is a generic fully connected interaction. By using the strong law of large numbers …

Searching and retrieving the demanded correct information is one important problem in
networks; especially, designing an efficient search algorithm is a key challenge in …