Maximum Entropy Distributions with Applications to Graph Simulation

DOI10.1287/OPRE.2022.2323MaRDI QIDQ6195087zbMATH OpenOpenAlexWikidataFDO

Authors Paul Glasserman

Publication date 12 March 2024

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.2022.2323

zbMATH Keywords

maximum entropyexponential familiesgraph simulationmax-min probabilities

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Unbiased sampling of network ensembles
• Uniform sampling of directed and undirected graphs conditional on vertex connectivity
• Entropy, optimization and counting
• Uniform sampling of bipartite graphs with degrees in prescribed intervals
• A sequential importance sampling algorithm for generating random graphs with prescribed degrees

Cited in

(1)

• Existence and applications of finite-population samples that are exactly balanced

This page was built for publication: Maximum Entropy Distributions with Applications to Graph Simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6195087)