Proceedings., 33rd Annual Symposium on Foundations of Computer Science (1992)

Pittsburgh, PA, USA

Oct. 24, 1992 to Oct. 27, 1992

ISBN: 0-8186-2900-2

pp: 304-313

Y. Rabinovich , Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel

ABSTRACT

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.

INDEX TERMS

tree, computational aspects, convergence rate, nonlinear dynamical systems, symmetric quadratic systems, genetic algorithms, combinatorial optimisation, probability distributions, graph, polynomial time

CITATION

A. Wigderson, A. Sinclair and Y. Rabinovich, "Quadratic dynamical systems,"

*Proceedings., 33rd Annual Symposium on Foundations of Computer Science(FOCS)*, Pittsburgh, PA, USA, 1992, pp. 304-313.

doi:10.1109/SFCS.1992.267761

CITATIONS