edoc: No conditions. Results ordered -Date Deposited. 2024-08-07T02:56:26ZEPrintshttps://edoc.unibas.ch/images/uni-logo.jpghttps://edoc.unibas.ch/2023-06-23T13:03:10Z2023-06-23T13:03:10Zhttps://edoc.unibas.ch/id/eprint/95047This item is in the repository with the URL: https://edoc.unibas.ch/id/eprint/950472023-06-23T13:03:10ZSurvival and complete convergence for a branching annihilating random walkWe study a discrete-time branching annihilating random walk (BARW) on the $d$-dimensional lattice. Each particle produces a Poissonian number of offspring with mean $\mu$ which independently move to a uniformly chosen site within a fixed distance $R$ from their parent's position. Whenever a site is occupied by at least two particles, all the particles at that site are annihilated. We prove that for any $\mu>1$ the process survives when $R$ is sufficiently large. For fixed $R$ we show that the process dies out if $\mu$ is too small or too large. Furthermore, we exhibit an interval of $\mu$-values for which the process survives and possesses a unique non-trivial ergodic equilibrium for $R$ sufficiently large. We also prove complete convergence for that case. Matthias BirknerAlice CallegaroJiří ČernýNina GantertPascal Oswald2023-06-23T12:58:35Z2023-06-23T12:58:35Zhttps://edoc.unibas.ch/id/eprint/95046This item is in the repository with the URL: https://edoc.unibas.ch/id/eprint/950462023-06-23T12:58:35ZCritical and near-critical level-set percolation of the Gaussian free field on regular treesFor the Gaussian free field on a $(d + 1)$-regular tree with $d \geq 2$, we study the percolative properties of its level sets in the critical and the near-critical regime. In particular, we show the continuity of the percolation probability, derive an exact symptotic tail estimate for the cardinality of the connected component of the critical level set, and describe the asymptotic behaviour of the percolation probability in the near-critical regime. Jiří ČernýRamon Locher2023-06-23T12:54:36Z2023-06-23T12:54:36Zhttps://edoc.unibas.ch/id/eprint/95045This item is in the repository with the URL: https://edoc.unibas.ch/id/eprint/950452023-06-23T12:54:36ZOn the tightness of the maximum of branching Brownian motion in random environmentWe consider one-dimensional branching Brownian motion in spatially random branching environment (BBMRE) and show that for almost every realisation of the environment, the distribution of the maximal particle of the BBMRE re-centred around its median is tight. This result is in stark contrast to the fact that the transition fronts in the solution to the randomised F-KPP equation are not bounded uniformly in time. In particular, this highlights that -- when compared to the setting of homogeneous branching -- the introduction of a random environment leads to a much more intricate situation. Jiří ČernýAlexander DrewitzPascal Oswald2021-07-23T13:25:33Z2021-07-23T13:25:33Zhttps://edoc.unibas.ch/id/eprint/84117This item is in the repository with the URL: https://edoc.unibas.ch/id/eprint/841172021-07-23T13:25:33ZCritical window for the vacant set left by random walk on the configuration modelWe study the simple random walk on the configuration model with given degree sequence $(d_1^n, \dots ,d_n^n)$ and investigate the connected components of its vacant set at level $u>0$. We show that the size of the maximal connected component exhibits a phase transition at level $u^*$ which can be related with the critical parameter of random interlacements on a certain Galton-Watson tree. We further show that there is a critical window of size $n^{-1/3}$ around $u^*$ in which the largest connected components of the vacant set have a metric space scaling limit resembling the one of the critical Erdős-Rényi random graph. Jiří ČernýThomas Hayder2021-06-25T14:56:44Z2021-06-25T14:56:44Zhttps://edoc.unibas.ch/id/eprint/83754This item is in the repository with the URL: https://edoc.unibas.ch/id/eprint/837542021-06-25T14:56:44ZTriviality of the geometry of mixed $p$-spin spherical Hamiltonians with external fieldWe study isotropic Gaussian random fields on the high-dimensional sphere with an added deterministic linear term, also known as mixed p-spin Hamiltonians with external field. We prove that if the external field is sufficiently strong, then the resulting function has trivial geometry, that is only two critical points. This contrasts with the situation of no or weak external field where these functions typically have an exponential number of critical points. We give an explicit threshold $h_c$ for the magnitude of the external fieldnecessary for trivialization and conjecture $h_c$ to be sharp. The Kac-Rice formula is our main tool. Our work extends [Fyo15], which identified the trivial regime for the special case of pure p-spin Hamiltonians with random external field. David BeliusJiří ČernýShuta NakajimaMarius Schmidt2021-06-08T09:46:07Z2021-06-08T09:46:07Zhttps://edoc.unibas.ch/id/eprint/83366This item is in the repository with the URL: https://edoc.unibas.ch/id/eprint/833662021-06-08T09:46:07ZLevel-set percolation of the Gaussian free field on regular graphs III: giant component on expandersWe consider the zero-average Gaussian free field on a certain class of finite $d$-regular graphs for fixed $d\ge 3$. This class includes $d$-regular expanders of large girth and typical realisations of random $d$-regular graphs. We show that the level set of the zero-average Gaussian free field above level $h$ has a giant component in the whole supercritical phase, that is for all $h<h_\star$, with probability tending to one as the size of the graphs tends to infinity. In addition, we show that this component is unique. This significantly improves the result of [AC20b], where it was shown that a linear fraction of vertices is in mesoscopic components if $h<h_\star$. Jiří Černý2021-04-12T13:12:34Z2021-04-12T13:12:34Zhttps://edoc.unibas.ch/id/eprint/81598This item is in the repository with the URL: https://edoc.unibas.ch/id/eprint/815982021-04-12T13:12:34ZLevel-set percolation of the Gaussian free field on regular graphs I: Regular treesWe study level-set percolation of the Gaussian free field on the infinite d-regular tree for fixed d >= 3. Denoting by h(*) the critical value, we obtain the following results: for h > h(*) we derive estimates on conditional exponential moments of the size of a fixed connected component of the level set above level h; for h < h(*) we prove that the number of vertices connected over distance k above level h to a fixed vertex grows exponentially in k with positive probability. Furthermore, we show that the percolation probability is a continuous function of the level h, at least away from the critical value h(*). Along the way we also obtain matching upper and lower bounds on the eigenfunctions involved in the spectral characterisation of the critical value h(*) and link the probability of a non-vanishing limit of the martingale used therein to the percolation probability. A number of the results derived here are applied in the accompanying paper [1]. Angelo AbächerliJiří Černý2021-04-12T13:08:40Z2021-04-12T13:08:40Zhttps://edoc.unibas.ch/id/eprint/81599This item is in the repository with the URL: https://edoc.unibas.ch/id/eprint/815992021-04-12T13:08:40ZLevel-set percolation of the Gaussian free field on regular graphs II: Finite expandersWe consider the zero-average Gaussian free field on a certain class of finite d-regular graphs for fixed d >= 3. This class includes d-regular expanders of large girth and typical realisations of random d-regular graphs. We show that the level set of the zero-average Gaussian free field above level h(*), exhibits a phase transition at level which agrees with the critical value for level-set percolation of the Gaussian free field on the infinite d-regular tree. More precisely, we show that, with probability tending to one as the size of the finite graphs tends to infinity, the level set above level h does not contain any connected component of larger than logarithmic size whenever h > h(*), and on the contrary, whenever h < h(*), linear fraction of the vertices is contained in connected components of the level set above level h having a size of at least a small fractional power of the total size of the graph. It remains open whether in the supercritical phase h < h(*), as the size of the graphs tends to infinity, one observes the emergence of a (potentially unique) giant connected component of the level set above level h. The proofs in this article make use of results from the accompanying paper [2]. Angelo AbächerliJiří Černý2021-04-12T13:02:47Z2021-04-12T13:02:47Zhttps://edoc.unibas.ch/id/eprint/81597This item is in the repository with the URL: https://edoc.unibas.ch/id/eprint/815972021-04-12T13:02:47ZQuenched invariance principles for the maximal particle in branching random walk in random environment and the parabolic Anderson modelWe consider branching random walk in spatial random branching environment (BRWRE) in dimension one, as well as related differential equations: the Fisher-KPP equation with random branching and its linearized version, the parabolic Anderson model (PAM). When the random environment is bounded, we show that after recentering and scaling, the position of the maximal particle of the BRWRE, the front of the solution of the PAM, as well as the front of the solution of the randomized Fisher-KPP equation fulfill quenched invariance principles. In addition, we prove that at time t the distance between the median of the maximal particle of the BRWRE and the front of the solution of the PAM is in 0(1110. This partially transfers classical results of Bramson (Comm. Pure Appl. Math. 31 (1978) 531-581) to the setting of BRWRE. Jiří ČernýAlexander Drewitz2021-02-10T16:39:36Z2021-02-10T16:39:36Zhttps://edoc.unibas.ch/id/eprint/81596This item is in the repository with the URL: https://edoc.unibas.ch/id/eprint/815962021-02-10T16:39:36ZMarkovian dynamics of exchangeable arraysJiří ČernýAnton Klimovsky2021-02-02T12:55:49Z2021-02-02T12:55:49Zhttps://edoc.unibas.ch/id/eprint/81644This item is in the repository with the URL: https://edoc.unibas.ch/id/eprint/816442021-02-02T12:55:49Z(Un-)bounded transition fronts for the parabolic Anderson model and the randomized F-KPP equationWe investigate the uniform boundedness of the fronts of the solutions to the randomized Fisher-KPP equation and to its linearization, the parabolic Anderson model. It has been known that for the standard (i.e. deterministic) Fisher-KPP equation, as well as for the special case of a randomized Fisher-KPP equation with so-called ignition type nonlinearity, one has a uniformly bounded (in time) transition front. Here, we show that this property of having a uniformly bounded transition front fails to hold for the general randomized Fisher-KPP equation. Nevertheless, we establish that this property does hold true for the parabolic Anderson model. Jiří ČernýAlexander DrewitzLars Schmitz2020-08-07T10:37:52Z2020-08-07T10:37:52Zhttps://edoc.unibas.ch/id/eprint/77958This item is in the repository with the URL: https://edoc.unibas.ch/id/eprint/779582020-08-07T10:37:52ZLevel-set percolation of the Gaussian free field on regular graphs II: Finite expandersWe consider the zero-average Gaussian free field on a certain class of finite $d$-regular graphs for fixed $d\geq 3$. This class includes $d$-regular expanders of large girth and typical realisations of random $d$-regular graphs. We show that the level set of the zero-average Gaussian free field above level $h$ exhibits a phase transition at level $h_\star$, which agrees with the critical value for level-set percolation of the Gaussian free field on the infinite $d$-regular tree. More precisely, we show that, with probability tending to one as the size of the finite graphs tends to infinity, the level set above level $h$ does not contain any connected component of larger than logarithmic size whenever $h>h_\star$, and on the contrary, whenever $h<h_\star$, a linear fraction of the vertices is contained in connected components of the level set above level $h$ having a size of at least a small fractional power of the total size of the graph. It remains open whether in the supercritical phase $h<h_\star$, as the size of the graphs tends to infinity, one observes the emergence of a (potentially unique) giant connected component of the level set above level $h$. The proofs in this article make use of results from the accompanying paper [AC1]. Angelo AbächerliJiří Černý2020-08-07T10:37:41Z2020-08-07T10:37:41Zhttps://edoc.unibas.ch/id/eprint/77904This item is in the repository with the URL: https://edoc.unibas.ch/id/eprint/779042020-08-07T10:37:41ZLevel-set percolation of the Gaussian free field on regular graphs I: Regular treesWe study level-set percolation of the Gaussian free field on the infinite $d$-regular tree for fixed $d\geq 3$. Denoting by $h_\star$ the critical value, we obtain the following results: for $h>h_\star$ we derive estimates on conditional exponential moments of the size of a fixed connected component of the level set above level $h$; for $h<h_\star$ we prove that the number of vertices connected over distance $k$ above level $h$ to a fixed vertex grows exponentially in $k$ with positive probability. Furthermore, we show that the percolation probability is a continuous function of the level $h$, at least away from the critical value $h_\star$. Along the way we also obtain matching upper and lower bounds on the eigenfunctions involved in the spectral characterisation of the critical value $h_\star$ and link the probability of a non-vanishing limit of the martingale used therein to the percolation probability. A number of the results derived here are applied in the accompanying paper [AC19]. Angelo AbächerliJiří Černý2020-03-11T09:59:57Z2021-02-26T04:10:37Zhttps://edoc.unibas.ch/id/eprint/73673This item is in the repository with the URL: https://edoc.unibas.ch/id/eprint/736732020-03-11T09:59:57ZConcentration of the Clock Process Normalisation for the Metropolis Dynamics of the REMIn Černý and Wassmer (Probab. Theory Relat. Fields 167:253–303, 2017) [8], it was shown that the clock process associated with the Metropolis dynamics of the Random Energy Model converges to an α-stable process, after being scaled by a random, Hamiltonian dependent, normalisation. We prove here that this random normalisation can be replaced by a deterministic one. Jiří Černý