Self-Organization applied to Dynamic Network Layout

Details Self-Organization applied to Dynamic Network Layout Self-Organization applied to Dynamic Network Layout

2007-04-13

arxiv.org/abs/0704.1748v5

International Journal of Modern Physics C vol. 18, no. 10 (2007), pp. 1537-1549

Physics

Computational Physics

Text revision and figures improved in v.2. See http://www.sg.ethz.ch for more info and examples

Scientific paper

10.1142/S0129183107011558

As networks and their structure have become a major field of research, a strong demand for network visualization has emerged. We address this challenge by formalizing the well established spring layout in terms of dynamic equations. We thus open up the design space for new algorithms. Drawing from the knowledge of systems design, we derive a layout algorithm that remedies several drawbacks of the original spring layout. This new algorithm relies on the balancing of two antagonistic forces. We thus call it {\em arf} for "attractive and repulsive forces". It is, as we claim, particularly suited for a dynamic layout of smaller networks ($n < 10^3$). We back this claim with several application examples from on going complex systems research.

Affiliated with

Also associated with

No associations

Rating

Self-Organization applied to Dynamic Network Layout 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 Self-Organization applied to Dynamic Network Layout, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-Organization applied to Dynamic Network Layout will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-678393