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. 1607.01369
  4. Cited By
On the Consistency of the Likelihood Maximization Vertex Nomination
  Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph
  Matching

On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching

5 July 2016
V. Lyzinski
Keith D. Levin
D. E. Fishkind
Carey E. Priebe
ArXivPDFHTML

Papers citing "On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching"

2 / 2 papers shown
Title
Adversarial contamination of networks in the setting of vertex
  nomination: a new trimming method
Adversarial contamination of networks in the setting of vertex nomination: a new trimming method
Sheyda Peyman
M. Tang
V. Lyzinski
AAML
20
0
0
20 Aug 2022
Vertex Nomination Via Seeded Graph Matching
Vertex Nomination Via Seeded Graph Matching
Heather G. Patsolic
Youngser Park
V. Lyzinski
Carey E. Priebe
6
20
0
01 May 2017
1