- Deals with decentralized communication in networks where short paths exist between nearly all nodes
- Approach outperforms competitors, is based on two measures commonly used to summarize local information
- Homophily is the tendency of similar nodes to be connected
- The algorithm simply passes the message to the node that has the highest likelihood of being connected to the goal (algorithm is called expected-value navigation)
- This algorithm generalizes earlier approaches

- Goal is to minimize length of path of message
- Each node knows what neighbors it is connected to as well as their feature information and degree
- Uses probability estimates of distances, but its not clear why these distributions are needed if the algorithm is deterministic (not sure yet).
- Seems like the operation tries to send to a node that has the highest probability of a distance of 1 from the goal, as opposed to a minimal weighted distance, as apparently homophily implies that a high probability of distance 1 means also a high probability of other small distances
- Need to read on what guarantees related to homophily are

- Seems like as defined, a node
*s*has similarity to node*t*of*q_{st}**.*For all edges leaving from*s*, the probability that each edge goes to*t*is also*q_{st}*. This means that distances have to be normalized over each node. The probability of*s*connecting directly to*t*then is just a binomial distribution - Does not revisit nodes (assigns them 0 probability), if all visited, traversal at random
- I can’t believe nobody did this already?
- Compares to pure similarity, pure degree (this approach does both) as well as random. In synthetic and real-world networks. Surprise this works best.
- For medium homophilly, it does fairly well relative to global planning, but for low homophily the distance metric isnt so useful, and for high homophily means there are few short paths
- Also did an example with paper citations where keywords were distance metric, cute
- Uses a Poisson approximation of the binomial? (its been awhile since OR, forgot about this)

Advertisements
(function(){var c=function(){var a=document.getElementById("crt-1765533219");window.Criteo?(a.parentNode.style.setProperty("display","inline-block","important"),a.style.setProperty("display","block","important"),window.Criteo.DisplayAcceptableAdIfAdblocked({zoneid:388248,containerid:"crt-1765533219",collapseContainerIfNotAdblocked:!0,callifnotadblocked:function(){a.style.setProperty("display","none","important");a.style.setProperty("visbility","hidden","important")}})):(a.style.setProperty("display","none","important"),a.style.setProperty("visibility","hidden","important"))};if(window.Criteo)c();else{if(!__ATA.criteo.script){var b=document.createElement("script");b.src="//static.criteo.net/js/ld/publishertag.js";b.onload=function(){for(var a=0;a<__ATA.criteo.cmd.length;a++){var b=__ATA.criteo.cmd[a];"function"===typeof b&&b()}};(document.head||document.getElementsByTagName("head")[0]).appendChild(b);__ATA.criteo.script=b}__ATA.criteo.cmd.push(c)}})();
(function(){var c=function(){var a=document.getElementById("crt-1345127840");window.Criteo?(a.parentNode.style.setProperty("display","inline-block","important"),a.style.setProperty("display","block","important"),window.Criteo.DisplayAcceptableAdIfAdblocked({zoneid:837497,containerid:"crt-1345127840",collapseContainerIfNotAdblocked:!0,callifnotadblocked:function(){a.style.setProperty("display","none","important");a.style.setProperty("visbility","hidden","important")}})):(a.style.setProperty("display","none","important"),a.style.setProperty("visibility","hidden","important"))};if(window.Criteo)c();else{if(!__ATA.criteo.script){var b=document.createElement("script");b.src="//static.criteo.net/js/ld/publishertag.js";b.onload=function(){for(var a=0;a<__ATA.criteo.cmd.length;a++){var b=__ATA.criteo.cmd[a];"function"===typeof b&&b()}};(document.head||document.getElementsByTagName("head")[0]).appendChild(b);__ATA.criteo.script=b}__ATA.criteo.cmd.push(c)}})();