Sparse partition universal graphs for graphs of bounded degree

In 1983, Chvatal, Trotter and the two senior authors proved that for any Delta there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph K(N) with N >= Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Delta. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N(2-1/Delta)log(1/Delta)N) edges, with N = [B`n] for some constant B` that depends only on Delta. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Delta is O(n(2-1/Delta)log(1/Delta)n) Our approach is based on random graphs; in fact, we show that the classical Erdos-Renyi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Delta. The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed. (C) 2011 Elsevier Inc. All rights reserved.

Random sums of exchangeable variables and actuarial applications

In this paper we study the accumulated claim in some fixed time period, skipping the classical assumption of mutual independence between the variables involved. Two basic models are considered: Model I assumes that any pair of claims are equally correlated which means that the corresponding square-integrable sequence is exchangeable one. Model 2 states that the correlations between the adjacent claims are the same. Recurrence and explicit expressions for the joint probability generating function are derived and the impact of the dependence parameter (correlation coefficient) in both models is examined. The Markov binomial distribution is obtained as a particular case under assumptions of Model 2. (C) 2007 Elsevier B.V. All rights reserved.

Random walks systems with killing on Z

We study random walks systems on Z whose general description follows. At time zero, there is a number N >= 1 of particles at each vertex of N, all being inactive, except for those placed at the vertex one. Each active particle performs a simple random walk on Z and, up to the time it dies, it activates all inactive particles that it meets along its way. An active particle dies at the instant it reaches a certain fixed total of jumps (L >= 1) without activating any particle, so that its lifetime depends strongly on the past of the process. We investigate how the probability of survival of the process depends on L and on the jumping probabilities of the active particles.

Random number generators for the generalized Birnbaum-Saunders distribution

The generalized Birnbaum-Saunders distribution pertains to a class of lifetime models including both lighter and heavier tailed distributions. This model adapts well to lifetime data, even when outliers exist, and has other good theoretical properties and application perspectives. However, statistical inference tools may not exist in closed form for this model. Hence, simulation and numerical studies are needed, which require a random number generator. Three different ways to generate observations from this model are considered here. These generators are compared by utilizing a goodness-of-fit procedure as well as their effectiveness in predicting the true parameter values by using Monte Carlo simulations. This goodness-of-fit procedure may also be used as an estimation method. The quality of this estimation method is studied here. Finally, through a real data set, the generalized and classical Birnbaum-Saunders models are compared by using this estimation method.

NONHOMOGENEOUS RANDOM WALKS SYSTEMS ON Z

We consider a random walks system on Z in which each active particle performs a nearest-neighbor random walk and activates all inactive particles it encounters. The movement of an active particle stops when it reaches a certain number of jumps without activating any particle. We prove that if the process relies on efficient particles (i.e. those particles with a small probability of jumping to the left) being placed strategically on Z, then it might survive, having active particles at any time with positive probability. On the other hand, we may construct a process that dies out eventually almost surely, even if it relies on efficient particles. That is, we discuss what happens if particles are initially placed very far away from each other or if their probability of jumping to the right tends to I but not fast enough.

On slowdown and speedup of transient random walks in random environment

We consider one-dimensional random walks in random environment which are transient to the right. Our main interest is in the study of the sub-ballistic regime, where at time n the particle is typically at a distance of order O(n (kappa) ) from the origin, kappa is an element of (0, 1). We investigate the probabilities of moderate deviations from this behaviour. Specifically, we are interested in quenched and annealed probabilities of slowdown (at time n, the particle is at a distance of order O (n (nu 0)) from the origin, nu(0) is an element of (0, kappa)), and speedup (at time n, the particle is at a distance of order n (nu 1) from the origin , nu(1) is an element of (kappa, 1)), for the current location of the particle and for the hitting times. Also, we study probabilities of backtracking: at time n, the particle is located around (-n (nu) ), thus making an unusual excursion to the left. For the slowdown, our results are valid in the ballistic case as well.

Billiards in a General Domain with Random Reflections

We study stochastic billiards on general tables: a particle moves according to its constant velocity inside some domain D R(d) until it hits the boundary and bounces randomly inside, according to some reflection law. We assume that the boundary of the domain is locally Lipschitz and almost everywhere continuously differentiable. The angle of the outgoing velocity with the inner normal vector has a specified, absolutely continuous density. We construct the discrete time and the continuous time processes recording the sequence of hitting points on the boundary and the pair location/velocity. We mainly focus on the case of bounded domains. Then, we prove exponential ergodicity of these two Markov processes, we study their invariant distribution and their normal (Gaussian) fluctuations. Of particular interest is the case of the cosine reflection law: the stationary distributions for the two processes are uniform in this case, the discrete time chain is reversible though the continuous time process is quasi-reversible. Also in this case, we give a natural construction of a chord ""picked at random"" in D, and we study the angle of intersection of the process with a (d - 1) -dimensional manifold contained in D.

Predicting random effects with an expanded finite population mixed model

Prediction of random effects is an important problem with expanding applications. In the simplest context, the problem corresponds to prediction of the latent value (the mean) of a realized cluster selected via two-stage sampling. Recently, Stanek and Singer [Predicting random effects from finite population clustered samples with response error. J. Amer. Statist. Assoc. 99, 119-130] developed best linear unbiased predictors (BLUP) under a finite population mixed model that outperform BLUPs from mixed models and superpopulation models. Their setup, however, does not allow for unequally sized clusters. To overcome this drawback, we consider an expanded finite population mixed model based on a larger set of random variables that span a higher dimensional space than those typically applied to such problems. We show that BLUPs for linear combinations of the realized cluster means derived under such a model have considerably smaller mean squared error (MSE) than those obtained from mixed models, superpopulation models, and finite population mixed models. We motivate our general approach by an example developed for two-stage cluster sampling and show that it faithfully captures the stochastic aspects of sampling in the problem. We also consider simulation studies to illustrate the increased accuracy of the BLUP obtained under the expanded finite population mixed model. (C) 2007 Elsevier B.V. All rights reserved.

Bootstrap percolation on homogeneous trees has 2 phase transitions

We study the threshold theta bootstrap percolation model on the homogeneous tree with degree b + 1, 2 <= theta <= b, and initial density p. It is known that there exists a nontrivial critical value for p, which we call p(f), such that a) for p > p(f), the final bootstrapped configuration is fully occupied for almost every initial configuration, and b) if p < p(f) , then for almost every initial configuration, the final bootstrapped configuration has density of occupied vertices less than 1. In this paper, we establish the existence of a distinct critical value for p, p(c), such that 0 < p(c) < p(f), with the following properties: 1) if p <= p(c), then for almost every initial configuration there is no infinite cluster of occupied vertices in the final bootstrapped configuration; 2) if p > p(c), then for almost every initial configuration there are infinite clusters of occupied vertices in the final bootstrapped configuration. Moreover, we show that 3) for p < p(c), the distribution of the occupied cluster size in the final bootstrapped configuration has an exponential tail; 4) at p = p(c), the expected occupied cluster size in the final bootstrapped configuration is infinite; 5) the probability of percolation of occupied vertices in the final bootstrapped configuration is continuous on [0, p(f)] and analytic on (p(c), p(f) ), admitting an analytic continuation from the right at p (c) and, only in the case theta = b, also from the left at p(f).

