Discrete Quantitative Nodal Theorem
نویسندگان
چکیده
We prove a theorem that can be thought of as common generalization the Discrete Nodal Theorem and (one direction of) Cheeger's Inequality for graphs. A special case this result will assert if second third eigenvalues Laplacian are at least $\varepsilon$ apart, then subgraphs induced by positive negative supports eigenvector belonging to $\lambda_2$ not only connected, but edge-expanders (in weighted sense, with expansion depending on $\varepsilon$).
منابع مشابه
Discrete Nodal Domain Theorems
We prove two discrete analogues of Courant’s Nodal Domain Theorem.
متن کاملPleijel’s Nodal Domain Theorem for Free Membranes
We prove an analogue of Pleijel’s nodal domain theorem for piecewise analytic planar domains with Neumann boundary conditions. This confirms a conjecture made by Pleijel in 1956. The proof is a combination of Pleijel’s original approach and an estimate due to Toth and Zelditch for the number of boundary zeros of Neumann eigenfunctions.
متن کاملThe uniqueness theorem for inverse nodal problems with a chemical potential
In this paper, an inverse nodal problem for a second-order differential equation having a chemical potential on a finite interval is investigated. First, we estimate the nodal points and nodal lengths of differential operator. Then, we show that the potential can be uniquely determined by a dense set of nodes of the eigenfunctions.
متن کاملA Quantitative Arrow Theorem
Arrow’s Impossibility Theorem states that any constitution which satisfies Independence of Irrelevant Alternatives (IIA) and Unanimity and is not a Dictator has to be non-transitive. In this paper we study quantitative versions of Arrow theorem. Consider n voters who vote independently at random, each following the uniform distribution over the 6 rankings of 3 alternatives. Arrow’s theorem impl...
متن کاملDiscrete Cones and Carathéodory’s Theorem
Discrete cones, in systematic terminology: normal affine semigroups, represent the link between branches of mathematics that, at first sight, seem to be extremely distant from one another, i.e. combinatorial geometry and discrete optimisation on the one hand, and algebraic geometry and commutative algebra on the other. These branches and the links between them have been researched intensively i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2021
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/9944