Electronic Communications in Probability
http://ecp.ejpecp.org/
<p><strong></strong>The <strong>Electronic Communications in Probability</strong> (ECP) publishes short research articles in probability theory. Its sister journal, the <a href="http://ejp.ejpecp.org/" target="_self">Electronic Journal of Probability</a> (EJP), publishes full-length articles in probability theory. Short papers, those less than 12 pages, should be submitted to ECP first. EJP and ECP share the same editorial board, but with different Editors in Chief.</p><p>EJP and ECP are free access official journals of the <a href="http://www.imstat.org/">Institute of Mathematical Statistics</a> (IMS) and the <a href="http://isi.cbs.nl/BS/bshome.htm"> Bernoulli Society</a>. This web site uses the <a href="http://en.wikipedia.org/wiki/Open_Journal_Systems">Open Journal System</a> (OJS) free software developed by the non-profit organization <a href="http://en.wikipedia.org/wiki/Public_Knowledge_Project">Public Knowledge Project</a> (PKP).</p><p>Please consider donating to the <a href="http://www.imstat.org/publications/open.htm" target="_blank">Open Access Fund</a> of the IMS at this <a href="https://secure.imstat.org/secure/orders/donations.asp" target="_blank"><strong>page</strong></a> to keep the journal free.</p>en-USElectronic Communications in Probability1083-589XThe Electronic Journal of Probability applies the <a href="http://creativecommons.org/licenses/by/2.5/legalcode" target="_blank">Creative Commons Attribution License</a> (CCAL) to all articles we publish in this journal. Under the CCAL, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles published in EJP, so long as the original authors and source are credited. This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available.<br /><br /><strong>Summary of the Creative Commons Attribution License</strong><br /><br />You are free<br /><ul><li> to copy, distribute, display, and perform the work</li><li> to make derivative works</li><li> to make commercial use of the work</li></ul>under the following condition of Attribution: others must attribute the work if displayed on the web or stored in any electronic archive by making a link back to the website of EJP via its Digital Object Identifier (DOI), or if published in other media by acknowledging prior publication in this Journal with a precise citation including the DOI. For any further reuse or distribution, the same terms apply. Any of these conditions can be waived by permission of the Corresponding Author.The power of choice combined with preferential attachement
http://ecp.ejpecp.org/article/view/3461
<div class="page" title="Page 1"><div class="layoutArea"><div class="column"><p>We prove almost sure convergence of the maximum degree in an evolving tree model combining local choice and preferential attachment. At each step in the growth of the graph, a new vertex is introduced. A fixed, finite number of possible neighbors are sampled from the existing vertices with probability proportional to degree. Of these possibilities, the new vertex attaches to the vertex from the sample that has the highest degree. The maximal degree in this model has linear or near-linear behavior. This behavior contrasts sharply with the behavior in the same choice model with uniform attachment as well as the preferential attachment model without choice. The proof is based on showing the tree has a persistent hub by comparison with the standard preferential attachment model, as well as martingale and stochastic approximation arguments.</p></div></div></div>Yury MalyshkinElliot Paquette2014-07-122014-07-1219Uniqueness of degenerate Fokker-Planck equations with weakly differentiable drift whose gradient is given by a singular integral
http://ecp.ejpecp.org/article/view/3407
In this paper we prove the uniqueness of solutions to degenerate Fokker-Planck equations with bounded coefficients, under the additional assumptions that the diffusion coefficient has $W^{1,2}_{loc}$ regularity, while the gradient of the drift coefficient is merely given by a singular integral.Dejun Luo2014-07-122014-07-1219Lower bounds for bootstrap percolation on Galton-Watson trees
http://ecp.ejpecp.org/article/view/3315
Bootstrap percolation is a cellular automaton modelling the spread of an `infection' on a graph. In this note, we prove a family lower bounds on the critical probability for r-neighbour bootstrap percolation on Galton-Watson trees in terms of moments of the offspring distributions. With this result we confirm a conjecture of Bollobás, Gunderson, Holmgren, Janson and Przykucki. We also show that these bounds are best possible up to positive constants not depending on the offspring distribution.Karen GundersonMichal Przykucki2014-07-122014-07-1219Large deviations for weighted sums of stretched exponential random variables
http://ecp.ejpecp.org/article/view/3266
We consider the probability that a weighted sum of n i.i.d. random variables $X_j, j = 1,\ldots,n$, with stretched exponential tails is larger than its expectation and determine the rate of its decay, under suitable conditions on the weights. We show that the decay is subexponential, and identify the rate function in terms of the tails of $X_j$ and the weights. Our result generalizes the large deviation principle given by Kiesel and Stadtmüller as well as the tail asymptotics for sums of i.i.d. random variables provided by Nagaev. As an application of our result, motivated by random projections of high-dimensional vectors, we consider the case of random, self-normalized weights that are independent of the sequence $X_j$, identify the decay rate for both the quenched and annealed large deviations in this case, and show that they coincide. As another example we consider weights derived from kernel functions that arise in nonparametric regression.Nina GantertKavita RamananFranz Rembart2014-07-122014-07-1219Bernoulli and self-destructive percolation on non-amenable graphs
http://ecp.ejpecp.org/article/view/2611
<p>In this note we study some properties of infinite percolation clusters on non-amenable graphs. In particular, we study the percolative properties of the complement of infinite percolation clusters. An approach based on mass-transport is adapted to show that for a large class of non-amenable graphs, the graph obtained by removing each site contained in an infinite percolation cluster has critical percolation threshold which can be arbitrarily close to the critical threshold for the original graph, almost surely, as <span style="font-size: 10px;">$p\searrow p_c$. Closely related is the self-destructive percolation process, introduced by J. van den Berg and R. Brouwer, for which we prove that an infinite cluster emerges for any small reinforcement.</span></p>Daniel AhlbergVladas SidoraviciusJohan Tikesson2014-07-122014-07-1219