Geodesics and Almost Geodesic Cycles in Random Regular Graphs

A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d(G)(u, v) is at least d(C)(u, v) - e(n). Let omega(n) be any function tending to infinity with n. We consider a random d-regular graph on n vertices. We show that almost all pairs of vertices belong to an almost geodesic cycle C with e(n)= log(d-1)log(d-1) n+omega(n) and vertical bar C vertical bar =2 log(d-1) n+O(omega(n)). Along the way, we obtain results on near-geodesic paths. We also give the limiting distribution of the number of geodesics between two random vertices in this random graph. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 66: 115-136, 2011

Asymmetric Ramsey Properties of Random Graphs Involving Cliques

Consider the following problem: Forgiven graphs G and F(1),..., F(k), find a coloring of the edges of G with k colors such that G does not contain F; in color i. Rodl and Rucinski studied this problem for the random graph G,,, in the symmetric case when k is fixed and F(1) = ... = F(k) = F. They proved that such a coloring exists asymptotically almost surely (a.a.s.) provided that p <= bn(-beta) for some constants b = b(F,k) and beta = beta(F). This result is essentially best possible because for p >= Bn(-beta), where B = B(F, k) is a large constant, such an edge-coloring does not exist. Kohayakawa and Kreuter conjectured a threshold function n(-beta(F1,..., Fk)) for arbitrary F(1), ..., F(k). In this article we address the case when F(1),..., F(k) are cliques of different sizes and propose an algorithm that a.a.s. finds a valid k-edge-coloring of G(n,p) with p <= bn(-beta) for some constant b = b(F(1),..., F(k)), where beta = beta(F(1),..., F(k)) as conjectured. With a few exceptions, this algorithm also works in the general symmetric case. We also show that there exists a constant B = B(F,,..., Fk) such that for p >= Bn(-beta) the random graph G(n,p) a.a.s. does not have a valid k-edge-coloring provided the so-called KLR-conjecture holds. (C) 2008 Wiley Periodicals, Inc. Random Struct. Alg., 34, 419-453, 2009

