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 2 of 2 for “"Azuma-Hoeffding inequality"”.

  1. Barabási-Albert random graphs, scale-free distributions and bounds for approximation through Stein's method

    … for every member of the scheme. We apply the Azuma-Hoeffding inequality and Chernoff bounds to find bounds between the degree sequences of the random graph models and the given scale-free distribution. These bounds prove that the degree sequences converge completely (and therefore also …

    oxford Repository record for Barabási-Albert random graphs, scale-free distributions and bounds for approximation through Stein's method (opens in a new tab)

  2. Judicious partitions of graphs and hypergraphs

    Classical partitioning problems, like the Max-Cut problem, ask for partitions that optimize one quantity, which are important to such fields as VLSI design, combinatorial optimization, and computer science. Judicious partitioning problems on graphs or hypergraphs ask for partitions that optimize …

    gatech Repository record for Judicious partitions of graphs and hypergraphs (opens in a new tab)