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 “"probabilistic combinatorics"”.
-
Topics In Probabilistic Combinatorics
This paper is a compilation of results in combinatorics utilizing the probabilistic method. Below is a brief description of the results highlighted in each chapter. Chapter 1 provides basic definitions, lemmas, and theorems from graph theory, asymptotic analysis, and probability which will be used …
-
Topics in Probabilistic Combinatorics
This thesis consists of an introduction and eight chapters, each devoted to a different combinatorial problem. In Chapter 2, we study problems regarding reconstructing the entirety, or a large subset, of a point set $V$ embedded in either $\mathbb{R}$ or $\mathbb{R}^d$, where the only information …
-
Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory
… we treat several problems in Ramsey theory, probabilistic combinatorics and extremal graph theory.
-
An Overview of the Constructive Local Lemma
<p>The Local Lemma has been a powerful tool in probabilistic combinatorics. Recent advances by Moser and Tardos have provided an algorithmic variant of the Local Lemma. We provide an overview of the analysis of their algorithm, and provide an implementation of the algorithm to a hypergraph coloring …
-
The Limits of Recovering Planted Subgraphs
… celebrated subgraph expectation thresholds from probabilistic combinatorics [KK07]. Furthermore, we give a polynomial-time description of the optimizers of this variational problem. This allows one to efficiently approximately compute the MMSE curve for any dense graph H when n is large. The …
-
Coloring problems in combinatorics and descriptive set theory
… feature throughout—most prominently, the use of probabilistic techniques. In Chapter 1, we establish a generalization of the Lovász Local Lemma (a powerful tool in probabilistic combinatorics), which we call the Local Cut Lemma, and apply it to a variety of problems in graph coloring. In Chapter …
-
Probabilistic and Analytic Methods in Combinatorics
This thesis studies a range of topics across combinatorics, broadly defined. The second chapter of this thesis addresses a longśstanding question of Erdős regarding the existence of high girth Steiner triple systems. The tools employed fall squarely within the context of probabilistic method, …
-
On some problems in extremal, probabilistic and enumerative combinatorics
… selection of problems from various areas of Combinatorics and Graph Theory, a fast developing field that provides a diverse spectrum of powerful tools with numerous applications to computer science, optimization theory and economics. In this thesis, we focus on extremal, probabilistic and …
-
Extremal and probabilistic bootstrap percolation
… dissertation we consider several extremal and probabilistic problems in bootstrap percolation on various families of graphs, including grids, hypercubes and trees. Bootstrap percolation is one of the simplest cellular automata. The most widely studied model is the so-called r-neighbour …
-
Extremal properties of some random combinatorial systems
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-02-04 without embargo terms