Correlation Decay up to Uniqueness in Spin Systems
Yitong Yin Nanjing University Joint work with Liang Li (Peking Univ) Pinyan Lu (Microsoft research Asia)
Correlation Decay up to Uniqueness in Spin Systems Yitong Yin - - PowerPoint PPT Presentation
Correlation Decay up to Uniqueness in Spin Systems Yitong Yin Nanjing University Joint work with Liang Li ( Peking Univ ) Pinyan Lu ( Microsoft research Asia ) Two-State Spin System 2 states {0,1} graph G =( V , E ) configuration : V { 0
Yitong Yin Nanjing University Joint work with Liang Li (Peking Univ) Pinyan Lu (Microsoft research Asia)
A = A0,0 A0,1 A1,0 A1,1
β 1 1 γ
β γ 1
1 λ
b = (b0, b1) = (λ, 1)
w(σ) =
Aσ(u),σ(v)
bσ(v)
A = A0,0 A0,1 A1,0 A1,1
β 1 1 γ
w(σ) =
Aσ(u),σ(v)
bσ(v)
=
w(σ)
Z(G)
(σ) = w(σ) Z(G)
b = (b0, b1) = (λ, 1)
w(σ) =
Aσ(u),σ(v)
bσ(v) =
Z(G) w(σ)
A = A0,0 A0,1 A1,0 A1,1
β 1 1 γ
b = (b0, b1) = (λ, 1)
(τ) =
n
= w(τ) Z
1/poly(n) additive error for marginal in poly-time
FPTAS for Z(G)
[Jerrum-Sinclair’93]
βγ > 1
[Goldberg-Jerrum-Paterson’03]
βγ < 1
β = 0, γ = 1 β = γ
∃ FPTAS for graphs
(β, γ, λ) lies in the interior of uniqueness region of Δ-regular tree [Sinclair-Srivastava-Thurley’12] [Weitz’06]
0.5 1 1.5 2 2.5 3 0.5 1 1.5 2 2.5 3
= 1
uniqueness threshold threshold achieved by heatbath random walk[Goldberg-Jerrum-Paterson’03]
β γ
FPRAS for arbitrary graphs
[Li-Lu-Y. ’12]: no external field
FPTAS for arbitrary graphs
βγ < 1
(β, γ, λ) lies in the interiors of non-uniqueness regions of d-regular trees for some d ≤ Δ.
assuming NP ≠RP
[Sly-Sun’12] [Galanis-Stefankovic-Vigoda’12]: bounded Δ or Δ=∞
(d+1)-regular tree
reg. tree
arbitrary boundary config
marginal at root ± exp(-t) fd(x) = λ βx + 1 x + γ d
ˆ xd = fd(ˆ xd) |f
d(ˆ
xd)| < 1
βγ < 1
assuming NP ≠RP
[Sly-Sun’12] [Galanis-Stefankovic-Vigoda’12]: bounded Δ or Δ=∞ ∀d < ∆, |f
d(ˆ
xd)| < 1 ∃d < ∆, |f
d(ˆ
xd)| > 1
fd(x) = λ βx + 1 x + γ d
∂B
∀σ∂B, τ∂B ∈ {0, 1}∂B Λ
σ [σ(v) = 0 | τ∂B]
σ [σ(v) = 0 | τ∂B, σΛ]
1
1 2 3 4 5 6 2 4 4 1 4 4 6 5 5 6 4 3 3 5 6 5 6 4 1
T = T(G, v) 6 6 6 6 6 σΛ preserve the marginal dist. at v
SSM in Δ-reg. tree SSM in graphs
in reg. trees: WSM SSM
β, γ < 1
WSM in Δ-reg. tree SSM in graphs
SSM in trees
SSM in graphs
SSM in trees
SSM in Δ-reg. tree
β, γ < 1
in reg. trees: WSM SSM
SSM in trees
SSM in graphs
SSM in trees
SSM in Δ-reg. tree
in reg. trees: WSM SSM
WSM in d-reg. trees for d≤Δ SSM in trees
SSM in trees
SSM in graphs
in reg. trees: WSM SSM
WSM in d-reg. trees for d≤Δ SSM in trees
SSM in trees
SSM in graphs
SSM in graphs
WSM in d-reg. trees for d≤Δ
v T v1 v2 vd T1 Td x = f(x1, . . . , xd) = λ
d
βxi + 1 xi + γ
[σ(v) = 1 | σΛ] x n ∈ [0, ∞) x ∈ [R, R + δ] δ = (−Ω(n))
x f(x) f Fn(x + δ) − Fn(x) = F
n(x0) · δ
Fn(x) = f f · · · f
(x) = δ ·
n1
f (xt) xt = f(xt−1) = δ · Φ(x0) Φ(xn) ·
n1
Φ(f(xt)) Φ(xt) f (xt)
x f(x) y g(y) g f φ φ−1 φ(x) = Φ(x) G
n(x0) = n1
g(xt) =
n1
[φ(f(φ1(yt))] =
n1
Φ(f(xt)) Φ(xt) f (xt) Gn(x) = g g · · · g
(x) Gn(x + δ) − Gn(x) = G
n(x0) · δ
v v1 v2 vd x1 xd x v v1 v2 vd y y1 yd φ
f(x1, . . . , xd) = λ
d
βxi + 1 xi + γ
= φ(f(φ−1(y1), . . . , φ−1(yd))) · (δ1, . . . , δd)
φ(x) = Φ(x) = 1
≤ α(d; x1, . . . , xd) ·
1≤i≤d{δi}
+δ1 +δd
g(y1, . . . , yd) = φ(f(φ−1(y1), . . . , φ−1(yd)))
α(d; x1, , xd) αd(x) α(d; x, . . . , x
d
)
Cauchy-Schwarz arithmetic and geometric means
= Φ(f(x)) Φ(x) |f (x)|
= (1 − βγ)
i=1 βxi+1 xi+γ
1
2
i=1 βxi+1 xi+γ + 1
1
2
λ d
i=1 βxi+1 xi+γ + γ
1
2 ·
d
x
1 2
i
(βxi + 1)
1 2 (xi + γ) 1 2
=
(βx + 1)(x + γ)
x+γ
d
x+γ
d + 1 λ
x+γ
d + γ
αd(x)
=
(βx + 1)(x + γ)
x+γ
d
x+γ
d + 1 λ
x+γ
d + γ
βx + 1 x + γ d
ˆ xd = fd(ˆ xd) |f
d(ˆ
xd)| < 1
≤
x (βˆ x + 1)(ˆ x + γ) =
d(ˆ
xd)|
=
(βx + 1)(x + γ)
(βfd(x) + 1) (fd(x) + γ)
v v1 v2 vd y y1 yd +δ1 +δd +δ
δ ≤ α ·
1≤i≤d{δi}
α < 1
βγ < 1 ∃ FPTAS for graphs of max-degree Δ ∀d < ∆, |f
d(ˆ
xd)| < 1
fd(x) = λ βx + 1 x + γ d
SSM in graphs of max-degree Δ SSM in trees of max-degree Δ bounded Δ |f
∆(ˆ
x∆)| < 1 SSM in Δ-reg. tree SSM in reg. trees: WSM
[Weitz’06] + [Sinclair-Srivastava-Thurley’12] + translation
|f (ˆ x)| < 1
|f (x)| · Φ (f(x)) Φ(x) < 1
f(x) = λ βx + 1 x + γ d
ˆ x = f(ˆ x)
f(x) = λ βx + 1 x + γ d
ˆ x = f(ˆ x)
x)| = 1
Φ(x)
x
= 0 (ln(Φ(ˆ x))) = −f (ˆ x) 2 = 1 2 1 ˆ x + 1 ˆ x + γ + β βˆ x + 1
Φ(x) |f (ˆ x)| · Φ (f(ˆ x)) Φ(ˆ x) = 1
(ln(Φ(ˆ x))) = 1 2 1 ˆ x + 1 ˆ x + γ + β βˆ x + 1
2 1 x + 1 x + γ + β βx + 1
Φ(x) = C
αd(x) =
(βx + 1)(x + γ)
(βfd(x) + 1) (fd(x) + γ)
v v1 v2 vd y y1 yd +δ1 +δd +δ δ ≤ αd(x) ·
1≤i≤d{δi}
for small
for large
αd(x) v v1 v2 vd y y1 yd +δ1 +δd +δ δ ≤ αd(x) ·
1≤i≤d{δi}
v v1 v2 vd “span” d leaves M-ary
v v1 v2 vd
distance = O(log n) 1/poly-precision in poly-time
βγ < 1 ∃ FPTAS for graphs of max-degree Δ bounded Δ or Δ=∞ WSM in d-reg. trees for d ≤ Δ
[Sinclair-Srivastava-Thurley’12] [Weitz’06]
WSM in Δ-reg. tree
fd(x) = λ βx + 1 x + γ d
ˆ xd = fd(ˆ xd) |f
d(ˆ
xd)| < 1
500 1000 1500 2000 0.5 1.0 1.5
d |f
d(ˆ
xd)| due to [Guo’12]
β, γ ≤ 1
γ > 1
βγ < 1
monotone single-peak
0.5 1 1.5 2 2.5 3 0.5 1 1.5 2 2.5 3
= 1
uniqueness threshold
threshold achieved by heatbath random walk
β
γ
β, γ ≤ 1
WSM in Δ-reg. tree ⇒ WSM in d-reg. tree for d ≤ Δ WSM in D-reg. tree ⇒ WSM in all d-reg. trees
γ > 1
βγ < 1
D
500 1000 1500 2000 0.5 1.0 1.5
d |f
d(ˆ
xd)|
β, γ ≤ 1
γ > 1
βγ < 1
monotone single-peak
(β, γ, λ) that WSM in Δ-reg. tree but not in (Δ-1)-reg. tree
1
SSM in reg. trees: WSM
[Weitz’06] + [Sinclair-Srivastava-Thurley’12] + translation
SSM in graphs
SSM in Δ-reg. tree
systems.
WSM/SSM w.r.t degree.
correlation decay to other problems.