The Most Trustworthy Path Selection in Online Social Networks

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="408148.fig.004a" src="https://static.hindawi.com/articles/mpe/volume-2013/408148/figures/408148.fig.004a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Network ID with WID = 1</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="408148.fig.004b" src="https://static.hindawi.com/articles/mpe/volume-2013/408148/figures/408148.fig.004b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b> Network ID with WID = 2</td></tr></table></td></tr><tr class="fig-image" id="c"><td><img alt="408148.fig.004c" src="https://static.hindawi.com/articles/mpe/volume-2013/408148/figures/408148.fig.004c.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(c) </b> Network ID with WID = 3</td></tr></table></td></tr><tr class="fig-image" id="d"><td><img alt="408148.fig.004d" src="https://static.hindawi.com/articles/mpe/volume-2013/408148/figures/408148.fig.004d.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(d) </b> Network ID with WID = 4</td></tr></table></td></tr></table>

<table>Comparison of path utilities of networks.</table>

Mathematical Problems in Engineering

fig4

Figure 4

Figure 4: The Most Trustworthy Path Selection in Online Social Networks 