3. Partitioning nodes Spreading activation – Signals are sent through the network (the graph) – How spreads the signal through this graph – Hogg and Huberman mathematical model (87) : Nodes are assigned a sequence of values computed iteratively following a simple recurrence:
(1)
Hogg and Huberman give conditions under which this iterative process converge
They evaluate the speed of convergence according to
and
– Nodes with the highest spreading activation values should provide a skeleton for the graph 10