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. 1812.10519
  4. Cited By
Maximum Likelihood Estimation and Graph Matching in Errorfully Observed
  Networks
v1v2v3v4 (latest)

Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks

26 December 2018
Jesús Arroyo
D. Sussman
Carey E. Priebe
V. Lyzinski
ArXiv (abs)PDFHTML

Papers citing "Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks"

5 / 5 papers shown
Title
Higher-order accurate two-sample network inference and network hashing
Higher-order accurate two-sample network inference and network hashing
Meijia Shao
Dong Xia
Yuan Zhang
Qiong Wu
Shuo Chen
77
6
0
16 Aug 2022
Clustered Graph Matching for Label Recovery and Graph Classification
Clustered Graph Matching for Label Recovery and Graph Classification
Zhirui Li
Jesús Arroyo
Konstantinos Pantazis
V. Lyzinski
FedML
73
1
0
06 May 2022
Maximum a Posteriori Inference of Random Dot Product Graphs via Conic
  Programming
Maximum a Posteriori Inference of Random Dot Product Graphs via Conic Programming
D. Wu
David R Palmer
Daryl R. DeFord
36
1
0
06 Jan 2021
Vertex Nomination in Richly Attributed Networks
Vertex Nomination in Richly Attributed Networks
Keith D. Levin
Carey E. Priebe
V. Lyzinski
3DH
46
0
0
29 Apr 2020
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
Jesús Arroyo
Carey E. Priebe
V. Lyzinski
82
2
0
05 Feb 2020
1