Search arXivSearch

arXiv · 1010.5418

On the dynamics of trap models in Z^d

Abstract

We consider trap models on Z^d, namely continuous time Markov jump process on Z^d with embedded chain given by a generic discrete time random walk, and whose mean waiting time at x is given by tau_x, with tau = (tau_x, x in Z^d) a family of positive iid random variables in the basin of attraction of an alpha-stable law, 0<alpha<1. We may think of x as a trap, and tau_x as the depth of the trap at x. We are interested in the trap process, namely the process that associates to time t the depth of the currently visited trap. Our first result is the convergence of the law of that process under suitable scaling. The limit process is given by the jumps of a certain alpha-stable subordinator at the inverse of another alpha-stable subordinator, correlated with the first subordinator. For that result, the requirements for the embedded random walk are a) the validity of a law of large numbers for its range, and b) the slow variation at infinity of the tail of the distribution of its time of return to the origin: they include all transient random walks as well as all planar random walks, and also many one dimensional random walks. We then derive aging results for the process, namely scaling limits for some two-time correlation functions thereof, a strong form of which requires an assumption of transience, stronger than a, b. The above mentioned scaling limit result is an averaged result with respect to tau. Under an additional condition on the size of the intersection of the ranges of two independent copies of the embeddded random walk, roughly saying that it is small compared with the size of the range, we derive a stronger scaling limit result, roughly stating that it holds in probability with respect to tau. With that additional condition, we also strengthen the aging results, from the averaged version mentioned above, to convergence in probability with respect to tau.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luiz Renato Fontes, Pierre Mathieu. 2013-01-17. On the dynamics of trap models in Z^d. https://doi.org/10.1112/plms%2Fpdt064

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bounded weak solutions to cross-diffusion semiconductor model with electron-hole scattering

Semiconductor model is a system of parabolic partial differential equations with cross-diffusion phenomenon. Previous results showed that a weak solution exists and is not bounded in general. So semiconductor model was categorized as a cross-diffusion system without bounded weak solutions. In this work, we show that once the initial value is bounded, there exists a weak solution that is also bounded. The entropy method is a major tool in global existence analysis of cross-diffusion systems. We notice that traditional entropies in volume-filling cases may not provide required positive semi-definiteness result for the existence proof. In this situation, a transformation of variables technique has been applied. The product between Hessian matrix of the entropy and replacement diffusion matrix is positive semi-definite, then we apply the entropy method to show semiconductor model has a bounded weak solution.

math.PR

Global existence and uniqueness analysis of cross-diffusion multispecies chemotaxis system with volume-filling

The system of multispecies chemotaxis equations is a cross-diffusion system with volume-filling. In this work, we show that a weak solution of the two species chemotaxis system exists. The entropy method is a major tool in existence analysis of cross-diffusion systems. Previous investigations indicate that traditional entropies in volume-filling cases may not be able to provide required gradient estimates. In this situation, we upgrade existing matrix computation methods to derive gradient estimates. Due to the cross-diffusion phenomenon, the uniqueness of the weak solution to a cross-diffusion system is very difficult to prove in general. In this work, we apply the distance functional to show that when parameters of the chemotaxis system are identical, the weak solution is unique.

math.PR

Self-normalized scaled quadratic variation

The concept of a scaled quadratic variation was originally introduced by E. Gladyshev in 1961 for processes with Gaussian increments. Using certain deterministic scaling, arrived at from the covariance of the process, Gladyshev showed that the sum of scaled square increments along the dyadic partition sequence converges almost surely to a finite limit. In this paper, we propose a pathwise counterpart in which the deterministic normalization is replaced by a self-normalizing factor built from the $p$-th variation of the path along a given sequence of partitions. The resulting quantity requires no probabilistic assumption and no knowledge of a covariance structure, and its scale is both path-dependent and sensitive to the partition sequence. Under a mild regularity condition on the limiting $p$-th variation, we show that the self-normalized and the classical deterministic normalizations are comparable, and for fractional Brownian motion the two agree up to a multiplicative constant. We establish a switching behaviour in the index, and prove that for $p \ge 2$ the self-normalized scaled quadratic variation obeys a smooth-transformation formula under $C^2$ maps; at $p=2$ this recovers the known transformation rule for quadratic variation. Since only squared increments are scaled, the construction polarizes, yielding a matrix-valued scaled quadratic variation for every $p \geq 1$ for $\mathbb R^d$ valued paths. We conclude with examples beyond the Gaussian setting.

math.PR