Abstract
In this work, we consider the minimum-risk maximum clique problem on stochastic graphs. Namely, assuming that each vertex of the graph is associated with a random variable describing a cost or a loss, such that the joint distribution of all variables on the graph is known, the goal is to determine a clique in the graph that has the lowest risk, given a specific risk measure. It is shown that in the developed problem formulation, minimization of risk is facilitated through inclusion of additional vertices in the partial solution, whereby an optimal solution represents a maximal clique in the graph. In particular, two instances of risk-averse maximum clique problems are considered, where risk exposures of a graph’s vertices are “isolated” (i.e., not dependent on risk profiles of other vertices) and “neighbor-dependent,” or dependent on the risk profiles of adjacent vertices. Numerical experiments on randomly generated Erdos–Renyi demonstrating properties of optimal risk-averse maximum cliques are conducted.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Aneja YP, Chandrasekaran R, Nair KPK (2001) Maximizing residual flow under an arc destruction. Networks 38(4):194–198
Artzner P, Delbaen F, Eber F, and Heath (1999) Coherent measures of risk. Mathematical Finance 9(3): 203–228
Atamturk A, Zhang M (2007) Two-stage robust network flow and design under demand uncertainty. Operations Research 55(4): 662–673
Boginski V, Commander C, Turko T (2009) Polynomial-time identification of robust network flows under uncertain arc failures. Optimization Letters 3(3):461–473
Delbaen F (2002) Coherent risk measures on general probability spaces. In: Sandmann K, Schonbucher PJ (Eds.), Advances in Finance and Stochastics: Essay in Honour of Dieter Sondermann. Springer, pp. 1–37
Erdös P, Rényi A (1960) On the Evolution of Random Graphs. Publication of the Mathematical Institute of the Hungarian Academy of Sciences 5:17–61
Glockner GD, Nemhauser GL (2000) A dynamic network flow problem with uncertain arc capacities: formulation and problem structure. Operations Research 48(2): 233–242
Krokhmal P (2007) Higher moment risk measures. Quantitative Finance 7(4): 77–91
Krokhmal P, Zabarankin M, Uryasev S (2011) Modeling and optimization of risk. Surveys in Operations Research and Management Science 16(2): 49–66.
Rockafellar R, Uryasev S (2000) Optimization of conditional value-at-risk. Journal of Risk 2: 21–41
Rockafellar R, Uryasev S (2002) Conditional value-at-risk for general loss distributions. Journal of Banking and Finance 26(7): 1443–1471
Sorokin A, Boginski V, Nahapetyan A et al (2011) Computational risk management techniques for fixed charge network flow problems with uncertain arc failures. J Comb Optim, doi: 10.1007/s1087801194222
Ukkusuri S, Mathew T (2007) Robust transportation network design under demand uncertainty. Computer-Aided Civil and Infrastructure Engineering 22: 6–18
Verweij B, Ahmed S, Kleywegt AJ et al (2003) The sample average approximation method applied to stochastic routing problems: a computational study. Journal Computational Optimization and Applications 24(2–3): 289–333
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this paper
Cite this paper
Rysz, M., Krokhmal, P.A., Pasiliao, E.L. (2013). Minimum-Risk Maximum Clique Problem. In: Sorokin, A., Pardalos, P. (eds) Dynamics of Information Systems: Algorithmic Approaches. Springer Proceedings in Mathematics & Statistics, vol 51. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7582-8_8
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7582-8_8
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-7581-1
Online ISBN: 978-1-4614-7582-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)