Information flow and Laplacian dynamics on local optima networks
Hendrik Richter, Sarah L. Thomson
TL;DR
The paper reframes Local Optima Networks (LONs) as dynamic objects by applying Laplacian dynamics to study information flow on fitness landscapes, using monotonic LONs constructed from QAP instances. It introduces a suite of LD-based metrics (influence and defluence variants) derived from the left/right Laplacian kernels and compares them to established LON measures, demonstrating strong correlations with and predictive power for metaheuristic performance (ILS and TS) on the Quadratic Assignment Problem. The results show that several LD metrics, notably $\\mathcal{I}_4$, $\\mathcal{I}_5$, $\\mathcal{D}_3$, and $\\mathcal{D}_5$, reliably predict performance and can outperform fractal- and pagerank-based metrics, while maintaining scalable computation via linear-algebra operations. Overall, the LD approach provides a principled, scalable framework for quantifying information flow on LONs and improving the understanding and prediction of search difficulty in combinatorial landscapes.
Abstract
We propose a new way of looking at local optima networks (LONs). LONs represent fitness landscapes; the nodes are local optima, and the edges are search transitions between them. Many metrics computed on LONs have been proposed and shown to be linked to metaheuristic search difficulty. These have typically considered LONs as describing static structures. In contrast to this, Laplacian dynamics (LD) is an approach to consider the information flow across a network as a dynamical process. We adapt and apply LD to the context of LONs. As a testbed, we consider instances from the quadratic assignment problem (QAP) library. Metrics related to LD are proposed and these are compared with existing LON metrics. The results show that certain LD metrics are strong predictors of metaheuristic performance for iterated local search and tabu search.
