{"id":"https://openalex.org/W2166781102","doi":"https://doi.org/10.1109/isit.2011.6033945","title":"A factor-graph approach to Lagrangian and Hamiltonian dynamics","display_name":"A factor-graph approach to Lagrangian and Hamiltonian dynamics","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2166781102","doi":"https://doi.org/10.1109/isit.2011.6033945","mag":"2166781102"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2011.6033945","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-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/A5028154201","display_name":"Pascal O. Vontobel","orcid":"https://orcid.org/0000-0002-6180-258X"},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pascal O. Vontobel","raw_affiliation_strings":["Hewlett-Packard Laboratories, Palo Alto, CA, USA"],"affiliations":[{"raw_affiliation_string":"Hewlett-Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028154201"],"corresponding_institution_ids":["https://openalex.org/I1324840837"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.21172451,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2183","last_page":"2187"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9958999752998352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.9170336723327637},{"id":"https://openalex.org/keywords/noethers-theorem","display_name":"Noether's theorem","score":0.5084820985794067},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5081074237823486},{"id":"https://openalex.org/keywords/graph-product","display_name":"Graph product","score":0.5058300495147705},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.48737865686416626},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.4087616205215454},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40476590394973755},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3789498209953308},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.345445454120636},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3371257483959198},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32187849283218384},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.31675535440444946},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30807700753211975},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.28687170147895813},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2465803027153015},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1938459277153015},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.10608160495758057}],"concepts":[{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.9170336723327637},{"id":"https://openalex.org/C80892491","wikidata":"https://www.wikidata.org/wiki/Q578555","display_name":"Noether's theorem","level":3,"score":0.5084820985794067},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5081074237823486},{"id":"https://openalex.org/C68103157","wikidata":"https://www.wikidata.org/wiki/Q569347","display_name":"Graph product","level":5,"score":0.5058300495147705},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.48737865686416626},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.4087616205215454},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40476590394973755},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3789498209953308},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.345445454120636},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3371257483959198},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32187849283218384},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.31675535440444946},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30807700753211975},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.28687170147895813},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2465803027153015},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1938459277153015},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.10608160495758057}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2011.6033945","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1552736770","https://openalex.org/W1566504877","https://openalex.org/W1569339351","https://openalex.org/W1579723584","https://openalex.org/W2052963087","https://openalex.org/W2089745384","https://openalex.org/W2095702447","https://openalex.org/W2099111195","https://openalex.org/W2107026734","https://openalex.org/W2137813581","https://openalex.org/W2138628599","https://openalex.org/W2139584447","https://openalex.org/W2146294081","https://openalex.org/W2150859678","https://openalex.org/W2171516545","https://openalex.org/W2206699232","https://openalex.org/W2296319761","https://openalex.org/W4250589301","https://openalex.org/W4253098088"],"related_works":["https://openalex.org/W3098702604","https://openalex.org/W1984461052","https://openalex.org/W4245538580","https://openalex.org/W1642020521","https://openalex.org/W1588195705","https://openalex.org/W2171516545","https://openalex.org/W2287975650","https://openalex.org/W2166781102","https://openalex.org/W4252544247","https://openalex.org/W1584025773"],"abstract_inverted_index":{"Factor":[0],"graphs":[1,52,77,110],"are":[2,100],"graphical":[3],"models":[4],"with":[5],"origins":[6],"in":[7,33],"coding":[8],"theory.":[9],"The":[10,58,74],"sum-product,":[11],"the":[12,15,45,62,69,86,95],"max-product,":[13],"and":[14,37,55,121],"min-sum":[16],"algorithms,":[17],"which":[18],"operate":[19],"by":[20],"message":[21],"passing":[22],"on":[23],"a":[24,28,79],"factor":[25,51,76,109],"graph,":[26],"subsume":[27],"great":[29],"variety":[30],"of":[31,47,50,64,71,94,97],"algorithms":[32],"coding,":[34],"signal":[35],"processing,":[36],"artificial":[38],"intelligence.":[39],"This":[40],"paper":[41],"aims":[42],"at":[43],"extending":[44],"field":[46],"possible":[48],"applications":[49],"to":[53,102,112,123],"Lagrangian":[54],"Hamiltonian":[56],"dynamics.":[57],"starting":[59],"point":[60],"is":[61],"principle":[63,70],"least":[65],"action":[66],"(more":[67],"precisely,":[68],"stationary":[72],"action).":[73],"resulting":[75],"require":[78],"new":[80],"message-passing":[81],"algorithm":[82,99],"that":[83],"we":[84],"call":[85],"stationary-sum":[87],"algorithm.":[88],"As":[89],"it":[90],"turns":[91],"out,":[92],"some":[93],"properties":[96],"this":[98],"equivalent":[101],"Liouville's":[103],"theorem.":[104,116],"Moreover,":[105],"duality":[106],"results":[107],"for":[108],"allow":[111],"easily":[113],"derive":[114],"Noether's":[115],"We":[117],"also":[118],"discuss":[119],"connections":[120],"differences":[122],"Kalman":[124],"filtering.":[125]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}