A Stochastic Subgradient Method for Distributionally Robust Non-convex and Non-smooth Learning

Journal of Optimization Theory and Applications - We consider a distributionally robust formulation of stochastic optimization problems arising in statistical learning, where robustness is with...     

The character and the wave front set correspondence in the stable range

We relate the distribution characters and the wave front sets of unitary representation for real reductive dual pairs of type I in the stable range.     

Synthesis and Properties of Azoles and Their Derivatives. Part 70. Nitroallylic Systems in [2 + 3] Cycloaddition Reactions with Nitrones: A DFT Computational Study

The analysis of electrophilicity indexes and the results of potential energy surface (PES) simulations for the reaction pathways proved that the [2 + 3] cycloadditions of nitroallylic systems with nitrones should be considered nonpolar reactions. Our simulations proved that the reactions always proceed via a one‐step mechanism through a prereaction complex. Although the symmetry of respective transition states is quite varied, their polarity is low and does not change when a polar medium is introduced to the reaction environment. When the polarity of the reaction medium increases, the kinetic pathway preference does not change. The regiochemistry of the cycloadditions tested may, however, be controlled to some extent by steric effects.     

Space-Time Directional Lyapunov Exponents for Cellular Automata

Space-time directional Lyapunov exponents are introduced. They describe the maximal velocity of propagation to the right or to the left of fronts of perturbations in a frame moving with a given velocity. The continuity of these exponents as function of the velocity and an inequality relating them to the directional entropy is proved.     

Stability of vertices in random boolean cellular automata

Based on computer simulations, Kauffman (Physica D, 10, 145-156, 1984) made several generalizations about a random Boolean cellular automaton which he invented as a model of cellular metabolism. Here we give the first rigorous proofs of two of Kauffman's generalizations: a large fraction of vertices stabilize quickly, consequently the length of cycles in the automaton's behavior is small compared to that of a random mapping with the same number of states; and reversal of the states of a large fraction of the vertices does not affect the cycle to which the automaton moves.     

Cycles in a random graph near the critical point

Let G(n, M) be a graph chosen at random from the family of all labelled graphs with n vertices and M(n) = 0.5n + s(n) edges, where s³(n)n^?2→∞ but s(n) = o(n). We find the limit distribution of the length of shortest cycle contained in the largest component of G(n, M), as well as of the longest cycle outside it. We also describe the block structure of G(n, M) and derive from this result the limit probability that G(n, M) contains a cycle with a diagonal. Finally, we show that the probability tending to 1 as n-→∞ the length of the longest cycle in G(n, M) is of the order s²(n)/n.