Electronic Communications in Probability
Collection
Collection
- ISSN: 1083-589X
Published by Institute of Mathematical Statistics [etc.]
-
The size of a pond in 2D invasion percolation Article
Electronic Communications in Probability, 411-420.J. van den Berg (Rob), A.A. Járai (Antal) and B. Vagvölgyi (Balint)
January 2007
-
A local limit theorem for the critical random graph Article
Electronic Communications in Probability, 122-131.R.W. van der Hofstad (Remco), W. Kager and T. Müller (Tobias)
January 2009
-
Escape of resources in a distributed clustering process Article
Electronic Communications in ProbabilitySeptember 2010
-
The tail of the maximum of Brownian motion minus a parabola Article
Electronic Communications in Probability, 458-466.August 2011
-
On the size of the largest cluster in 2D critical percolation Article
Electronic Communications in ProbabilityJanuary 2012
-
A percolation process on the binary tree where large finite clusters are frozen Article
Electronic Communications in Probability, 1-11.J. van den Berg (Rob), D. Kiss (Demeter) and P. Nolin (Pierre)
January 2012
-
The gaps between the sizes of large clusters in 2D critical percolation Article
Electronic Communications in ProbabilityJanuary 2013
-
The expected number of critical percolation clusters intersecting a line segment Article
Electronic Communications in ProbabilityJanuary 2016