directed_combinatorial_laplacian_matrix#

directed_combinatorial_laplacian_matrix(G, nodelist=None, weight='weight', walk_type=None, alpha=0.95)[source]#

Return the directed combinatorial Laplacian matrix of G.

The graph directed combinatorial Laplacian is the matrix

\[L = \Phi - (\Phi P + P^T \Phi) / 2\]

where P is the transition matrix of the graph and Phi a matrix with the Perron vector of P in the diagonal and zeros elsewhere [1].

Depending on the value of walk_type, P can be the transition matrix induced by a random walk, a lazy random walk, or a random walk with teleportation (PageRank).

Parameters:

GDiGraph: A NetworkX graph
nodelistlist, optional: The rows and columns are ordered according to the nodes in nodelist. If nodelist is None, then the ordering is produced by G.nodes().
weightstring or None, optional (default=’weight’): The edge data key used to compute each value in the matrix. If None, then each edge has weight 1.
walk_typestring or None, optional (default=None): If None, P is selected depending on the properties of the graph. Otherwise is one of ‘random’, ‘lazy’, or ‘pagerank’
alphareal: (1 - alpha) is the teleportation probability used with pagerank

Returns:

LNumPy matrix: Combinatorial Laplacian of G.