Graphics Reference
In-Depth Information
Ego Network
The subgraph around a node consisting of its linked nodes and any links
between them. An ego network can also be called a neighborhood. Ego
networks may be defined by degrees.
Eigenvector Centrality
A specific computational measure of the importance of a node in a graph
based on transitive influence. In this form of centrality, a node is most
important if other important nodes link to it.
Force-Directed Layout
A class of graph layout that uses repelling forces between nodes and
attracting forces along links to spatially cluster related nodes.
Incident Links
A link is incident to a node if it connects to it.
Isolated Node
A node with no links.
Leaf Node
A node with incoming links, but no outgoing links.
Link
A relationship between nodes, typically represented as a line. In graph
theory, a link is more often referred to as an edge.
Loop
A link in which both the start and end are connected to the same node.
Also known as self-loop.
Modularity
A measure of community strength, or, more often, a reference to the
community-detection algorithm based on computation of that measure.
Network
Another name for a graph, where each node typically represents a
physical entity, rather than something more abstract or conceptual.
Page Rank
A variant of Eigenvector Centrality that formed the foundation of
Google's first search algorithm. Page Rank was used to weigh the
relevance of a web page by the aggregate weight of other relevant web
pagesthatlinkedtoit.Despitetheimplicationofthename,thealgorithm
can be used for any type of graph data to estimate the importance of
nodes.
