A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
On the Expected Runtime and the Success Probability of Evolutionary Algorithms
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
A new line of attack on the dichotomy conjecture
Proceedings of the forty-first annual ACM symposium on Theory of computing
Journal of Symbolic Computation
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
SIAM Journal on Computing
| Hi-index | 0.00 |
The paper promotes the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. The authors identify the class of symmetric quadratic systems. Such systems have been widely used to model phenomena in the natural sciences, and also provide an appropriate framework for the study of genetic algorithms in combinatorial optimisation. They prove several fundamental general properties of these systems, notably that every trajectory converges to a fixed point. They go on to give a detailed analysis of a quadratic system defined in a natural way on probability distributions over the set of matchings in a graph. In particular, they prove that convergence to the limit requires only polynomial time when the graph is a tree. This result demonstrates that such systems, though nonlinear, are amenable to quantitative analysis.