title: Scaling and universality of the complexity of analog computation.
abstract: We apply a probabilistic approach to study the computational complexity of analog computers which solve linear programming problems. We numerically analyze various ensembles of linear programming problems and obtain, for each of these ensembles, the probability distribution functions of certain quantities which measure the computational complexity, known as the convergence rate, the barrier and the computation time. We find that in the limit of very large problems these probability distributions are universal scaling functions. In other words, the probability distribution function for each of these three quantities becomes, in the limit of large problem size, a function of a single scaling variable, which is a certain composition of the quantity in question and the size of the system. Moreover, various ensembles studied seem to lead essentially to the same scaling functions, which depend only on the variance of the ensemble. These results extend analytical and numerical results obtained recently for the Gaussian ensemble, and support the conjecture that these scaling functions are universal.
authors.affiliation: Physics Department, Technion, Israel Institute of Technology, Haifa 32000, Israel.
authors.forename: Yaniv
authors.initials: Y
authors.lastname: Avizrats
authors.forename: Joshua
authors.initials: J
authors.lastname: Feinberg
authors.forename: Shmuel
authors.initials: S
authors.lastname: Fishman