Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Rapid mixing of Gibbs sampling on graphs that are sparse on average
Elchanan Mossel,
Allan Sly
Research output
:
Contribution to journal
›
Article
›
peer-review
22
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Rapid mixing of Gibbs sampling on graphs that are sparse on average'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Gibbs Sampling
100%
Ising Model
100%
Rapid Mixing
100%
Sampling on Graphs
100%
Polynomial Time
50%
Random Graphs
50%
Color number
50%
Inverse Temperature
50%
Gibbs Sampler
50%
Time Mixing
50%
Mixing Time
50%
Log-log
50%
Erdos
50%
External Field
50%
Popular
25%
Glauber Dynamics
25%
Induced Subgraph
25%
Rare Example
25%
Simple Path
25%
Maximum Degree
25%
Block Dynamics
25%
Order Degree
25%
Tree Structure
25%
Graph Families
25%
Natural Distribution
25%
Underlying Graph
25%
High-dimensional Distribution
25%
Ising
25%
Graph Dynamics
25%
Non-Markov Chain
25%
Vertex Degree
25%
Correlation Decay
25%
Tanh
25%
Graphical Comparison
25%
FPRAS
25%
Random Blocks
25%
Markov Chain Algorithm
25%
Mathematics
Polynomial Time
100%
Random Graph
100%
Edge
100%
Inverse Temperature
100%
Gibbs Sampler
100%
External Field
100%
Probability Theory
50%
Critical Point
50%
Sufficient Condition
50%
Dimensional Distribution
50%
Induced Subgraph
50%
Maximum Degree
50%
Markov Chain
50%
Wide Range
50%
Exp
50%
Apply It
50%
Tree-Like
50%