When does a digraph admit a doubly stochastic adjacency matrix?

Bahman Gharesifard Jorge Cortés

Published in: ACC (2010)

Keyphrases

doubly stochastic
adjacency matrix
weight matrix
graph representation
graph matching
weighted graph
graph clustering
graph model
positive definite
directed graph
graph partitioning
edit distance
normalized cut
object recognition
bipartite graph
random variables
probability distribution