{"id":"https://openalex.org/W2098387242","doi":"https://doi.org/10.1109/18.910585","title":"On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs","display_name":"On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2098387242","doi":"https://doi.org/10.1109/18.910585","mag":"2098387242"},"language":"en","primary_location":{"id":"doi:10.1109/18.910585","is_oa":false,"landing_page_url":"https://doi.org/10.1109/18.910585","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079364492","display_name":"Yaakov Weiss","orcid":"https://orcid.org/0000-0003-4240-7303"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Y. Weiss","raw_affiliation_strings":["Computer Science Division, University of California Berkeley, Berkeley, CA, USA","Comput. Sci. Div., California Univ., Berkeley, CA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Division, University of California Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Comput. Sci. Div., California Univ., Berkeley, CA, USA#TAB#","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074429265","display_name":"William T. Freeman","orcid":"https://orcid.org/0000-0002-2231-7995"},"institutions":[{"id":"https://openalex.org/I4210159266","display_name":"Mitsubishi Electric (United States)","ror":"https://ror.org/053jnhe44","country_code":"US","type":"company","lineage":["https://openalex.org/I1306287861","https://openalex.org/I4210133125","https://openalex.org/I4210159266"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"W.T. Freeman","raw_affiliation_strings":["Mitsubishi Electric Research Laboratories, MERL, Cambridge, MA, USA","Mitsubishi Electric Research Labs (MERL), Cambridge MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mitsubishi Electric Research Laboratories, MERL, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210159266"]},{"raw_affiliation_string":"Mitsubishi Electric Research Labs (MERL), Cambridge MA, USA","institution_ids":["https://openalex.org/I4210159266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":11.7321,"has_fulltext":false,"cited_by_count":597,"citation_normalized_percentile":{"value":0.98548345,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"47","issue":"2","first_page":"736","last_page":"744"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5888441205024719},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.5246468186378479},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5036315321922302},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.4816274046897888},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4621245861053467},{"id":"https://openalex.org/keywords/graphical-model","display_name":"Graphical model","score":0.4396359920501709},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42187047004699707},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.41804295778274536},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3580244183540344},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2712145745754242}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5888441205024719},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.5246468186378479},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5036315321922302},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.4816274046897888},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4621245861053467},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.4396359920501709},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42187047004699707},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.41804295778274536},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3580244183540344},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2712145745754242},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/18.910585","is_oa":false,"landing_page_url":"https://doi.org/10.1109/18.910585","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.1753","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.1753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ai.mit.edu/people/wtf/papers/maxprodieeefinal.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.36.6623","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.6623","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/~yweiss/maxprodieee2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W7241855","https://openalex.org/W34792075","https://openalex.org/W1541212367","https://openalex.org/W1545148916","https://openalex.org/W1560512119","https://openalex.org/W1570973162","https://openalex.org/W1600397135","https://openalex.org/W1808875461","https://openalex.org/W2020999234","https://openalex.org/W2026129786","https://openalex.org/W2103028698","https://openalex.org/W2128765501","https://openalex.org/W2130178369","https://openalex.org/W2135764410","https://openalex.org/W2137813581","https://openalex.org/W2149760002","https://openalex.org/W2153758647","https://openalex.org/W2158122241","https://openalex.org/W2159080219","https://openalex.org/W2163518744","https://openalex.org/W2164419438","https://openalex.org/W2171265988","https://openalex.org/W2175160295","https://openalex.org/W4256646823","https://openalex.org/W4300188436","https://openalex.org/W4388323202","https://openalex.org/W6633434192"],"related_works":["https://openalex.org/W4368755698","https://openalex.org/W3180766726","https://openalex.org/W2963553740","https://openalex.org/W2326292785","https://openalex.org/W4296580373","https://openalex.org/W3152713649","https://openalex.org/W3009052662","https://openalex.org/W2011528978","https://openalex.org/W2489631182","https://openalex.org/W2158122241"],"abstract_inverted_index":{"Graphical":[0],"models,":[1],"such":[2],"as":[3],"Bayesian":[4],"networks":[5],"and":[6,109,143],"Markov":[7],"random":[8],"fields":[9],"(MRFs),":[10],"represent":[11],"statistical":[12],"dependencies":[13],"of":[14,66,99,118,135,166,173,208],"variables":[15,69],"by":[16,80],"a":[17,25,37,45,52,129,138,159,163,187,215],"graph.":[18,220],"The":[19,194],"max-product":[20,83,120,136,175,203],"\"belief":[21],"propagation\"":[22],"algorithm":[23,27,84,121],"is":[24,32,44,51,162,177,226],"local-message-passing":[26],"on":[28,57,90,122,131,137,158],"this":[29,224],"graph":[30,43,50,139],"that":[31,154,192,199,210],"known":[33],"to":[34,36,179],"converge":[35],"unique":[38],"fixed":[39,59,133,160],"point":[40,60,161],"when":[41,48],"the":[42,49,54,58,62,67,71,82,86,97,119,132,155,167,170,174,202,219,231],"tree.":[46],"Furthermore,":[47],"tree,":[53],"assignment":[55,156,176,204],"based":[56,157],"yields":[61],"most":[63],"probable":[64],"values":[65],"unobserved":[68],"given":[70],"observed":[72],"ones.":[73],"Good":[74],"empirical":[75],"performance":[76],"has":[77,113],"been":[78,114],"obtained":[79],"running":[81],"(or":[85],"equivalent":[87],"min-sum":[88],"algorithm)":[89],"graphs":[91,106,123],"with":[92,124,140,144,233],"loops,":[93],"for":[94,103],"applications":[95],"including":[96],"decoding":[98],"\"turbo\"":[100],"codes.":[101],"Except":[102],"two":[104],"simple":[105],"(cycle":[107],"codes":[108],"single-loop":[110],"graphs)":[111],"there":[112],"little":[115],"theoretical":[116],"understanding":[117],"loops.":[125],"Here":[126],"we":[127],"prove":[128],"result":[130],"points":[134],"arbitrary":[141,145],"topology":[142],"probability":[146,172],"distributions":[147],"(discrete-":[148],"or":[149],"continuous-valued":[150],"nodes).":[151],"We":[152,229],"show":[153],"\"neighborhood":[164],"maximum\"":[165],"posterior":[168,171],"probability:":[169],"guaranteed":[178],"be":[180],"greater":[181],"than":[182,214],"all":[183,197],"other":[184],"assignments":[185,198],"in":[186,205,218],"particular":[188],"large":[189],"region":[190,195],"around":[191],"assignment.":[193],"includes":[196],"differ":[200],"from":[201],"any":[206],"subset":[207],"nodes":[209],"form":[211],"no":[212],"more":[213],"single":[216],"loop":[217],"In":[221],"some":[222],"graphs,":[223],"neighborhood":[225],"exponentially":[227],"large.":[228],"illustrate":[230],"analysis":[232],"examples.":[234]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":38},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":23},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":18},{"year":2017,"cited_by_count":29},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":27},{"year":2014,"cited_by_count":28},{"year":2013,"cited_by_count":40},{"year":2012,"cited_by_count":44}],"updated_date":"2026-06-20T22:02:38.213706","created_date":"2025-10-10T00:00:00"}