50.
Trees & Circuits
Our Graph here is
known as a tree,
because you can’t loop
back on yourself.
If you could loop back
on yourself it would be
known as a circuit
This is interesting to think about in the context of your
site, or an area of the link graph

69.
Intentional Surfer
The intentional surfer model supposes
that links which ‘actually’ receive the
most links should be given more value.
http://en.wikipedia.org/wiki/PageRank#The_intentional_surfer_model

70.
A lot has changed at Google,
but it will always be a search
engine which relies upon
PageRank; which is a practical
application of Graph Theory

109.
Every User, Page, Photo, Post &
Place is a Node
https://thetribe.s3.amazonaws.com/ferris.gif

110.
http://maxlutz.com/blog/wp-content/uploads/2013/05/coffee2.gif
Every friendship, checkin, tag
or like is an Edge

111.
Each Node has Meta-Data
like description, this how
the old FB Search “worked”

112.
GraphSearch Allows you
search the Edges as well
as the Nodes
JD Hancock
JD Hancock

113.
GraphSearch makes it easy to ﬁnd nodes that are connected to
another node by searching for an edge-type combined with an
input node.
E.g.:
■Your friends: friend:10003
■People who live in new york: lives-in:111
■People who like downtown abbey: like:222

114.
‘Facebook use query-independent
signals to come up with a numeric
value for importance.
This value is
called the
“static rank”
of the entity.’
JD Hancock

115.
What makes up static rank is still up for
debate, but sensibly could be informed by
the elements of Edgerank
aka
the (old name for) newsfeed algo

126.
Knowledge Graph is
part of a huge change
in how Google deliver
search results

127.
I’m now going to give you lots of
examples of changes in the way
Google present results,
not all of them are truly ‘Knowledge
Graph’
but do indicate a general shift in the
way they present results.

128.
There’s more than 85 of these
features that Dr. Pete from Moz has
documented
http://www.slideshare.net/crumplezone/
beyond-10-blue-links-the-future-of-ranking