Synthesis of highly sulfonated poly(arylene ether sulfone) random (statistical) copolymers via direct polymerization

Novel biphenol‐based wholly aromatic poly (arylene ether sulfones) containing pendant sulfonate groups were prepared by direct aromatic nucleophilic substitution polycondensation of disodium 3,3′‐disulfonate‐4,4′‐dichlorodiphenyl sulfone (SDCDPS), 4,4′‐dichlorodiphenylsulfone (DCDPS) and biphenol. Copolymerization proceeded quantitatively to high molecular weight in N‐methyl‐2‐pyrrolidinone at 190°C in the presence of anhydrous potassium carbonate. Tough membranes were successfully cast from the control and the copolymers, which had a SDCDPS/DCDPS mole ratio of either 40:60 or 60:40 using N,N‐dimethylactamide; the 100% SDCDPS homopolymer was water soluble. Short‐term aging (30 min) indicates that the desired acid form membranes are stable to 220°C in air and conductivity values at 25°C of 0.110 (40%) and 0.170 S/cm (60%) were measured, which are comparable to or higher than the state‐of‐the art fluorinated copolymer Nafion 1135 control. The new copolymers, which contain ion conductivity sites on deactivated rings, are candidates as new polymeric electrolyte materials for proton exchange membrane (PEM) fuel cells. Further research comparing their membrane behavior to post‐sulfonated systems is in progress.     

水溶性聚合物和两亲聚合物:12.环氧乙烷-环氧丙烷无规共聚醚结构与性能的关系

来用连续加料法,以二元醇-KOH为引发剂合成一组不同组成的环氧乙烷-环氧丙烷无规共聚醚,并用核磁共振、红外光谱、示差扫描量热计和热失重等方法对其本体聚合物,用浊点和表面张力测定的方法对其水溶液,进行系统的表征。     

Utility maximization problem with random endowment and transaction costs: when wealth may become negative

In this article, we study the problem of maximizing expected utility from the terminal wealth with proportional transaction costs and random endowment. In the context of the existence of consistent price systems, we consider the duality between the primal utility maximization problem and the dual one, which is set up on the domain of finitely additive measures. In particular, we prove duality results for utility functions supporting possibly negative values. Moreover, we construct a shadow market by the dual optimal process and consider the utility-based pricing for random endowment.     

The valuation of life contingencies: A symmetrical triangular fuzzy approximation

This paper extends the framework for the valuation of life insurance policies and annuities by Andrés-Sánchez and González-Vila (2012, 2014) in two ways. First we allow various uncertain magnitudes to be estimated by means of fuzzy numbers. This applies not only to interest rates but also to the amounts to be paid out by the insurance company. Second, the use of symmetrical triangular fuzzy numbers allows us to obtain expressions for the pricing of life contingencies and their variability that are closely linked to standard financial and actuarial mathematics. Moreover, they are relatively straightforward to compute and understand from a standard actuarial point of view.     

Hierarchical Archimedean copulas through multivariate compound distributions

In this paper, we propose a new hierarchical Archimedean copula construction based on multivariate compound distributions. This new imbrication technique is derived via the construction of a multivariate exponential mixture distribution through compounding. The absence of nesting and marginal conditions, contrarily to the nested Archimedean copulas approach, leads to major advantages, such as a flexible range of possible combinations in the choice of distributions, the existence of explicit formulas for the distribution of the sum, and computational ease in high dimensions. A balance between flexibility and parsimony is targeted. After presenting the construction technique, properties of the proposed copulas are investigated and illustrative examples are given. A detailed comparison with other construction methodologies of hierarchical Archimedean copulas is provided. Risk aggregation under this newly proposed dependence structure is also examined.     

Finding Adam in random growing trees

We investigate algorithms to find the first vertex in large trees generated by either the uniform attachment or preferential attachment model. We require the algorithm to output a set of K vertices, such that, with probability at least , the first vertex is in this set. We show that for any ε, there exist such algorithms with K independent of the size of the input tree. Moreover, we provide almost tight bounds for the best value of K as a function of ε. In the uniform attachment case we show that the optimal K is subpolynomial in , and that it has to be at least superpolylogarithmic. On the other hand, the preferential attachment case is exponentially harder, as we prove that the best K is polynomial in . We conclude the paper with several open problems. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 158–172, 2017     

On random k‐out subgraphs of large graphs

We consider random subgraphs of a fixed graph with large minimum degree. We fix a positive integer k and let G_k be the random subgraph where each independently chooses k random neighbors, making kn edges in all. When the minimum degree then G_k is k‐connected w.h.p. for ; Hamiltonian for k sufficiently large. When , then G_k has a cycle of length for . By w.h.p. we mean that the probability of non‐occurrence can be bounded by a function (or ) where . © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 143–157, 2017     

On martingale tail sums for the path length in random trees

For a martingale (X_n) converging almost surely to a random variable X, the sequence (X_n– X) is called martingale tail sum. Recently, Neininger (Random Structures Algorithms 46 (2015), 346–361) proved a central limit theorem for the martingale tail sum of Régnier's martingale for the path length in random binary search trees. Grübel and Kabluchko (in press) gave an alternative proof also conjecturing a corresponding law of the iterated logarithm. We prove the central limit theorem with convergence of higher moments and the law of the iterated logarithm for a family of trees containing binary search trees, recursive trees and plane‐oriented recursive trees. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 493–508, 2017     

Eigenvalue confinement and spectral gap for random simplicial complexes

We consider the adjacency operator of the Linial‐Meshulam model for random simplicial complexes on n vertices, where each d‐cell is added independently with probability p to the complete ‐skeleton. Under the assumption , we prove that the spectral gap between the smallest eigenvalues and the remaining eigenvalues is with high probability. This estimate follows from a more general result on eigenvalue confinement. In addition, we prove that the global distribution of the eigenvalues is asymptotically given by the semicircle law. The main ingredient of the proof is a Füredi‐Komlós‐type argument for random simplicial complexes, which may be regarded as sparse random matrix models with dependent entries. © 2017 Wiley Periodicals, Inc. Random Struct. Alg., 51, 506–537, 2017     

Estimation of frequency by random sampling

Summary We consider the estimation of frequency ω of a sinusoidal oscillation contaminated by a stationary noise under a random sampling scheme according to a stationary point processN. We prove the strong consistency and the asymptotic normality for a certain estimator of ω. Then we apply these results to the case whereN is a stationary delayed renewal process.