Loading [MathJax]/extensions/MathZoom.js
Displaying 101 –
120 of
582
In this article it is shown that the brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete n-vertex ordered graph trees whose search-depth functions converge to the brownian excursion as n→∞. We prove both a quenched version (for typical realisations of the trees) and an annealed version (averaged over all realisations of the trees) of our main result. The assumptions of the article cover the important example of simple random walks...
We introduce a system of one-dimensional coalescing nonsimple random walks with long range jumps allowing paths that can cross each other and are dependent even before coalescence. We show that under diffusive scaling this system converges in distribution to the Brownian Web.
We develop a method, based on a Bochner-type identity, to obtain estimates on the exponential rate of decay of the relative entropy from equilibrium of Markov processes in discrete settings. When this method applies the relative entropy decays in a convex way. The method is shown to be rather powerful when applied to a class of birth and death processes. We then consider other examples, including inhomogeneous zero-range processes and Bernoulli–Laplace models. For these two models, known results...
We consider a simple random walk of length N, denoted by (Si)i∈{1, …, N}, and we define (wi)i≥1 a sequence of centered i.i.d. random variables. For K∈ℕ we define ((γi−K, …, γiK))i≥1 an i.i.d sequence of random vectors. We set β∈ℝ, λ≥0 and h≥0, and transform the measure on the set of random walk trajectories with the hamiltonian λ∑i=1N(wi+h)sign(Si)+β∑j=−KK∑i=1Nγij1{Si=j}. This transformed path measure describes an hydrophobic(philic) copolymer interacting with a layer of width 2K around an interface...
Attractiveness is a fundamental tool to study interacting particle systems and the basic coupling construction is a usual route to prove this property, as for instance in simple exclusion. The derived markovian coupled process (ξt, ζt)t≥0 satisfies: (A) if ξ0≤ζ0 (coordinate-wise), then for all t≥0, ξt≤ζt a.s. In this paper, we consider generalized misanthrope models which are conservative particle systems on ℤd such that, in each transition, k particles may jump from a site x to another site y,...
In the past years, many properties of the largest connected components of critical percolation on the high-dimensional torus, such as their sizes and diameter, have been established. The order of magnitude of these quantities equals the one for percolation on the complete graph or Erdős–Rényi random graph, raising the question whether the scaling limits of the largest connected components, as identified by Aldous (1997), are also equal. In this paper, we investigate the cycle structureof the largest...
We consider a gradient interface model on the lattice with interaction potential which is a non-convex perturbation of a convex potential. Using a technique which decouples the neighboring vertices into even and odd vertices, we show for a class of non-convex potentials: the uniqueness of ergodic component for -Gibbs measures, the decay of covariances, the scaling limit and the strict convexity of the surface tension.
Uniqueness of the martingale problem corresponding to a degenerate SDE which models catalytic branching networks is proven. This work is an extension of the paper by Dawson and Perkins [Illinois J. Math.50 (2006) 323–383] to arbitrary catalytic branching networks. As part of the proof estimates on the corresponding semigroup are found in terms of weighted Hölder norms for arbitrary networks, which are proven to be equivalent to the semigroup norm for this generalized setting.
We find the transition kernels for four markovian interacting particle systems on the line, by proving that each of these kernels is intertwined with a Karlin–McGregor-type kernel. The resulting kernels all inherit the determinantal structure from the Karlin–McGregor formula, and have a similar form to Schütz’s kernel for the totally asymmetric simple exclusion process.
Currently displaying 101 –
120 of
582