◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Bayati

27 papers hereh-index 398.5k citations156 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author13
  • middle author5
  • last author9

Across the 27 of 27 papers where every author was matched, so the position is known.

fields
  • cs.LG8
  • stat.ML4
  • cs.GT2
  • cs.IT2
  • econ.EM2
  • math.PR2
same name
  • M. Bayati — 10 papers, h 3
  • M. Bayati — 1 paper, h 22
  • M. Bayati — 1 paper, h 5

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20052023
most citedMaximum Weight Matching via Max-Product Belief Propagation

228 citations · 798 across the 24 of their papers we have counts for

collaborators
Showing 2009Show all

4 papers · 1 filter

math.PR2009★ 89 cited

Combinatorial approach to the interpolation method and scaling limits in sparse random graphs

Mohsen Bayati, David Gamarnik, Prasad Tetali

We establish the existence of free energy limits for several combinatorial models on Erdös-Rényi graph G(N,⌊cN⌋) and random r-regular graph $\mathbb {G}(…

cs.GT2009★ 16 cited

A Natural Dynamics for Bargaining on Exchange Networks

Yashodhan Kanoria, Mohsen Bayati, Christian Borgs +2

Bargaining networks model the behavior of a set of players that need to reach pairwise agreements for making profits. Nash bargaining solutions are special outcomes of such games t…

math.OC2009★ 1 cited

Message Passing Algorithms for Sparse Network Alignment

Mohsen Bayati, David F. Gleich, Amin Saberi +1

Network alignment generalizes and unifies several approaches for forming a matching or alignment between the vertices of two graphs. We study a mathematical programming framework f…

cond-mat.stat-mech2009★ 24 cited

A rigorous analysis of the cavity equations for the minimum spanning tree

M. Bayati, A. Braunstein, R. Zecchina

We analyze a new general representation for the Minimum Weight Steiner Tree (MST) problem which translates the topological connectivity constraint into a set of local conditions wh…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.