Examples from trees, related to discrete subsets, pseudo-radiality and omega-boundedness

We construct some examples using trees. Some of them are consistent counterexamples for the discrete reflection of certain topological properties. All the properties dealt with here were already known to be non-discretely reflexive if we assume CH and we show that the same is true assuming the existence of a Suslin tree. In some cases we actually get some ZFC results. We construct also, using a Suslin tree, a compact space that is pseudo-radial but it is not discretely generated. With a similar construction, but using an Aronszajn tree, we present a ZFC space that is first countable, omega-bounded but is not strongly w-bounded, answering a question of Peter Nyikos. (C) 2008 Elsevier B.V. All rights reserved.

Conformational Properties of Angiotensin II and Its Active and Inactive TOAC-Labeled Analogs in the Presence of Micelles. Electron Paramagnetic Resonance, Fluorescence, and Circular Dichroism Studies

The interaction between angiotensin II (AII, DRVYIHPF) and its analogs carrying 2,2,6,6-tetramethylpiperidine-1-oxyl-4-amino-4-carboxylic acid (TOAC) and detergents-negatively charged sodium dodecyl sulfate (SDS) and zwitterionic N-hexadecyl-N,N-dimethyl-3-ammonio-1-propanesulfonate (HPS)-was examined by means of EPR, CD, and fluorescence. EPR spectra of partially active TOAC(1)-AII and inactive TOAC(3)-AII in aqueous solution indicated fast tumbling, the freedom of motion being greater at the N-terminus. Line broadening occurred upon interaction with micelles. Below SDS critical micelle concentration, broader lines indicated complex formation with tighter molecular packing than in micelles. Small changes in hyperfine splittings evinced TOAC location at the micelle-water interface. The interaction with anionic micelles was more effective than with zwitterionic micelles. Peptide-micelle interaction caused fluorescence increase. The TOAC-promoted intramolecular fluorescence quenching was more, pronounced for TOAC(3)-AII because of the proximity between the nitroxide and Tyr(4). CD spectra showed that although both AII and TOAC(1)-AII presented flexible conformations in water, TOAC(3)-AII displayed conformational restriction because of the TOAC-imposed bend (Schreier et al., Biopolymers 2004, 74, 389). In HPS, conformational changes were observed for the labeled peptides at neutral and basic pH. In SDS, all peptides underwent pH-dependent conformational changes. Although the spectra suggested similar folds for All and TOAC(1)-AII, different conformations were acquired by TOAC(3)-AII. The membrane environment has been hypothesized to shift conformational equilibria so as to stabilize the receptor-bound conformation of ligands. The fact that TOAC(3)-AII is unable to acquire conformations similar to those of native AII and partially active TOAC(1)-AII is probably the explanation for its lack of biological activity. (C) 2009 Wiley Periodicals, Inc. Biopolymers (Pept Sci) 92: 525-537, 2009.

