Correlation Decay in Random Decision Networks
We consider a decision network on an undirected graph in which each node corresponds to a decision variable, and each node and edge of the graph is associated with a reward function whose value depends only on the variables of the corresponding nodes. The goal is to construct a decision vector that...
Main Authors: | Gamarnik, David, Goldberg, David, Weber, Theophane G. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2019
|
Online Access: | http://hdl.handle.net/1721.1/120938 https://orcid.org/0000-0001-8898-8778 |
Similar Items
-
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
by: Gamarnik, David, et al.
Published: (2012) -
Correlation decay and decentralized optimization in graphical models
by: Weber, Theophane
Published: (2010) -
Correlation decay and the absence of zeros property of partition functions
by: Gamarnik, David
Published: (2022) -
Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections
by: Gamarnik, David, et al.
Published: (2011) -
Right-convergence of sparse random graphs
by: Gamarnik, David
Published: (2014)