- The Experience
- The Programs
- MBA Program
- MSx Program
- PhD Program
- Executive Education
- Stanford Ignite
- Research Fellows Program
- Summer Institute for General Management
- Stanford LEAD Certificate: Corporate Innovation
- Stanford Innovation & Entrepreneurship Certificate
- Executive Program for Nonprofit Leaders
- Executive Program in Social Entrepreneurship
- Executive Program for Education Leaders
- Stanford go.to.market
- Faculty & Research
- Insights
- Alumni
- Events
You are here
Statistical Mechanics of Steiner trees
Statistical Mechanics of Steiner trees
Physical Review Letters.
2008
The Minimum Weight Steiner Tree (MST) is an important combinatorial optimization problem over networks that has applications in a wide range of fields. Here we discuss a general technique to translate the imposed global connectivity constrain into many local ones that can be analyzed with cavity equation techniques. This approach leads to a new optimization algorithm for MST and allows to analyze the statistical mechanics properties of MST on random graphs of various types.