5 problems

MRF partition-function conjecture. Polynomial-time algorithms for computing the partition function of an MRF can be constructed under a weaker assumption than $$ .

Let mutation matrices be governed by a single order parameter $\theta$, and let $\theta(e)$ denote the parameter of the mutation matrix $M^e$ on edge $e$. Consider the Markov rando…

For each site $i\in\mathbb Z$ and fixed $t>0$, let $X_i[t]$ denote the trajectory of site $i$ up to time $t$, and let $(X_j[t])_{j<i}$ and $(X_j[t])_{j>i}$ denote the trajectories…

For each site $i\in\mathbb Z$ and fixed $t>0$, let $(X_j(t))_{j<i}$ and $(X_j(t))_{j>i}$ denote the states to the left and right of $i$, respectively. First-order state Markov conj…

Let $n_L$ denote the width of the cutset components, and let the distribution redundancy be the redundancy arising from approximating the lines by moment-matching reduced Markov ra…