Generating Random Permutations Using Switching Networks

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


Duration: 35:47
695 views
4

Artur Czumaj, University of Warwick
Approximate Counting, Markov Chains and Phase Transitions
https://simons.berkeley.edu/talks/artur-czumaj-02-25-2016



Other Videos By Simons Institute for the Theory of Computing


2016-03-11Utilizing de Bruijn Graphs in Universal Sequence Design for Discovery of Regulatory Elements
2016-03-11Genome-wide Prediction of Enhancers and Their Target Genes Using ENCODE Data
2016-03-11Chromatin Dynamics and Gene Regulation During Motor Neuron Programming
2016-02-29Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics
2016-02-29Equitable Rectangular Dissections of a Square
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-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


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