From your Block to our Block: How to Find Shared Structure between Stochastic Block Models over Multiple Graphs

Documenti analoghi

• Finding coherent node groups in directed graphs
  di: Kumpulainen, Iiro, et al.
  Pubblicazione: (2023)
• Max-Min Diversification with Asymmetric Distances
  di: Kumpulainen, Iiro, et al.
  Pubblicazione: (2025)
• Dense Subgraph Discovery Meets Strong Triadic Closure
  di: Arachchi, Chamalee Wickrama, et al.
  Pubblicazione: (2025)
• Community Recovery on Noisy Stochastic Block Models
  di: Anan, Washieu, et al.
  Pubblicazione: (2025)
• Improved Community Detection using Stochastic Block Models
  di: Park, Minhyuk, et al.
  Pubblicazione: (2024)