Seeded Graph Matching Via Joint Optimization of Fidelity and Commensurability

Abstract

We present a novel approximate graph matching algorithm that incorporates seeded data into the graph matching paradigm. Our Joint Optimization of Fidelity and Commensurability (JOFC) algorithm embeds two graphs into a common Euclidean space where the matching inference task can be performed. Through real and simulated data examples, we demonstrate the versatility of our algorithm in matching graphs with various characteristics--weightedness, directedness, loopiness, many-to-one and many-to-many matchings, and soft seedings.

26 pages, 7 figures. Updated content and added application of simultaneous matching for several time-steps for zebrafish connectomes

Cited by in corpus (8)

• (Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs
• Robust Estimation from Multiple Graphs under Gross Error Contamination
• Unseeded low-rank graph matching by transform-based unsupervised point registration
• The Phantom Alignment Strength Conjecture: Practical use of graph matching alignment strength to indicate a meaningful graph match
• The Importance of Being Correlated: Implications of Dependence in Joint Spectral Inference across Multiple Networks
• A Joint Graph Inference Case Study: the C.elegans Chemical and Electrical Connectomes
• Tractable Graph Matching via Soft Seeding
• On consistent vertex nomination schemes