On Isoperimetric Profiles and Computational Complexity

The isoperimetric profile of a graph is a function that measures, for an integer k, the size of the smallest edge boundary over all sets of vertices of size k. We observe a connection between isoperimetric profiles and computational complexity. We illustrate this connection by an example from communication complexity, but our main result is in algebraic complexity. We prove a sharp super-polynomial separation between monotone arithmetic circuits and monotone arithmetic branching programs. This shows that the classical simulation of arithmetic circuits by arithmetic branching programs by Valiant, Skyum, Berkowitz, and Rackoff (1983) cannot be improved, as long as it preserves monotonicity. A key ingredient in the proof is an accurate analysis of the isoperimetric profile of finite full binary trees. We show that the isoperimetric profile of a full binary tree constantly fluctuates between one and almost the depth of the tree

On the spectral theory of operators on trees

We study a class of rooted trees with a substitution type structure. These trees are not necessarily regular, but exhibit a lot of symmetries. We consider nearest neighbor operators which reflect the symmetries of the trees. The spectrum of such operators is proven to be purely absolutely continuous and to consist of finitely many intervals. We further investigate stability of the absolutely continuous spectrum under perturbations by sufficiently small potentials. On the one hand, we look at a class of deterministic potentials which include radial symmetric ones. The absolutely continuous spectrum is stable under sufficiently small perturbations of this type if and only if the tree is not regular. On the other hand, we study random potentials. In this case, we prove stability of absolutely continuous spectrum for both regular and non regular trees provided the potentials are sufficiently small

ISIPTA'07: Proceedings of the Fifth International Symposium on Imprecise Probability: Theories and Applications

B

Advances in Optimization and Nonlinear Analysis

The present book focuses on that part of calculus of variations, optimization, nonlinear analysis and related applications which combines tools and methods from partial differential equations with geometrical techniques. More precisely, this work is devoted to nonlinear problems coming from different areas, with particular reference to those introducing new techniques capable of solving a wide range of problems. The book is a valuable guide for researchers, engineers and students in the field of mathematics, operations research, optimal control science, artificial intelligence, management science and economics

LIPIcs, Volume 261, ICALP 2023, Complete Volume

LIPIcs, Volume 261, ICALP 2023, Complete Volum