Is Selection Optimal for Scale-Free Small Worlds?
نویسندگان
چکیده
منابع مشابه
Intentional Walks on Scale Free Small Worlds
We present a novel algorithm that generates scale free small world graphs such as those found in the World Wide Web,social and metabolic networks. We use the generated graphs to study the dynamics of a realistic search strategy on the graphs, and find that they can be navigated in a very short number of steps. Small world and scale free graphs, which are at the heart of systems as diverse as th...
متن کاملSelection in Scale-Free Small World
In this paper we compare our selection based learning algorithm with the reinforcement learning algorithm in Web crawlers. The task of the crawlers is to find new information on the Web. We performed simulations based on data collected from the Web. The collected portion of the Web is typical and exhibits scale-free small world (SFSW) structure. We have found that on this SFSW, the weblog updat...
متن کاملOptimal disorder for segregation in annealed small worlds
We study a model for microscopic segregation in a homogeneous system of particles moving on a one-dimensional lattice. Particles tend to separate from each other, and evolution ceases when at least one empty site is found between any two particles. Motion is a mixture of diffusion to nearest-neighbour sites and long-range jumps, known as annealed small-world propagation. The long-range jump pro...
متن کاملOptimal Scale Selection for Circular Edge Extraction
This paper addresses the issue of optimal scale selection for circular edge extraction in the context of higher dimensional multiscale edge extraction. Based on a classification of higher dimensional edges according to local curvature, we exemplarily establish a 2-D circular edge model. Through a careful mathematical derivation, we transform the circular edge model from Cartesian coordinates fo...
متن کاملSmall worlds
Small world models are networks consisting of many local links and fewer long range ‘shortcuts’. In this paper, we consider some particular instances, and rigorously investigate the distribution of their inter–point network distances. Our results are framed in terms of approximations, whose accuracy increases with the size of the network. We also give some insight into how the reduction in typi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexus
سال: 2006
ISSN: 1424-8492,1424-8506
DOI: 10.1159/000094197