In a uniform random recursive$k$-directed acyclic graph, there is a root, 0, and each node in turn, from 1 to$n$, chooses$k$uniform random parents from among the nodes of smaller index. If$S$_{$n$}is the shortest path distance from node$n$to the root, then we determine the constant$σ$such that$S$_{$n$}/log$n$→$σ$in probability as$n$→∞. We also show that max_{1≤$i$≤$n$}$S$_{$i$}/log$n$→$σ$in probability.

Let each point of a homogeneous Poisson process in ℝ^{$d$}independently be equipped with a random number of stubs (half-edges) according to a given probability distribution$μ$on the positive integers. We consider translation-invariant schemes for perfectly matching the stubs to obtain a simple graph with degree distribution$μ$. Leaving aside degenerate cases, we prove that for any$μ$there exist schemes that give only finite components as well as schemes that give infinite components. For a particular matching scheme which is a natural extension of Gale–Shapley stable marriage, we give sufficient conditions on$μ$for the absence and presence of infinite components.

The quantitative comparison of two or more microarrays can reveal, for example, the distinct patterns of gene expression that define different cellular phenotypes or the genes that are induced in the cellular response to certain stimulations. Normalization of the measured intensities is a prerequisite of such comparisons. However, a fundamental problem in cDNA microarray analysis is the lack of a common standard to compare the expression levels of different samples. Several normalization protocols have been proposed to overcome the variabilities inherent in this technology. We have developed a normalization procedure based on within-array replications via a semilinear in-slide model, which adjusts objectively experimental variations without making critical biological assumptions. The significant analysis of gene expressions is based on a weighted <i>t</i> statistic, which accounts for the heteroscedasticity of the

It has been reported that the plasma levels of VEGF in tumor patients decreased during dendritic cell (DC)-based immunotherapy, but the underlying mechanism remains unclear. Our current report demonstrates that VEGF levels were significantly decreased in the supernatants of DCs incubated with rhVEGF or tumor conditioned medium (TCM) while the intracellular VEGF in DCs was increased. The increased intracellular VEGF was not due to the <i>de novo</i> VEGF synthesis by DCs because exogenous VEGF inhibited the mRNA expression of VEGF in DCs. More direct evidence was provided to demonstrate that Cy3-labeled VEGF could be internalized by DCs specifically and efficiently. In addition, the activity of DCs to internalize VEGF was abolished by neutralizing antibody against VEGF receptor-1 (Flt-1) and inhibitors of endocytosis such as carbonyl cyanide m-chlorophenyl hydrazone (CCCP) and genistein. This

Several large volatility matrix estimation procedures have been recently developed for factor-based It processes whose integrated volatility matrix consists of low-rank and sparse matrices. Their performance depends on the accuracy of input volatility matrix estimators. When estimating co-volatilities based on high-frequency data, one of the crucial challenges is non-synchronization for illiquid assets, which makes their co-volatility estimators inaccurate. In this paper, we study how to estimate the large integrated volatility matrix without using co-volatilities of illiquid assets. Specifically, we pretend that the co-volatilities for illiquid assets are missing, and estimate the low-rank matrix using a matrix completion scheme with a structured missing pattern. To further regularize the sparse volatility matrix, we employ the principal orthogonal complement thresholding method (POET). We also investigate the asymptotic