Additive hazards regression with random effects for clustered failure times

Additive hazards model with random effects is proposed for modelling the correlated failure time data when focus is on comparing the failure times within clusters and on estimating the correlation between failure times from the same cluster, as well as the marginal regression parameters. Our model features that, when marginalized over the random effect variable, it still enjoys the structure of the additive hazards model. We develop the estimating equations for inferring the regression parameters. The proposed estimators are shown to be consistent and asymptotically normal under appropriate regularity conditions. Furthermore, the estimator of the baseline hazards function is proposed and its asymptotic properties are also established. We propose a class of diagnostic methods to assess the overall fitting adequacy of the additive hazards model with random effects. We conduct simulation studies to evaluate the finite sample behaviors of the proposed estimators in various scenarios. Analysis of the Diabetic Retinopathy Study is provided as an illustration for the proposed method.     

Pulsed-field separation of particles in a microfluidic device

We demonstrate the proof-of-principle of a new separation concept for micrometer-sized particles in a structured microfluidic device. Under the action of externally applied, periodic voltage-pulses two different species of like-charged polystyrene beads are observed to simultaneously migrate into opposite directions. Based on a theoretical model of the particle motion in the microdevice that shows good agreement with the experimental measurements, the underlying separation mechanism is identified and explained. Potential biophysical applications, such as cell sorting, are briefly addressed.     

Nonvertex‐Balanced Factors in Random Graphs

We prove part of a conjecture by Johansson, Kahn, and Vu (Factors in random graphs, Random Struct. Algorithms 33 (2008), 1, 1–28.) regarding threshold functions for the existence of an H‐factor in a random graph . We prove that the conjectured threshold function is correct for any graph H which is not covered by its densest subgraphs. We also demonstrate that the main result of Johansson, Kahn, and Vu (Factors in random graphs, Random Struct. Algorithms 33 (2008), 1, 1–28) generalizes to multigraphs, digraphs, and a multipartite model.     

On independent sets in random graphs

The independence number of a sparse random graph G(n,m) of average degree d = 2m/n is well‐known to be with high probability, with in the limit of large d. Moreover, a trivial greedy algorithm w.h.p. finds an independent set of size , i.e., about half the maximum size. Yet in spite of 30 years of extensive research no efficient algorithm has emerged to produce an independent set with size for any fixed (independent of both d and n). In this paper we prove that the combinatorial structure of the independent set problem in random graphs undergoes a phase transition as the size k of the independent sets passes the point . Roughly speaking, we prove that independent sets of size form an intricately rugged landscape, in which local search algorithms seem to get stuck. We illustrate this phenomenon by providing an exponential lower bound for the Metropolis process, a Markov chain for sampling independent sets. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 436–486, 2015     

Random k‐SAT and the power of two choices

We study an Achlioptas‐process version of the random k‐SAT process: a bounded number of k‐clauses are drawn uniformly at random at each step, and exactly one added to the growing formula according to a particular rule. We prove the existence of a rule that shifts the satisfiability threshold. This extends a well‐studied area of probabilistic combinatorics (Achlioptas processes) to random CSP's. In particular, while a rule to delay the 2‐SAT threshold was known previously, this is the first proof of a rule to shift the threshold of k‐SAT for . We then propose a gap decision problem based upon this semi‐random model. The aim of the problem is to investigate the hardness of the random k‐SAT decision problem, as opposed to the problem of finding an assignment or certificate of unsatisfiability. Finally, we discuss connections to the study of Achlioptas random graph processes. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 163–173, 2015     

Phase behavior in mixtures of a homopolymer and a block copolymer. 4. SALS and SAXS studies

Phase behavior of blends of poly(vinyl methyl ether) (PVME) with four styrene-butadiene-styrene (SBS) triblock copolymers, being of various molecular weights, architecture, and compositions, was investigated by small-angle light scattering. Small-angle X-ray scattering investigation was accomplished for one blend. Low critical solution temperature (LCST) and a unique phase behavior, resembling upper critical solution temperature (UCST), were observed. It was found that the architecture of the copolymer greatly influenced the phase behavior of the blends. Random phase approximation theory was used to calculate the spinodal phase transition curves of the ABA/C and BAB/C systems; LCST and resembling UCST phase behavior were observed as the parameters of the system changed. Qualitatively, the experimental and the theoretical results are consistent with each other. © 1996 John Wiley & Sons, Inc.     

NA序列部分和的矩完全收敛性

讨论了NA序列部分和的矩完全收敛性,在一定条件下获得了NA序列矩完全收敛的充要条件,显示了矩完全收敛和矩条件之间的关系,将独立同分布随机变量序列矩完全收敛的结果推广到NA序列,得到了与独立随机变量序列情形类似的结果.     

保费收入随机化的风险模型

本文推广了龚日朝(2001)的风险模型,把保费随机化,利用鞅方法讨论了保单来到过程与索赔来到过程均为Po isson过程的破产概率.接着又讨论了G erber-Sh iu期望折现函数,推导出了其满足的积分方程,以及L ap lace变换.最后利用随机游动的知识,讨论了当保单来到过程与索赔来到过程为同一更新过程时的破产概率.