Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 10 of 10 for “"Isoperimetry"”.
-
Curvature and isoperimetry in graphs
This dissertation concerns isoperimetric and functional inequalities in discrete spaces. The majority of the work concerns discrete notions of curvature. There is also discussion of volume growth in graphs and of expansion in hypergraphs.
-
Analytic Property Testing: Directed Isoperimetry and Monotonicity
… We show that the connection between directed isoperimetry and monotonicity also holds in the analytic setting, and indeed reveals new relationships between property testing and areas of mathematics such as partial differential equations and optimal transport theory. The main results in this …
-
Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds
… paper, Froyland introduced the notion of dynamic isoperimetry: the study of sets with persistently small boundary size (the interface) relative to enclosed volume, when evolved by the dynamics. Sets with this minimal boundary size to volume ratio were identified as level sets of dominant …
-
ENHANCING TRUSTWORTHINESS AND SAFETY IN FOUNDATION MODELS
… and develop a law of robustness beyond Isoperimetry to establish a new theoretical framework for understanding robustness guarantees. The second part addresses trustworthiness in language-based generation. We design resilient watermarking techniques that preserve the statistical …
-
Graphical and Isoperimetric Perspectives on Sampling and Regularization
… the perspective of concentration of measure, isoperimetry and spectral graph theory. These mathematical topics are intricately connected, and we often leverage related tools, such as Laplacians and concentration inequalities, in the theory and methods developed in this thesis. </p><p>From the …
-
The complexity of expansion problems
Graph-partitioning problems are a central topic of research in the study of algorithms and complexity theory. They are of interest to theoreticians with connections to error correcting codes, sampling algorithms, metric embeddings, among others, and to practitioners, as algorithms for graph …
-
Monotonicity Testing for Boolean Functions over Graph Products
We establish a directed analogue of Chung and Tetali's isoperimetric inequality for graph products. We use this inequality to obtain new bounds on the query complexity for testing monotonicity of Boolean-valued functions over products of general posets.
-
Efficient high-dimensional sampling and integration
Volume computation is an algorithmic version of the fundamental geometric problem to figure out how much space an object occupies. Related problems of sampling and integration have numerous applications to other fields, thus it is key to develop efficient algorithmic solutions to these problems. …
-
Concentration of empirical distribution functions for dependent data under analytic hypotheses
The concentration property of empirical distribution functions is studied under the Levy distance for dependent data whose joint distribution satisfies analytic conditions expressed via Poincare-type and logarithmic Sobolev inequalities. The concentration results are then applied to the following …