Results 1  10
of
36
Random walk on the incipient infinite cluster on trees
 Illinois J. Math
"... Abstract. Let G be the incipient infinite cluster (IIC) for percolation on a homogeneous tree of degree n0 + 1. We obtain estimates for the transition density of the the continuous time simple random walk Y on G; the process satisfies anomalous diffusion and has spectral dimension 4 ..."
Abstract

Cited by 26 (7 self)
 Add to MetaCart
Abstract. Let G be the incipient infinite cluster (IIC) for percolation on a homogeneous tree of degree n0 + 1. We obtain estimates for the transition density of the the continuous time simple random walk Y on G; the process satisfies anomalous diffusion and has spectral dimension 4
Which Values of the Volume Growth and Escape Time Exponent Are Possible for a Graph?
, 2001
"... Let \Gamma = (G; E) be an infinite weighted graph which is Ahlfors ffregular, so that there exists a constant c such that c , where V (x; r) is the volume of the ball centre x and radius r. Define the escape time T (x; r) to be the mean exit time of a simple random walk on \Gamma starting at ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
Let \Gamma = (G; E) be an infinite weighted graph which is Ahlfors ffregular, so that there exists a constant c such that c , where V (x; r) is the volume of the ball centre x and radius r. Define the escape time T (x; r) to be the mean exit time of a simple random walk on \Gamma starting at x from the ball centre x and radius r. We say \Gamma has escape time exponent fi ? 0 if there exists a constant c such that c T (x; r) cr for r 1. Well known estimates for random walks on graphs imply that ff 1 and 2 fi 1 + ff.
The Art of Random Walks
 Lecture Notes in Mathematics 1885
, 2006
"... 1.1 Basic definitions and preliminaries................ 8 ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
1.1 Basic definitions and preliminaries................ 8
Parabolic Harnack inequality and heat kernel estimates for random walks with long range jumps
, 2008
"... We investigate the relationships between the parabolic Harnack inequality, heat kernel estimates, some geometric conditions, and some analytic conditions for random walks with long range jumps. Unlike the case of diffusion processes, the parabolic Harnack inequality does not, in general, imply the c ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
We investigate the relationships between the parabolic Harnack inequality, heat kernel estimates, some geometric conditions, and some analytic conditions for random walks with long range jumps. Unlike the case of diffusion processes, the parabolic Harnack inequality does not, in general, imply the corresponding heat kernel estimates.
Some remarks on the elliptic Harnack inequality
, 2003
"... In this note we give three short results concerning the elliptic Harnack inequality (EHI), in the context of random walks on graphs. The first is that the EHI implies polynomial growth of the number of points in balls, and the second that the EHI is equivalent to an annulus type Harnack inequality f ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
In this note we give three short results concerning the elliptic Harnack inequality (EHI), in the context of random walks on graphs. The first is that the EHI implies polynomial growth of the number of points in balls, and the second that the EHI is equivalent to an annulus type Harnack inequality for Green’s functions. The third result uses the lamplighter group to give a counterexample concerning the relation of coupling with the EHI.
Heat kernels and sets with fractal structure. In: Heat kernels and analysis on manifolds, graphs, and metric spaces
, 2002
"... ..."
DECOUPLING INEQUALITIES AND INTERLACEMENT PERCOLATION ON G × Z
, 2010
"... We study the percolative properties of random interlacements on G×Z, where G is a weighted graph satisfying certain subGaussian estimates attached to the parameters α> 1 and 2 ≤ β ≤ α + 1. We develop decoupling inequalities, which are a key tool in showing that the critical level u ∗ for the per ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We study the percolative properties of random interlacements on G×Z, where G is a weighted graph satisfying certain subGaussian estimates attached to the parameters α> 1 and 2 ≤ β ≤ α + 1. We develop decoupling inequalities, which are a key tool in showing that the critical level u ∗ for the percolation of the vacant set of random interlacements is always finite in our setup, and that it is positive when α ≥ 1 + β 2. We also obtain several stretched exponential controls both in the percolative and nonpercolative phases of the model. Even in the case where G = Zd, d ≥ 2, several of these results are new.
Sobolev inequalities in familiar and unfamiliar settings
 In S. Sobolev Centenial Volumes, (V. Maz’ja, Ed
"... Abstract The classical Sobolev inequalities play a key role in analysis in Euclidean spaces and in the study of solutions of partial differential equations. In fact, they are extremely flexible tools and are useful in many different settings. This paper gives a glimpse of assortments of such applica ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract The classical Sobolev inequalities play a key role in analysis in Euclidean spaces and in the study of solutions of partial differential equations. In fact, they are extremely flexible tools and are useful in many different settings. This paper gives a glimpse of assortments of such applications in a variety of contexts. 1
Smooth bumps, a Borel theorem and partitions of smooth functions on P.C.F
 fractals, Trans. Amer. Math. Soc
"... Abstract. We provide two methods for constructing smooth bump functions and for smoothly cutting off smooth functions on fractals, one using a probabilistic approach and subGaussian estimates for the heat operator, and the other using the analytic theory for p.c.f. fractals and a fixed point argume ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We provide two methods for constructing smooth bump functions and for smoothly cutting off smooth functions on fractals, one using a probabilistic approach and subGaussian estimates for the heat operator, and the other using the analytic theory for p.c.f. fractals and a fixed point argument. The heat semigroup (probabilistic) method is applicable to a more general class of metric measure spaces with Laplacian, including certain infinitely ramified fractals, however the cut off technique involves some loss in smoothness. From the analytic approach we establish a Borel theorem for p.c.f. fractals, showing that to any prescribed jet at a junction point there is a smooth function with that jet. As a consequence we prove that on p.c.f. fractals smooth functions may be cut off with no loss of smoothness, and thus can be smoothly decomposed subordinate to an open cover. The latter result provides a replacement for classical partition of unity arguments in the p.c.f. fractal setting. 1.
The Einstein relation for random walks on graphs
, 2008
"... This paper investigates the Einstein relation; the connection between the volume growth, the resistance growth and the expected time a random walk needs to leave a ball on a weighted graph. The Einstein relation is proved under different set of conditions. In the simplest case it is shown under the ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This paper investigates the Einstein relation; the connection between the volume growth, the resistance growth and the expected time a random walk needs to leave a ball on a weighted graph. The Einstein relation is proved under different set of conditions. In the simplest case it is shown under the volume doubling and time comparison principles. This and the other set of conditions provide the basic vwork for the study of (sub) diffusive behavior of the random walks on weighted graphs. 1