Percolation of arbitrary words in one dimension
نویسندگان
چکیده
We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation model. The main issue is whether a given infinite binary word appears within an iid Bernoulli sequence at locations that satisfy certain constraints. We settle the issue in some cases, and provide partial results in others.
منابع مشابه
Almost All Words Are Seen in Critical Site Percolation on the Triangular Lattice
We consider critical site percolation on the triangular lattice, that is, we choose X(v) = 0 or 1 with probability 1/2 each, independently for all vertices v of the triangular lattice. We say that a word (ξ1, ξ2, . . . ) ∈ {0, 1}N is seen in the percolation configuration if there exists a selfavoiding path (v1, v2, . . . ) on the triangular lattice with X(vi) = ξi, i ≥ 1. We prove that with pro...
متن کاملHigh-temperature series expansions for the q-state Potts model on a hypercubic lattice and critical properties of percolation.
We present results for the high-temperature series expansions of the susceptibility and free energy of the q-state Potts model on a D-dimensional hypercubic lattice ZD for arbitrary values of q. The series are up to order 20 for dimension D1 limit of these series, we estimate the percolation threshold pc and critical ...
متن کاملThe Perimeter of Proper Polycubes
We derive formulas for the number of polycubes of size n and perimeter t that are proper in n − 1 and n − 2 dimensions. These formulas complement computer based enumerations of perimeter polynomials in percolation problems. We demonstrate this by computing the perimeter polynomial for n = 12 in arbitrary dimension d.
متن کاملBridge Percolation
In bridge percolation one gives a special weight to bridges, i.e., bonds that if occupied would create the first spanning cluster. We show that, for p > pc, even far away from the critical point of classical percolation, the set of bridge bonds is fractal with a fractal dimension dBB = 1.215±0.002. This new percolation exponent is related to various different models like, e.g., the optimal path...
متن کاملساختار خوشه‌های پرکولاسیون تهاجمی در دو بعد
We have performed extensive numerical simulations to estimate the fractal dimension of the mass and also the anisotropy in the shape of sample spanning cluster (SSC) in 2-D site invasion percolation processes with and without trapping. In agreement with the most recent works, we have observed that these two different processes belong to two different universality classes. Furthermore, we have...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 37 شماره
صفحات -
تاریخ انتشار 2010