Particle density in diffusion-limited annihilating systems
From MaRDI portal
Abstract: Place an -particle at each site of a graph independently with probability and otherwise place a -particle. - and -particles perform independent continuous time random walks at rates and , respectively, and annihilate upon colliding with a particle of opposite type. Bramson and Lebowitz studied the setting in the early 1990s. Despite recent progress, many basic questions remain unanswered for when . For the critical case on low-dimensional integer lattices, we give a lower bound on the expected number of particles at the origin that matches physicists' predictions. For the process with on the integers and the bidirected regular tree, we give sharp upper and lower bounds for the expected total occupation time of the root at and approaching criticality.
Recommendations
- Recurrence and density decay for diffusion-limited annihilating systems
- Asymptotic behavior of densities for two-particle annihilating random walks
- Asymptotic upper bound of density for two-particle annihilating exclusion
- Asymptotic behavior of the density for two-particle annihilating exclusion.
- Diffusion-limited annihilating systems and the increasing convex order
Cites work
- 50 Years of First-Passage Percolation
- A max-type recursive model: some properties and open questions
- A spine approach to branching diffusions with applications to \({\mathcal L}^p\)-convergence of martingales
- Asymptotic behavior of densities for two-particle annihilating random walks
- Asymptotics for interacting particle systems onZ d
- Bounded size bias coupling: a gamma function bound, and universal Dickman-function behavior
- Branching random walks. École d'Été de Probabilités de Saint-Flour XLII -- 2012
- Concentration inequalities. A nonasymptotic theory of independence
- Concentration of measures via size-biased couplings
- Conceptual proofs of L L criteria for mean behavior of branching processes
- Diffusion-limited annihilating systems and the increasing convex order
- Foundations of Modern Probability
- Fundamentals of Stein's method
- scientific article; zbMATH DE number 568836 (Why is no real title available?)
- Limiting point processes for rescalings of coalescing and annihilating random walks on \(Z^ n\).
- New rates for exponential approximation and the theorems of Rényi and Yaglom
- Non-equilibrium phase transitions: activated random walks at criticality
- Parking functions for mappings
- Parking on a random tree
- Parking on the integers
- Parking on transitive unimodular graphs
- Probability on trees and networks
- Recurrence and density decay for diffusion-limited annihilating systems
- Renormalization group study of the A+B diffusion-limited reaction.
- Size bias for one and all
- Size biased couplings and the spectral gap for random regular graphs
- Spread of infections in a heterogeneous moving population
- Stochastic orders
- Stretched exponential decay for subcritical parking times on
- The depinning transition in presence of disorder: a toy model
- The Derrida-Retaux conjecture on recursive models
- The free energy in the Derrida-Retaux recursive model
- The long-time behavior of initially separated \(\text{A+B}\to 0\) reaction-diffusion systems with arbitrary diffusion constants
- To fixate or not to fixate in two-type annihilating branching random walks
- Two-type annihilating systems on the complete and star graph
- Unimodal, log-concave and Pólya frequency sequences in combinatorics
Cited in
(3)
This page was built for publication: Particle density in diffusion-limited annihilating systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6183253)
