Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
1 answer
143 views

Eigenvalues of directed graph with one outward edge for each vertex

I am concerned with unweighted directed graphs where each node contains exactly one edge pointing to another node, which could be itself. In other words, each row of the adjacency matrix contains one ...
user3433489's user avatar
1 vote
1 answer
1k views

Significance of the Eigenvalues of the adjacency matrix of a weighted di-graph

I'm currently running a simulation on a bunch of randomly generated points, each with two randomly selected 'partners' from the set of points. In the simulation the points try to move such that they ...
rysuds's user avatar
  • 13