Cell rotation graphs of strongly connected orientations of plane graphs with an application

The cell rotation graph D(G) on the strongly connected orientations of a 2-edge-connected plane graph G is defined. It is shown that D(G) is a directed forest and every component is an in-tree with one root; if T is a component of D(G), the reversions of all orientations in T induce a component of D(G), denoted by T⁻, thus (T,T⁻) is called a pair of in-trees of D(G); G is Eulerian if and only if D(G) has an odd number of components (all Eulerian orientations of G induce the same component of D(G)); the width and height of T are equal to that of T⁻, respectively. Further it is shown that the pair of directed tree structures on the perfect matchings of a plane elementary bipartite graph G coincide with a pair of in-trees of D(G). Accordingly, such a pair of in-trees on the perfect matchings of any plane bipartite graph have the same width and height.     

Enumeration of Wiener indices in random polygonal chains

The Wiener index of a connected graph (molecule graph) G is the sum of the distances between all pairs of vertices of G, which was reported by Wiener in 1947 and is the oldest topological index related to molecular branching. In this paper, simple formulae of the expected value of the Wiener index in a random polygonal chain and the asymptotic behavior of this expectation are established by solving a difference equation. Based on the results above, we obtain the average value of the Wiener index of all polygonal chains with n polygons. As applications, we use the unified formulae to obtain the expected values of the Wiener indices of some special random polygonal chains which were deeply discussed in the context of organic chemistry or statistical physics.     

The smallest values of algebraic connectivity for trees

The algebraic connectivity of a graph G is the second smallest eigenvalue of its Laplacian matrix. Let ■n be the set of all trees of order n. In this paper, we will provide the ordering of trees in ■n up to the last eight trees according to their smallest algebraic connectivities when n ≥ 13. This extends the result of Shao et al. [The ordering of trees and connected graphs by algebraic connectivity. Linear Algebra Appl., 428, 1421-1438 (2008)].     

Dissipation in Parabolic SPDEs

Journal of Statistical Physics - The study of intermittency for the parabolic Anderson problem usually focuses on the moments of the solution which can describe the high peaks in the probability...     

叶绿素a分子在乙醇溶剂中的瞬态吸收研究

采用飞秒瞬态吸收方法研究叶绿素a分子在乙醇溶液的的激发态性质。观测到叶绿素a的Q带和B_y带的瞬态吸收谱。并且观测到了叶绿素a分子的两个超快动力学过程。认为一个来源于基态吸收谱的非均匀展宽,而另一个则来源于溶剂对于激发态分子结构变化的响应。同时,为了了解叶绿素a在乙醇溶剂中的各相异性,采用405nm激发叶绿素a分子得到了各相异性值为0.143,并通过模拟得到可能的θ_(da)、θ_(db)和η。     

COUPLED VIBRATION OF STRUCTURAL THIN-WALLED CORES

This paper presents an analysis of the coupled vibration of asymmetric core structures in tall buildings. The governing equation of free vibration and its corresponding eigenvalue problem, which is a set of equations for laterally flexural vibrations in two different directions coupled by a warping-St. Venant torsional vibration, are derived. Based on the Calerkin method, a generalized approximate method is developed for the analysis of coupled vibration and thus proposed for determining the natural frequencies and mode shapes of the structure in triply-coupled vibration. The results of the proposed method for the example structure show good agreement with those of the FEM analysis. The proposed method has been shown to provide a simple and rapid, yet accurate, means for coupled vibration analysis of core structures.     

Parallel domain decomposition method for finite element approximation of 3D steady state non‐Newtonian fluids

We introduce a stabilized finite element method for the 3D non‐Newtonian Navier–Stokes equations and a parallel domain decomposition method for solving the sparse system of nonlinear equations arising from the discretization. Non‐Newtonian flow problems are, generally speaking, more challenging than Newtonian flows because the nonlinearities are not only in the convection term but also in the viscosity term, which depends on the shear rate. Many good iterative methods and preconditioning techniques that work well for the Newtonian flows do not work well for the non‐Newtonian flows. We employ a Galerkin/least squares finite element method, with stabilization parameters adjusted to count the non‐Newtonian effect, to discretize the equations, and the resulting highly nonlinear system of equations is solved by a Newton–Krylov–Schwarz algorithm. In this study, we apply the proposed method to some inelastic power‐law fluid flows through the eccentric annuli with inner cylinder rotation and investigate the robustness of the method with respect to some physical parameters, including the power‐law index and the Reynolds number ratios. We then report the superlinear speedup achieved by the domain decomposition algorithm on a computer with up to 512 processors. Copyright © 2015 John Wiley & Sons, Ltd.     

The strong chromatic index of complete cubic Halin graphs

A complete cubic Halin graph is a cubic Halin graph whose characteristic tree is a complete cubic tree, in which all leaves are at the same distance from the root vertex. In this work, we determine the strong chromatic index of the complete cubic Halin graph.     

An elementary approach to discrete models of dividend strategies

The paper studies a discrete counterpart of Gerber et al. (2006). The surplus of an insurance company (before dividends) is modeled as a time-homogeneous Markov chain with possible changes of size +1,0,−1,−2,−3,…. If a barrier strategy is applied for paying dividends, it is shown that the dividends-penalty identity holds. The identity expresses the expected present value of a penalty at ruin in terms of the expected discounted dividends until ruin and the expected present value of the penalty at ruin if no dividends are paid. For the problem of maximizing the difference between the expected discounted dividends until ruin and the expected present value of the penalty at ruin, barrier strategies play a prominent role. In some cases an optimal dividend barrier exists. The paper discusses in detail the special case where the distribution of the change in surplus does not depend on the current surplus (so that in the absence of dividends the surplus process has independent increments). A closed-form result for zero initial surplus is given, and it is shown how the relevant quantities can be calculated recursively. Finally, it is shown how optimal dividend strategies can be determined; typically, they are band strategies.