11 research outputs found
Rapid mixing from spectral independence beyond the Boolean domain
We extend the notion of spectral independence (introduced by Anari, Liu, and
Oveis Gharan [ALO20]) from the Boolean domain to general discrete domains. This
property characterises distributions with limited correlations, and implies
that the corresponding Glauber dynamics is rapidly mixing.
As a concrete application, we show that Glauber dynamics for sampling proper
-colourings mixes in polynomial-time for the family of triangle-free graphs
with maximum degree provided where
is the unique solution to
and is any constant. This is the first efficient algorithm for
sampling proper -colourings in this regime with possibly unbounded .
Our main tool of establishing spectral independence is the recursive coupling
by Goldberg, Martin, and Paterson [GMP05]
Sampling Random Colorings of Sparse Random Graphs
We study the mixing properties of the single-site Markov chain known as the
Glauber dynamics for sampling -colorings of a sparse random graph
for constant . The best known rapid mixing results for general graphs are in
terms of the maximum degree of the input graph and hold when
for all . Improved results hold when for
graphs with girth and sufficiently large where is the root of ; further improvements on
the constant hold with stronger girth and maximum degree assumptions.
For sparse random graphs the maximum degree is a function of and the goal
is to obtain results in terms of the expected degree . The following rapid
mixing results for hold with high probability over the choice of the
random graph for sufficiently large constant~. Mossel and Sly (2009) proved
rapid mixing for constant , and Efthymiou (2014) improved this to linear
in~. The condition was improved to by Yin and Zhang (2016) using
non-MCMC methods. Here we prove rapid mixing when where
is the same constant as above. Moreover we obtain
mixing time of the Glauber dynamics, while in previous rapid mixing
results the exponent was an increasing function in . As in previous results
for random graphs our proof analyzes an appropriately defined block dynamics to
"hide" high-degree vertices. One new aspect in our improved approach is
utilizing so-called local uniformity properties for the analysis of block
dynamics. To analyze the "burn-in" phase we prove a concentration inequality
for the number of disagreements propagating in large blocks
Coalition Formation For Distributed Constraint Optimization Problems
This dissertation presents our research on coalition formation for Distributed Constraint Optimization Problems (DCOP). In a DCOP, a problem is broken up into many disjoint sub-problems, each controlled by an autonomous agent and together the system of agents have a joint goal of maximizing a global utility function. In particular, we study the use of coalitions for solving distributed k-coloring problems using iterative approximate algorithms, which do not guarantee optimal results, but provide fast and economic solutions in resource constrained environments. The challenge in forming coalitions using iterative approximate algorithms is in identifying constraint dependencies between agents that allow for effective coalitions to form. We first present the Virtual Structure Reduction (VSR) Algorithm and its integration with a modified version of an iterative approximate solver. The VSR algorithm is the first distributed approach for finding structural relationships, called strict frozen pairs, between agents that allows for effective coalition formation. Using coalition structures allows for both more efficient search and higher overall utility in the solutions. Secondly, we relax the assumption of strict frozen pairs and allow coalitions to form under a probabilistic relationship. We identify probabilistic frozen pairs by calculating the propensity between two agents, or the joint probability of two agents in a k-coloring problem having the same value in all satisfiable instances. Using propensity, we form coalitions in sparse graphs where strict frozen pairs may not exist, but there is still benefit to forming coalitions. Lastly, we present a cooperative game theoretic approach where agents search for Nash stable coalitions under the conditions of additively separable and symmetric value functions