Datumorphism Datumorphism
Notebooks
Awesome Blog Cards Hologram Reading Notes TIL Wiki
  Hologram   Deep Learning Book
Blog AmNeumarkt
  • Datumorphism
  • Cards
  • Graph
  • Node Degree

Node Degree

GROWING This note is being developed. It is readible but changes are being applied.
cards/graph/node-degree.md Current Note ID: The unique ID of this note.
#Graph #Statistics

Node degree of a node $u$

$$ d_u = \sum_{v\in \mathcal V} A[u,v], $$

where $A$ is the adjacency matrix.

Planted: 2021-09-25 by L Ma;

References:
  1. Hamilton2020 Hamilton WL. Graph Representation Learning. Morgan & Claypool Publishers; 2020. pp. 1–159. doi:10.2200/S01045ED1V01Y202009AIM046
Dynamic Backlinks to cards/graph/node-degree:
Statistics of Graphs
Local Statistics Node Degree Node Degree Node degree of a node $u$ $$ d_u = \sum_{v\in \mathcal V} …
cards/graph/node-degree Links to:
What is Graph
Graph A graph $\mathcal G$ has nodes $\mathcal V$ and edges $\mathcal E$, $$ \mathcal G = ( \mathcal …

L Ma (2021). 'Node Degree', Datumorphism, 09 April. Available at: https://datumorphism.leima.is/cards/graph/node-degree/.

« Homophily on Graph Structural Equivalence on Graph »

Created and maintained by L Ma. Acknowledgement: Hugo, Bulma, KausalFlow. love.
Use CMD/WIN+k to activate the command palette
About Feed JSON Data