相关论文: Minkowski sum of fractal percolation and random se…

We show that the range of a critical branching random walk conditioned to survive forever and the Minkowski sum of two independent simple random walk ranges are intersection-equivalent in any dimension $d\ge 5$, in the sense that they hit…

We extend the theory of discrete capacity to critical branching random walk. We introduce branching capacity for any finite subset of $\Z^d, d\geq5$. Analogous to the regular discrete capacity, branching capacity is closely related to the…

Let $R_n$ be the range of a critical branching random walk with $n$ particles on $\mathbb Z^d$, which is the set of sites visited by a random walk indexed by a critical Galton--Watson tree conditioned on having exactly $n$ vertices. For…

We discuss the definition and measurability questions of random fractals and find under certain conditions a formula for upper and lower Minkowski dimensions. For the case of a random self-similar set we obtain the packing dimension.

We consider a class of random self-similar fractals based on code trees which includes random recursive, homogeneous and V-variable fractals and many more. For such random fractals we consider mean values of the Lipschitz-Killing curvatures…

We consider the simple random walk on the infinite cluster of a general class of percolation models on $\mathbb{Z}^d$, $d\geq 3$, including Bernoulli percolation as well as models with strong, algebraically decaying correlations. For almost…

There are various notions of dimension in fractal geometry to characterise (random and non-random) subsets of $\mathbb R^d$. In this expository text, we discuss their analogues for infinite subsets of $\mathbb Z^d$ and, more generally, for…

We show that random walks on the infinite supercritical percolation clusters in Z^d satisfy the usual Law of the Iterated Logarithm. The proof combines Barlow's Gaussian heat kernel estimates and the ergodicity of the random walk on the…

Typically, in the dynamical theory of extremal events, the function that gauges the intensity of a phenomenon is assumed to be convex and maximal, or singular, at a single, or at most a finite collection of points in phase--space. In this…

We consider the branching capacity of the range of a simple random walk on $\mathbb Z^d$, with $d \ge 5$, and show that it falls in the same universality class as the volume and the capacity of the range of simple random walks and branching…

We study the size properties of a general model of fractal sets that are based on a tree-indexed family of random compacts and a tree-indexed Markov chain. These fractals may be regarded as a generalization of those resulting from the…

Despite a long history and a clear overall understanding of properties of random walks on an incipient infinite cluster in percolation, some important information on it seems to be missing in the literature. In the present work, we revisit…

We prove that in any finite set of $\mathbb Z^d$ with $d\ge 3$, there is a subset whose capacity and volume are both of the same order as the capacity of the initial set. As an application we obtain estimates on the probability of {\it…

Let $\mathcal{C}=\{C_1,\ldots,C_n\}$ be a set of $n$ pairwise-disjoint convex sets of constant description complexity, and let $\pi$ be a probability density function (pdf for short) over the non-negative reals. For each $i$, let $K_i$ be…

We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on $Z^d \times Z_+$. In dimensions $d>6$, we obtain bounds on exit times, transition probabilities, and the range of the…

The average number $S_N(t)$ of distinct sites visited up to time t by N noninteracting random walkers all starting from the same origin in a disordered fractal is considered. This quantity $S_N(t)$ is the result of a double average: an…

We consider the discrete time quantum random walks on a Sierpinski gasket. We study the hitting probability as the level of fractal goes to infinity in terms of their localization exponents $\beta_w$ , total variation exponents $\delta_w$…

One of the most well known random fractals is the so-called Fractal percolation set. This is defined as follows: we divide the unique cube in $\mathbb{R}^d$ into $M^d$ congruent sub-cubes. For each of these cubes a certain retention…

Percolation clusters are random fractals whose geometrical and transport properties can be characterized with the help of probability distribution functions. Using renormalized field theory, we determine the asymptotic form of various of…

We establish pointwise and distributional fractal tube formulas for a large class of compact subsets of Euclidean spaces of arbitrary dimensions. These formulas are expressed as sums of residues of suitable meromorphic functions over the…