Mehrdad Moharrami

activity

20162026

most citedA Policy Gradient Algorithm for the Risk-Sensitive Exponential Cost MDP

3 citations · 6 across the 14 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2025

The Planted Spanning Tree Problem

Mehrdad Moharrami, Cristopher Moore, Jiaming Xu

We study the problem of detecting and recovering a planted spanning tree $M_{n}^{*}$ hidden within a complete, randomly weighted graph $G_{n}$ . Specifically, each edge $e$ has a non-nega…

cs.DS2019★ 1 cited

The Planted Matching Problem: Phase Transitions and Exact Results

Mehrdad Moharrami, Cristopher Moore, Jiaming Xu

We study the problem of recovering a planted matching in randomly weighted complete bipartite graphs $K_{n, n}$ . For some unknown perfect matching $M^{*}$ , the weight of an edge is dr…