Search

In many real world problems it is of interest to ascertain which factors are most relevant for determining a given outcome. This is the so-called variable selection problem. The present paper proposes a new regression model for its solution. We show that the proposed model satisfies continuity, sparsity, and unbiasedness properties. A generalized Krylov subspace method for the practical solution of the minimization problem involved is described. This method can be used for the solution of both small-scale and large-scale problems. Several computed examples illustrate the good performance of the proposed model. We place special focus on screening studies using saturated and supersaturated experimental designs. [ABSTRACT FROM AUTHOR]

One of the properties of interest in the analysis of networks is global communicability , i.e., how easy or difficult it is, generally, to reach nodes from other nodes by following edges. Different global communicability measures provide quantitative assessments of this property, emphasizing different aspects of the problem. This paper investigates the sensitivity of global measures of communicability to local changes. In particular, for directed, weighted networks, we study how different global measures of communicability change when the weight of a single edge is changed; or, in the unweighted case, when an edge is added or removed. The measures we study include the total network communicability , based on the matrix exponential of the adjacency matrix, and the Perron network communicability , defined in terms of the Perron root of the adjacency matrix and the associated left and right eigenvectors. Finding what local changes lead to the largest changes in global communicability has many potential applications, including assessing the resilience of a system to failure or attack, guidance for incremental system improvements, and studying the sensitivity of global communicability measures to errors in the network connection data. [ABSTRACT FROM AUTHOR]