Analysis and Reduction of Complex Networks Under Uncertainty.

Ghanem, Roger G¹ 

[1] University of Southern California

关键词: Uncertainty Quantification;    Networks;    Polynomial Chaos;    Random Matrix;    Random Eigenvalue;    Markov Chains.;   

DOI  :  10.2172/1148680
RP-ID  :  DOE-USC-SC0003452
PID  :  OSTI ID: 1148680

学科分类：数学（综合）

美国|英语

来源: SciTech Connect

【 摘 要 】

This effort was a collaboration with Youssef Marzouk of MIT, Omar Knio of Duke University (at the time at Johns Hopkins University) and Habib Najm of Sandia National Laboratories. The objective of this effort was to develop the mathematical and algorithmic capacity to analyze complex networks under uncertainty. Of interest were chemical reaction networks and smart grid networks. The statements of work for USC focused on the development of stochastic reduced models for uncertain networks. The USC team was led by Professor Roger Ghanem and consisted of one graduate student and a postdoc. The contributions completed by the USC team consisted of 1) methodology and algorithms to address the eigenvalue problem, a problem of significance in the stability of networks under stochastic perturbations, 2) methodology and algorithms to characterize probability measures on graph structures with random flows. This is an important problem in characterizing random demand (encountered in smart grid) and random degradation (encountered in infrastructure systems), as well as modeling errors in Markov Chains (with ubiquitous relevance !). 3) methodology and algorithms for treating inequalities in uncertain systems. This is an important problem in the context of models for material failure and network flows under uncertainty where conditions of failure or flow are described in the form of inequalities between the state variables.