1.0Microsoft Researchhttps://www.microsoft.com/en-us/researchJeff Runninghttps://www.microsoft.com/en-us/research/people/jeffrunn/The Social Network model - Microsoft Researchrich600338<blockquote class="wp-embedded-content" data-secret="8n1710qpFk"><a href="https://www.microsoft.com/en-us/research/video/the-social-network-model/">The Social Network model</a></blockquote><iframe sandbox="allow-scripts" security="restricted" src="https://www.microsoft.com/en-us/research/video/the-social-network-model/embed/#?secret=8n1710qpFk" width="600" height="338" title="“The Social Network model” — Microsoft Research" data-secret="8n1710qpFk" frameborder="0" marginwidth="0" marginheight="0" scrolling="no" class="wp-embedded-content"></iframe><script type="text/javascript">
/* <![CDATA[ */
/*! This file is auto-generated */
!function(d,l){"use strict";l.querySelector&&d.addEventListener&&"undefined"!=typeof URL&&(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&&!/[^a-zA-Z0-9]/.test(t.secret)){for(var s,r,n,a=l.querySelectorAll('iframe[data-secret="'+t.secret+'"]'),o=l.querySelectorAll('blockquote[data-secret="'+t.secret+'"]'),c=new RegExp("^https?:$","i"),i=0;i<o.length;i++)o[i].style.display="none";for(i=0;i<a.length;i++)s=a[i],e.source===s.contentWindow&&(s.removeAttribute("style"),"height"===t.message?(1e3<(r=parseInt(t.value,10))?r=1e3:~~r<200&&(r=200),s.height=r):"link"===t.message&&(r=new URL(s.getAttribute("src")),n=new URL(t.value),c.test(n.protocol))&&n.host===r.host&&l.activeElement===s&&(d.top.location.href=t.value))}},d.addEventListener("message",d.wp.receiveEmbedMessage,!1),l.addEventListener("DOMContentLoaded",function(){for(var e,t,s=l.querySelectorAll("iframe.wp-embedded-content"),r=0;r<s.length;r++)(t=(e=s[r]).getAttribute("data-secret"))||(t=Math.random().toString(36).substring(2,12),e.src+="#?secret="+t,e.setAttribute("data-secret",t)),e.contentWindow.postMessage({message:"ready",secret:t},"*")},!1)))}(window,document);
//# sourceURL=https://www.microsoft.com/en-us/research/wp-includes/js/wp-embed.min.js
/* ]]> */
</script>
https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/the-social-network-model-1.jpg320240At time 0 start several independent lazy simple random walks on a finite or infinite connected graph (for instance, start with 1 walker at each vertex). When two walkers visit the same vertex at the same time they are declared acquaintance. The social connectivity time is defined to be the minimal time in which any […]