Liouville dynamical percolation
نویسندگان
چکیده
We construct and analyze a continuum dynamical percolation process which evolves in random environment given by $$\gamma $$ -Liouville measure. The homogeneous counterpart of this describes the scaling limit discrete on rescaled triangular lattice. Our focus here is to study same limiting dynamics, but where speed microscopic updates highly inhomogeneous space driven measure associated with two-dimensional log-correlated field h. Roughly speaking, very rapidly h high barely moves low. main results can be summarized as follows.
منابع مشابه
Liouville Lost, Liouville Regained: Central Charge in a Dynamical Background
Several recent approaches to black hole entropy obtain the density of states from the central charge of a Liouville theory. If Liouville theory is coupled to a dynamical spacetime background, however, the classical central charge vanishes. I show that the central charge can be restored by introducing appropriate constraints, which may be interpreted as fall-off conditions at a boundary such as ...
متن کاملA survey of dynamical percolation
Percolation is one of the simplest and nicest models in probability theory/statistical mechanics which exhibits critical phenomena. Dynamical percolation is a model where a simple time dynamics is added to the (ordinary) percolation model. This dynamical model exhibits very interesting behavior. Our goal in this survey is to give an overview of the work in dynamical percolation that has been do...
متن کاملDynamical Percolation on General Trees
Häggström, Peres, and Steif (1997) have introduced a dynamical version of percolation on a graph G. When G is a tree they derived a necessary and sufficient condition for percolation to exist at some time t. In the case that G is a spherically symmetric tree, Peres and Steif (1998) derived a necessary and sufficient condition for percolation to exist at some time t in a given target set D. The ...
متن کاملDynamical sensitivity of the infinite cluster in critical percolation
In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last decade. Here we focus on graphs which percolate at criticality, and investigate the dynamical sensitivity of the infinite cluster. We first give two examples of...
متن کاملOn near-critical and dynamical percolation in the tree case
Consider independent bond percolation with retention probability p on a spherically symmetric tree Γ. Write θΓ(p) for the probability that the root is in an infinite open cluster, and define the critical value pc = inf{p : θΓ(p) > 0}. If θΓ(pc) = 0, then the root may still percolate in the corresponding dynamical percolation process at the critical value pc, as demonstrated recently by Häggströ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability Theory and Related Fields
سال: 2021
ISSN: ['0178-8051', '1432-2064']
DOI: https://doi.org/10.1007/s00440-021-01057-1