A simple asymmetric evolving random network

Details A simple asymmetric evolving random network A simple asymmetric evolving random network

2002-03-11

arxiv.org/abs/cond-mat/0203232v2

Physics

Condensed Matter

Disordered Systems and Neural Networks

33 pages, 3 figures, to appear in J. Stat. Phys

Scientific paper

We introduce a new oriented evolving graph model inspired by biological networks. A node is added at each time step and is connected to the rest of the graph by random oriented edges emerging from older nodes. This leads to a statistical asymmetry between incoming and outgoing edges. We show that the model exhibits a percolation transition and discuss its universality. Below the threshold, the distribution of component sizes decreases algebraically with a continuously varying exponent depending on the average connectivity. We prove that the transition is of infinite order by deriving the exact asymptotic formula for the size of the giant component close to the threshold. We also present a thorough analysis of aging properties. We compute local-in-time profiles for the components of finite size and for the giant component, showing in particular that the giant component is always dense among the oldest nodes but invades only an exponentially small fraction of the young nodes close to the threshold.

Affiliated with

Also associated with

No associations

Rating

A simple asymmetric evolving random network 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 A simple asymmetric evolving random network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A simple asymmetric evolving random network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-619391