ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.01648
  4. Cited By
Graph matching between bipartite and unipartite networks: to collapse,
  or not to collapse, that is the question

Graph matching between bipartite and unipartite networks: to collapse, or not to collapse, that is the question

5 February 2020
Jesús Arroyo
Carey E. Priebe
V. Lyzinski
ArXivPDFHTML

Papers citing "Graph matching between bipartite and unipartite networks: to collapse, or not to collapse, that is the question"

3 / 3 papers shown
Title
Co-Embedding: Discovering Communities on Bipartite Graphs through
  Projection
Co-Embedding: Discovering Communities on Bipartite Graphs through Projection
G. Candel
D. Naccache
13
0
0
15 Sep 2021
Efficiently inferring community structure in bipartite networks
Efficiently inferring community structure in bipartite networks
D. Larremore
A. Clauset
Abigail Z. Jacobs
67
180
0
12 Mar 2014
Asymptotic normality of maximum likelihood and its variational
  approximation for stochastic blockmodels
Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
Peter J. Bickel
David S. Choi
Xiangyu Chang
Hai Zhang
71
220
0
04 Jul 2012
1