Networks of phase oscillators are studied in various contexts, in particular in the modeling of the electric power grid. A functional grid corresponds to a stable steady state, such that any bifurcation can have catastrophic consequences up to a blackout. But also the existence of multiple steady states is undesirable, as it can lead to sudden transitions or circulatory flows. Despite the enormous practical importance there is still no general theory of the existence and uniqueness of steady states in such systems. Analytic results are mostly limited to grids without Ohmic losses. In this article, we introduce a method to systematically construct the solutions of the real power load-flow equations in the presence of Ohmic losses and explicitly compute them for tree and ring networks. We investigate different mechanisms leading to multistability and discuss the impact of Ohmic losses on the existence of solutions.The stable operation of the electric power grid relies on a precisely synchronized state of all generators and machines. All machines rotate at exactly the same frequency with fixed phase differences, leading to steady power flows throughout the grid. Whether such a steady state exists for a given network is of eminent practical importance. The loss of a steady state typically leads to power outages up to a complete blackout. But also the existence of multiple steady states is undesirable, as it can lead to sudden transitions, circulating flows and eventually also to power outages. Steady states are typically calculated numerically, but this approach gives only limited insight into the existence and (non-)uniqueness of steady states. Analytic results are available only for special network configuration, in particular for grids with negligible Ohmic losses or radial networks without any loops. In this article, we introduce a method to systematically construct the solutions of the real power loadflow equations in the presence of Ohmic losses. We calculate the steady states explicitly for elementary networks demonstrating different mechanisms leading to multistability. Our results also apply to models of coupled oscillators which are widely used in theoretical physics and mathematical biology.

No abstract

In Genetics, gene sets are grouped in collections concerning their biological function. This often leads to high-dimensional, overlapping, and redundant families of sets, thus precluding a straightforward interpretation of their biological meaning. In Data Mining, it is often argued that techniques to reduce the dimensionality of data could increase the maneuverability and consequently the interpretability of large data. In the past years, moreover, we witnessed an increasing consciousness of the importance of understanding data and interpretable models in the machine learning and bioinformatics communities. On the one hand, there exist techniques aiming to aggregate overlapping gene sets to create larger pathways. While these methods could partly solve the large size of the collections’ problem, modifying biological pathways is hardly justifiable in this biological context. On the other hand, the representation methods to increase interpretability of collections of gene sets that have been proposed so far have proved to be insufficient. Inspired by this Bioinformatics context, we propose a method to rank sets within a family of sets based on the distribution of the singletons and their size. We obtain sets’ importance scores by computing Shapley values; Making use of microarray games, we do not incur the typical exponential computational complexity. Moreover, we address the challenge of constructing redundancy-aware rankings where, in our case, redundancy is a quantity proportional to the size of intersections among the sets in the collections. We use the obtained rankings to reduce the dimension of the families, therefore showing lower redundancy among sets while still preserving a high coverage of their elements. We finally evaluate our approach for collections of gene sets and apply Gene Sets Enrichment Analysis techniques to the now smaller collections: As expected, the unsupervised nature of the proposed rankings allows for unremarkable differences in the number of significant gene sets for specific phenotypic traits. In contrast, the number of performed statistical tests can be drastically reduced. The proposed rankings show a practical utility in bioinformatics to increase interpretability of the collections of gene sets and a step forward to include redundancy-awareness into Shapley values computations.

No abstract