Tryptophan oxidation by singlet molecular oxygen [O-2 ((1)Delta(g))]: Mechanistic studies using O-18-labeled hydroperoxides, mass spectrometry, and light emission measurements

Proteins have been considered important targets for reactive oxygen species. Indeed, tryptophan (W) has been shown to be a highly susceptible amino acid to many oxidizing agents, including singlet molecular oxygen [O-2 ((1)Delta(g))]. In this study, two cis- and trans-tryptophan hydroperoxide (WOOH) isomers were completely characterized by HPLC/mass spectrometry and NMR analyses as the major W-oxidation photoproducts. These photoproducts underwent thermal decay into the corresponding alcohols. Additionally, WOOHs were shown to decompose under heating or basification, leading to the formation of N-formylkynurenine (FMK). Using O-18-labeled hydroperoxides ((WOOH)-O-18-O-18), it was possible to confirm the formation of two oxygen-labeled FMK molecules derived from (WOOH)-O-18-O-18 decomposition. This result demonstrates that both oxygen atoms in FMK are derived from the hydroperoxide group. In addition, these reactions are chemiluminescent (CL), indicating a dioxetane cleavage pathway. This mechanism was confirmed since the CL spectrum of the WOOH decomposition matched the FMK fluorescence spectrum, unequivocally identifying FMK as the emitting species.

Cholesterol Hydroperoxides Generate Singlet Molecular Oxygen [O(2) ((1)Delta(g))]: Near-IR Emission, (18)O-Labeled Hydroperoxides, and Mass Spectrometry

In mammalian membranes, cholesterol is concentrated in lipid rafts. The generation of cholesterol hydroperoxides (ChOOHs) and their decomposition products induces various types of cell damage. The decomposition of some organic hydroperoxides into peroxyl radicals is known to be a potential source of singlet molecular oxygen [O(2) ((1)Delta(g))] in biological systems. We report herein on evidence of the generation of O(2) ((1)Delta(g)) from ChOOH isomers in solution or in liposomes containing ChOOHs, which involves a cyclic mechanism from a linear tetraoxide intermediate originally proposed by Russell. Characteristic light emission at 1270 nm, corresponding to O(2) ((1)Delta(g)) monomolecular decay, was observed for each ChOOH isomer or in liposomes containing ChOOHs. Moreover, the presence of O(2) ((1)Delta(g)) was unequivocally demonstrated using the direct spectral characterization of near-infrared light emission. Using (18)O-labeled cholesterol hydroperoxide (Ch(18)O(18)OH), we observed the formation of (18)O-labeled O(2) ((1)Delta(g)) [(18)O(2) ((1)Delta(g))] by the chemical trapping of (18)O(2) ((1)Delta(g)) with 9,10-diphenylanthracene (DPA) and detected the corresponding (18)O-labeled DPA endoperoxide (DPA(18)O(18)O) and the (18)O-labeled products of the Russell mechanism using high-performance liquid chromatography coupled to tandem mass spectrometry. Photoemission properties and chemical trapping clearly demonstrate that the decomposition of Ch(18)O(18)OH generates (18)O(2) ((1)Delta(g)), which is consistent with the Russell mechanism and points to the involvement of O(2) ((1)Delta(g)) in cholesterol hydroperoxide-mediated cytotoxicity.