Counting Independent Sets in Hypergraphs when Strong Spatial Mixing Fails

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=3NAbP_BSWMo


Duration: 46:26
295 views
2

Andreas Galanis, University of Oxford
Approximate Counting, Markov Chains and Phase Transitions
https://simons.berkeley.edu/talks/andreas-galanis-02-23-2016



Other Videos By Simons Institute for the Theory of Computing


2016-02-29An Occupancy Approach to the Hard-Core Model
2016-02-29Rates of Convergence for 'Features' of a Markov Chain
2016-02-29The Computational Complexity of Estimating Convergence Time
2016-02-29Local Graph Coloring
2016-02-29Local Algorithms for Community Detection
2016-02-29Generating Random Permutations Using Switching Networks
2016-02-29Learning a Tree-Structured Ising Model in Order to Make Predictions
2016-02-29The Complexity of Approximately Counting in 2-spin Systems on k-uniform Bounded-degree Hypergraphs
2016-02-29Local Algorithms for Two Problems on Locally Tree-Like Graphs
2016-02-29Dynamics for the Random-Cluster Model
2016-02-29Counting Independent Sets in Hypergraphs when Strong Spatial Mixing Fails
2016-02-29Random Lattice Triangulations
2016-02-29Glauber Dynamics of Lattice Triangulations on Thin Rectangles
2016-02-29FPTAS for #BIS with Degree Bounds on One Side
2016-02-29Curvature, Mixing, and Entropic Interpolation
2016-02-29SAT Counting and Sampling -- From Theory to Practice
2016-02-05The Current State of Mutation Detection and Prospects for Long Read Sequencing
2016-02-05Modeling Cancer Evolution from Genomic Data
2016-02-05Mechanisms of Amplification in Tumor Genomes
2016-02-05Algorithms for Population Genomics and Cancer Genomics
2016-02-05Somatic Mutations that Alter RNA Splicing in Human Cancers


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Counting Complexity and Phase Transitions
Andreas Galanis