Let each of n particles starting at the origin in Z perform simple random walk until reaching a site with no other particles. Lawler, Bramson, and Griffeath proved that the resulting random set A(n) of n occupied sites is (with high probability) close to a disk Br of radius r = √ n/π. We show that the discrepancy between A(n) and the disk is at most logarithmic in the radius: i.e., there is an ...

The internal diffusion limited aggregation (IDLA) process places n particles on the two dimensional integer grid. The first particle is placed on the origin; every subsequent particle starts at the origin and performs an unbiased random walk until it reaches an unoccupied position. In this work we study the computational complexity of determining the subset that is generated after n particles h...

Associative priming effects can be obtained with masked nonword primes or with masked pseudohomophone primes (e.g., judpe-COURT, tode-FROG), but not with visible primes. The usual explanation is that when the prime is visible, these stimuli no longer activate the semantic representations of their base words. Given the important role of transposed-letter stimuli (e.g., jugde) in visual word reco...

There is now considerable evidence (e.g., Perea & Lupker, 2003a; 2003b) that transposed-letter nonword primes (e.g., jugde for JUDGE) are more effective primes than replacement-letter nonword primes (e.g., jupte for JUDGE). Recently, Perea and Lupker (2004) demonstrated that, in Spanish, this transposed-letter prime advantage exists only when the transposed letters are consonants (C-C transposi...

In Indo-European languages, letter position coding is particularly noisy in middle positions (e.g., judge and jugde look very similar), but not in the initial letter position (e.g., judge vs. ujdge). Here we focus on a language (Thai) which, potentially, may be more flexible with respect to letter position coding than Indo-European languages: (i) Thai is an alphabetic language which is written ...