What is the difference between:normalizing the row of an adjacency matrix and taking the right eigenvectornormalizing the row of an adjacency matrix and taking the left eigenvectornormalizing the columns of an adjacency matrix and taking the right eigenvectornormalizing the columns of an adjacency matrix and taking the left eigenvectorI think that if you take the left eigenvector (number of paths coming INTO a node) you should normalize the COLUMNS, while if you are interested in the RIGHT eigenvector (number of paths outgoing from a node) you should normalize the ROWS.Why is l1 norm used?Thank you :)
Graph Centrality: spectral techniques
graph theory;graphs;markov chains