ﻻ يوجد ملخص باللغة العربية
We introduce a method for translating any upper bound on the percolation threshold of a lattice $G$ into a lower bound on the exponential growth rate $a(G)$ of lattice animals and vice-versa. We exploit this in both directions. We improve on the best known asymptotic lower and upper bounds on $a(mathbb{Z}^d)$ as $dto infty$. We use percolation as a tool to obtain the latter, and conversely we use the former to obtain lower bounds on $p_c(mathbb{Z}^d)$. We obtain the rigorous lower bound $dot{p}_c(mathbb{Z}^3)>0.2522$ for 3-dimensional site percolation.
We introduce a formula for translating any upper bound on the percolation threshold of a lattice g into a lower bound on the exponential growth rate of lattice animals $a(G)$ and vice-versa. We exploit this to improve on the best known asymptotic bou
A well-known question in the planar first-passage percolation model concerns the convergence of the empirical distribution along geodesics. We demonstrate this convergence for an explicit model, directed last-passage percolation on $mathbb{Z}^2$ with
We study the stochastic growth process in discrete time $x_{i+1} = (1 + mu_i) x_i$ with growth rate $mu_i = rho e^{Z_i - frac12 var(Z_i)}$ proportional to the exponential of an Ornstein-Uhlenbeck (O-U) process $dZ_t = - gamma Z_t dt + sigma dW_t$ sam
We consider instances of long-range percolation on $mathbb Z^d$ and $mathbb R^d$, where points at distance $r$ get connected by an edge with probability proportional to $r^{-s}$, for $sin (d,2d)$, and study the asymptotic of the graph-theoretical (a.
We propose a twisted Szegedy walk for estimating the limit behavior of a discrete-time quantum walk on a crystal lattice, an infinite abelian covering graph, whose notion was introduced by [14]. First, we show that the spectrum of the twisted Szegedy