The size of the giant high‐order component in random hypergraphs

The phase transition in the size of the giant component in random graphs is one of the most well‐studied phenomena in random graph theory. For hypergraphs, there are many possible generalizations of the notion of a connected component. We consider the following: two j‐sets (sets of j vertices) are j‐connected if there is a walk of edges between them such that two consecutive edges intersect in at least j vertices. A hypergraph is j‐connected if all j‐sets are pairwise j‐connected. In this paper, we determine the asymptotic size of the unique giant j‐connected component in random k‐uniform hypergraphs for any and .     

On MAXCUT in strictly supercritical random graphs,and coloring of random graphs and random tournaments

We use a theorem by Ding, Lubetzky, and Peres describing the structure of the giant component of random graphs in the strictly supercritical regime, in order to determine the typical size of MAXCUT of in terms of ɛ. We then apply this result to prove the following conjecture by Frieze and Pegden. For every , there exists such that w.h.p. is not homomorphic to the cycle on vertices. We also consider the coloring properties of biased random tournaments. A p‐random tournament on n vertices is obtained from the transitive tournament by reversing each edge independently with probability p. We show that for the chromatic number of a p‐random tournament behaves similarly to that of a random graph with the same edge probability. To treat the case we use the aforementioned result on MAXCUT and show that in fact w.h.p. one needs to reverse edges to make it 2‐colorable.     

Gibbs partitions: The convergent case

We study Gibbs partitions that typically form a unique giant component. The remainder is shown to converge in total variation toward a Boltzmann‐distributed limit structure. We demonstrate how this setting encompasses arbitrary weighted assemblies of tree‐like combinatorial structures. As an application, we establish smooth growth along lattices for small block‐stable classes of graphs. Random graphs with n vertices from such classes are shown to form a giant connected component. The small fragments may converge toward different Poisson Boltzmann limit graphs, depending along which lattice we let n tend to infinity. Since proper addable minor‐closed classes of graphs belong to the more general family of small block‐stable classes, this recovers and generalizes results by McDiarmid (2009).     

Reliability modelling incorporating load share and frailty

The stochastic behaviour of lifetimes of a two component system is often primarily influenced by the system structure and by the covariates shared by the components. Any meaningful attempt to model the lifetimes must take into consideration the factors affecting their stochastic behaviour. In particular, for a load share system, we describe a reliability model incorporating both the load share dependence and the effect of observed and unobserved covariates. The model includes a bivariate Weibull to characterize load share, a positive stable distribution to describe frailty, and also incorporates effects of observed covariates. We investigate various interesting reliability properties of this model using cross ratio functions and conditional survivor functions. We implement maximum likelihood estimation of the model parameters and discuss model adequacy and selection. We illustrate our approach using a simulation study. For a real data situation, we demonstrate the superiority of the proposed model that incorporates both load share and frailty effects over competing models that incorporate just one of these effects. An attractive and computationally simple cross‐validation technique is introduced to reconfirm the claim. We conclude with a summary and discussion.     

Series of tail distributions of finitely inhomogeneous random walks

Let Sn=X₁+?+Xn be a random walk, where the steps Xn are independent random variables having a finite number of possible distributions, and consider general series of the form

(∗)     

B值混合序列的一些收敛性结果

本文获得了B值ρ混合随机元序列的均值收敛性,Kolmogorov强大数定律以及正则和极大值矩的存在性问题,推广和改进了已有的结果.     

带负顾客和非空竭服务随机休假的M~([x])/G/1可修排队系统

研究了带负顾客和非空竭服务随机休假的M~([X])/G/1可修排队系统.负顾客不仅仅移除一个正在接受服务的正顾客,而且还使得服务器损坏而立即进行修理.通过构造一个具有吸收态的马尔可夫链求得了系统稳态存在的充分必要条件.利用补充变量法求得了系统的排队指标和可靠性指标.最后我们还给出了一个数值实例.     

关于N-弱鞅和弱鞅不等式的一个注记

$N$-弱鞅($N$-demimartingales)是由Christofides引进的.Christofides指出均值为零的负相协(negatively associated)随机变量序列的部分和序列是$N$-弱鞅. 然而, 相关文献中引理2.1的证明有错误, 这就影响了其文后的结果引理2.2、定理2.1等. 在这篇注记中,修正了相关文献中的引理2.1, 作为应用, 推广了鞅和下鞅的一些结果.