Quadratic dynamical systems

Yuri Rabinovich, Alistair Sinclair, Avi Wigderson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationProceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
PublisherIEEE Computer Society
Number of pages10
ISBN (Electronic)0818629002
StatePublished - 1992
Externally publishedYes
Event33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 - Pittsburgh, United States
Duration: 24 Oct 199227 Oct 1992

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)0272-5428


Conference33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
Country/TerritoryUnited States

Bibliographical note

Publisher Copyright:
© 1992 IEEE.

ASJC Scopus subject areas

  • General Computer Science


Dive into the research topics of 'Quadratic dynamical systems'. Together they form a unique fingerprint.

Cite this