Information Network Modeling for U.S. Banking Systemic Risk

In this work we investigate whether information theory measures like mutual information and transfer entropy, extracted from a bank network, Granger cause financial stress indexes like LIBOR-OIS (London Interbank Offered Rate-Overnight Index Swap) spread, STLFSI (St. Louis Fed Financial Stress Index) and USD/CHF (USA Dollar/Swiss Franc) exchange rate. The information theory measures are extracted from a Gaussian Graphical Model constructed from daily stock time series of the top 74 listed US banks. The graphical model is calculated with a recently developed algorithm (LoGo) which provides very fast inference model that allows us to update the graphical model each market day. We therefore can generate daily time series of mutual information and transfer entropy for each bank of the network. The Granger causality between the bank related measures and the financial stress indexes is investigated with both standard Granger-causality and Partial Granger-causality conditioned on control measures representative of the general economy conditions.     

Classical and metallocene catalytic systems: Comparison between the stereochemical mechanisms of α-olefin polymerization

Classical Ziegler-Natta and Kaminsky-Ewen catalysts promoting polymerization of hydrocarbon monomers are compared considering the reactivity and the stereochemical mechanisms of polymerization. It is suggested that also the “active sites” of heterogeneous catalysts could be cationic.     

Effects of Prenatal Exposure to Aflatoxin B1: A Review

Aflatoxins are mycotoxins produced as secondary fungal metabolites. Among them, aflatoxin B1 (AFB1) stands out due to its genotoxic and mutagenic potential, being a potent initiator of carcinogenesis. In this review, the outcomes from the published literature in the past 10 years on the effects of AFB1 pathophysiological mechanisms on embryological and fetal development are discussed. In several animal species, including humans, AFB1 has a teratogenic effect_, resulting in bone malformations, visceral anomalies, lesions in several organs, and behavioral and reproductive changes, in addition to low birth weight. The mutagenic capacity of AFB1 in prenatal life is greater than in adults, indicating that when exposure occurs in the womb, the risk of the development of neoplasms is higher. Studies conducted in humans indicate that the exposure to this mycotoxin during pregnancy is associated with low birth weight, decreased head circumference, and DNA hypermethylation. However, as the actual impacts on humans are still unclear, the importance of this issue cannot be overemphasized and studies on the matter are essential.     

Mechanism of syndiotactic-specific polymerization of styrene

Perusal of literature data and some new results concerning syndiotactic-specific polymerization of styrene suggest a reaction mechanism accounting for the steric control. Key features of the proposed mechanism are stereorigid ηⁿ coordination of the growing chain end and diastereoselective coordination of the monomer imposed by direct interactions with the ancillary ligand of the metal complex, a pseudotetrahedral chiral Ti(III) or Zr(III) cation, which inverts its configuration after every syndiospecific insertion step.     

Separation of mixtures of solvents with wide bore capillary columns connected in series

The gas chromatographic separation of the components of a complex mixture of industrial solvents, not possible on a single stationary phase owing to coelution of some of the compounds, has been achieved on two serially connected wide bore capillary columns of different polarity. The analysis of a mixture of twenty five compounds was optimized using the serial gas chromatography theory of Purnell and Williams. The capacity factors of sample components measured with the two columns coupled in series were found to agree with those predicted by theory, regardless of the order in which they were connected.     

Recognizing Balanceable Matrices

A 0/±1 matrix is balanced if it does not contain a square submatrix with exactly two nonzero entries per row and per column in which the sum of all entries is 2 modulo 4. A 0/1 matrix is balanceable if its nonzero entries can be signed ±1 so that the resulting matrix is balanced. A signing algorithm due to Camion shows that the problems of recognizing balanced 0/±1 matrices and balanceable 0/1 matrices are equivalent. Conforti, Cornuéjols, Kapoor and Vušković gave an algorithm to test if a 0/±1 matrix is balanced. Truemper has characterized balanceable 0/1 matrices in terms of forbidden submatrices. In this paper we give an algorithm that explicitly finds one of these forbidden submatrices or shows that none exists. Received: October 2004     

Nested hierarchies in planar graphs

We construct a partial order relation which acts on the set of 3-cliques of a maximal planar graph G and defines a unique hierarchy. We demonstrate that G is the union of a set of special subgraphs, named ‘bubbles’, that are themselves maximal planar graphs. The graph G is retrieved by connecting these bubbles in a tree structure where neighboring bubbles are joined together by a 3-clique. Bubbles naturally provide the subdivision of G into communities and the tree structure defines the hierarchical relations between these communities.     

Extended formulations in combinatorial optimization

This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By “perfect formulation”, we mean a system of linear inequalities that describes the convex hull of feasible solutions, viewed as vectors. Natural perfect formulations often have a number of inequalities that is exponential in the size of the data needed to describe the problem. Here we are particularly interested in situations where the addition of a polynomial number of extra variables allows a formulation with a polynomial number of inequalities. Such formulations are called “compact extended formulations”. We survey various tools for deriving and studying extended formulations, such as Fourier’s procedure for projection, Minkowski-Weyl’s theorem, Balas’ theorem for the union of polyhedra, Yannakakis’ theorem on the size of an extended formulation, dynamic programming, and variable discretization. For each tool that we introduce, we present one or several examples of how this tool is applied. In particular, we present compact extended formulations for several graph problems involving cuts, trees, cycles and matchings, and for the mixing set, and we present the proof of Fiorini, Massar, Pokutta, Tiwary and de Wolf of an exponential lower bound for the cut polytope. We also present Bienstock’s approximate compact extended formulation for the knapsack problem, Goemans’ result on the size of an extended formulation for the permutahedron, and the Faenza-Kaibel extended formulation for orbitopes.