做者:凱魯嘎吉 - 博客園 http://www.cnblogs.com/kailugaji/html
問題:已經獲得一個無向連通圖,知道各個節點之間的鏈接狀況,求節點之間的Metropolis-Hastings權重。網絡
前提:用MATLAB實例:構造網絡鏈接圖(Network Connection)及計算圖的代數連通度(Algebraic Connectivity)中的函數構造獲得網絡鏈接圖,並獲得Network.mat。less
網絡鏈接狀況以下:函數
function W = Metropolis_Weights(Network)
% Author: kailugaji
% 凱魯嘎吉 - 博客園 http://www.cnblogs.com/kailugaji/
NodeNum= Network.Conf.NodeNumber; %節點個數
W=zeros(NodeNum, NodeNum);
s=0;
for i=1:NodeNum
K=length(Network.Nodes.neighbors{i});
% i=j
for k=1:K
index=Network.Nodes.neighbors{i}(k);
s=s+1./(max(K,length(Network.Nodes.neighbors{index}))+1);
end
W(i, i)=1-s;
s=0;
% i~=j
for j=1:NodeNum
if (sum(Network.Nodes.neighbors{i}==j)==1) && (i~=j)
W(i, j)=1./(max(K,length(Network.Nodes.neighbors{j}))+1);
elseif (sum(Network.Nodes.neighbors{i}==j)==0) && (i~=j)
W(i, j)=0;
end
end
end
>> load('Network_1.mat')
>> format short
>> W = Metropolis_Weights(Network)
W =
0.5083 0 0 0 0 0 0 0.1667 0.2000 0.1250
0 0.8000 0 0 0.2000 0 0 0 0 0
0 0 0.4750 0.1250 0.2000 0.2000 0 0 0 0
0 0 0.1250 0.1250 0.1250 0.1250 0.1250 0.1250 0.1250 0.1250
0 0.2000 0.2000 0.1250 0.3500 0 0 0 0 0.1250
0 0 0.2000 0.1250 0 0.3500 0.2000 0 0 0.1250
0 0 0 0.1250 0 0.2000 0.3833 0.1667 0 0.1250
0.1667 0 0 0.1250 0 0 0.1667 0.2500 0.1667 0.1250
0.2000 0 0 0.1250 0 0 0 0.1667 0.3833 0.1250
0.1250 0 0 0.1250 0.1250 0.1250 0.1250 0.1250 0.1250 0.1250
拓展:實際上獲得的Metropolis-Hastings權重是一個對稱雙隨機矩陣,即:post
雙隨機矩陣(doubly stochastic matrix):元素屬於[0,1],行和爲1,且列和爲1。url
參考:spa
[1] 構造n階對稱雙隨機矩陣MATLAB實例:對稱雙隨機矩陣設計
[2] 幾種雙隨機權重矩陣的設計:S. Silva Pereira, 「Distributed consensus algorithms for wireless sensor networks: convergence analysis and optimization,」 Tesi doctoral, UPC, Departament de Teoria del Senyal i Comunicacions, 2012.中的3.4.1節: Review of Common Weight Matrix Designsorm