Research map / Graph learning / Graph algorithms and clustering
Synchronization of Group-Labelled Multi-Graphs
Andrea Porfiri Dal Cin, Luca Magri, Federica Arrigoni, Andrea Fusiello, Giacomo Boracchi
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace edge averaging with multi-graph synchronization (MultiSync) | patch-graph synchronization · synthetic SO(3) multi-graphs | angular error | Improved |
| replace edge averaging with MultiSync | synchronization · synthetic SO(3), large noise sigma | angular error | Improved |
| replace edge averaging with MultiSync | synchronization · synthetic SL(3) multi-graphs | Frobenius error | Improved |
| replace edge averaging with MultiSync | patch-graph synchronization · Gendarmenmarkt (partitioned SO(3) sync) | median angular error: 21.18 -> 12.68 | Improved |
| replace edge averaging with MultiSync | patch-graph synchronization · Roman Forum (partitioned SO(3) sync) | median angular error: 9.12 -> 3.39 | Improved |
| replace edge averaging with MultiSync | patch-graph synchronization · Piccadilly (partitioned SO(3) sync) | mean angular error: 19.89 -> 17.47 | Improved |
| replace edge averaging with MultiSync | patch-graph synchronization · Alamo (partitioned SO(3) sync) | median angular error: 1.63 -> 1.57 | No clear effect |
| replace edge averaging with MultiSync | patch-graph synchronization · Piccadilly (partitioned SO(3) sync) | running time: 17.45 -> 17.61 | No clear effect |
| partition the graph and use MultiSync instead of full synchronization | MPLS full sync · Piccadilly (partitioned SO(3) sync) | running time: 241 -> 17.61 | Improved |
| partition the graph and use MultiSync instead of full synchronization | MPLS full sync · Piccadilly (partitioned SO(3) sync) | median angular error: 1.94 -> 8.21 | Hurt |
| use MultiSync with different patch solvers (EIG-IRLS, L1-IRLS, R-GoDec) | MultiSync · real SO(3) datasets | median error / time | Mixed |
| sparse graph lacking cycles | MultiSync · Gendarmenmarkt (partitioned SO(3) sync) | median angular error: 12.68 | Hurt |
Closest papers by meaning
- Approximating Optimal Labelings for Temporal Connectivity (AAAI 2025 · similarity 0.86)
- Robust Angular Synchronization via Directed Graph Neural Networks (ICLR 2024 · similarity 0.85)
- Clustering from General Pairwise Observations with Applications to Time-varying Graphs (JMLR 2017 · similarity 0.85)
- Efficient Detection of Long Consistent Cycles and its Application to Distributed Synchronization (CVPR 2024 · similarity 0.85)
- Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve over Time (AAAI 2025 · similarity 0.83)
- Structure-Aware Spectral Sparsification via Uniform Edge Sampling (NeurIPS 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
