相关论文: Erratum: Percolation on random Johnson-Mehl tessel…
This paper explores the possibilities and limitations of error correction by the structural simplicity of error mechanisms. Specifically, we consider channel models, called \emph{samplable additive channels}, in which (a) errors are…
The calculation presented in "A neoclassical calculation of rotation profiles and comparison with DIII-D measurements" by Stacey, Johnson, and Mandrekas, [Physics of Plasmas, 13, (2006)], contains several errors, including the neglect of…
Correction to Bernoulli (2006), 12, 551--570 http://projecteuclid.org/euclid.bj/1151525136
Eulerian percolation on Z 2 with parameter p is the classical Bernoulli bond percolation with parameter p conditioned on the fact that every site has an even degree. We first explain why Eulerian percolation with parameter p coincides with…
This note points out a gap in the proof of one of the technical results in the paper "Asymptotic Invariants of Base Loci", that appeared in Ann. Inst. Fourier (Grenoble) 56 (2006), 1701-1734. We provide a correct proof of this result.
We study directed percolation at the upper critical transverse dimension $d=4$, where critical fluctuations induce logarithmic corrections to the leading (mean-field) behavior. Viewing directed percolation as a kinetic process, we address…
We study the shape fluctuation in the first passage percolation on $\mathbb{Z}^d$. It is known that it diverges when the distribution obeys Bernoulli in [Yu Zhang. The divergence of fluctuations for shape in first passage percolation.…
This article is preface to the SIGMA special issue "Tensor Models, Formalism and Applications", http://www.emis.de/journals/SIGMA/Tensor_Models.html. The issue is a collection of eight excellent, up to date reviews on random tensor models.…
We study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove…
Correction to Annals of Applied Statistics 1 (2007) 17--35 [doi:10.1214/07-AOAS114]
We study percolation on networks, which is used as a model of the resilience of networked systems such as the Internet to attack or failure and as a simple model of the spread of disease over human contact networks. We reformulate…
We describe the percolation model and some of the principal results and open problems in percolation theory. We also discuss briefly the spectacular recent progress by Lawler, Schramm, Smirnov and Werner towards understanding the phase…
The goal of this note is to announce certain results in orbit equivalence theory, especially concerning the approximation of p.m.p. standard equivalence relations by increasing sequence of sub-relations, with applications to the behavior of…
Percolation is the paradigm for random connectivity and has been one of the most applied statistical models. With simple geometrical rules a transition is obtained which is related to magnetic models. This transition is, in all dimensions,…
Boris Shoikhet noticed that the proof of lemma 1 in section 2.3 of math.QA/0504420 contains an error. In this note I give a correct proof of this lemma which was suggested to me by Dmitry Tamarkin. The correction does not change the results…
Errors were discovered in our recent calculations of HeI emissivities (Porter et al. 2012; arXiv:1206.4115). This corrigendum discusses the errors and reports corrected emissivities.
In the note two errors in Low and Lapsley's article "Optimization Flow Control, I: Basic Algorithm and Convergence", "IEEE/ACM Transactions on Networking", 7(6), pp. 861-874, 1999, are shown. Because of these errors the proofs of both…
Following the recent investigations of Baik and Suidan in \cite{baik2005gcl} and Bodineau and Martin in \cite{bodineau2005upl}, we prove large deviation properties for a last-passage percolation model in $\mathbb{Z}^{2}_{+}$ whose paths are…
In the mean field (or random link) model there are $n$ points and inter-point distances are independent random variables. For $0 < \ell < \infty$ and in the $n \to \infty$ limit, let $\delta(\ell) = 1/n \times$ (maximum number of steps in a…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…