Randomness and Complexity in Networks

Details Randomness and Complexity in Networks Randomness and Complexity in Networks

2007-11-05

arxiv.org/abs/0711.0603v1

Physics

Condensed Matter

Statistical Mechanics

Survey paper based on talk given at the workshop on ``Stochastic Networks and Internet Technology'', Centro di Ricerca Matemat

Scientific paper

I start by reviewing some basic properties of random graphs. I then consider the role of random walks in complex networks and show how they may be used to explain why so many long tailed distributions are found in real data sets. The key idea is that in many cases the process involves copying of properties of near neighbours in the network and this is a type of short random walk which in turn produce a natural preferential attachment mechanism. Applying this to networks of fixed size I show that copying and innovation are processes with special mathematical properties which include the ability to solve a simple model exactly for any parameter values and at any time. I finish by looking at variations of this basic model.

Affiliated with

Also associated with

No associations

Rating

Randomness and Complexity in Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Randomness and Complexity in Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomness and Complexity in Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-659849