Random Lattice Triangulations

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


Duration: 47:39
189 views
1

Alexandre Stauffer, University of Bath
Approximate Counting, Markov Chains and Phase Transitions
https://simons.berkeley.edu/talks/alexandre-stauffer-02-23-2016



Other Videos By Simons Institute for the Theory of Computing


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-29Swendsen-Wang Algorithm on the Mean-Field Potts Model
2016-02-29Random Walk on Random Directed Graphs
2016-02-29Cutoff on all Ramanujan Graphs
2016-02-29Effect of Initial Conditions on Mixing for Spin Systems
2016-02-29Random Lattice Triangulations
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
2016-02-05Joint Analysis of Multiple Cancer Types for Revealing Disease-Specific Genomic Events
2016-02-05Interaction-based Methods for Uncovering Genes Functionally Important in Cancers
2016-02-05Molecular Characterization for Diagnoses and Treatment
2016-02-05Challenges and Opportunities in Intelligent Molecular Medicine
2016-02-05Molecular Data Integration for Precision Medicine in Breast Cancer


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