If you don't see
anything above, please install Java 1.4.
nodes merge and one of the nodes collect all links. Then a new node is
created with the number of links that were removed in the merging
process to avoid double links. The two nodes can be selected in two
different ways: As the the two nodes in the ends of a randomly selected
link, or as a randomly selected node and a randomly selected nearest
neighbor to this node. When pressing "Initialize" the network is
reshuffled to a fully connected random network.
The number of links in the system can be changed between 249 and 500.
The more links a node has, the closer to the center of the network the
node is plotted.
or aggregation is a dynamical process in many systems and it gives rise
to fractal size-distributions. For example, the size distribution of
dust particles in space was treated in an aggregation model in the 60s
(Field and Saslow 1965). Companies, the autonomous system of the
Internet and the sun
activity of magnetic field lines reconnections are networks that
undergo processes that resembles the merging process. The merging
process is therefore also interesting as a network model, especially as
the degree distribution in many real-world networks have a power-law
Self Organized Scale-Free Networks from
Merging and Regeneration. nlin.AO/0403006