相关论文: Invariant Percolation and Harmonic Dirichlet Funct…
An important conjecture in percolation theory is that almost surely no infinite cluster exists in critical percolation on any transitive graph for which the critical probability is less than 1. Earlier work has established this for the…
We consider the model of a directed polymer in a random environment defined on the infinite cluster of supercritical Bernoulli bond percolation in dimensions $d \geq 3$. For this model, it was proved in arXiv:2205.06206 that for almost…
We establish several equivalent characterisations of the anchored isoperimetric dimension of supercritical clusters in Bernoulli bond percolation on transitive graphs. We deduce from these characterisations together with a theorem of…
We introduce a strengthening of the notion of transience for planar maps in order to relax the standard condition of bounded degree appearing in various results, in particular, the existence of Dirichlet harmonic functions proved by…
We define the notion of an invariant function on a cluster ensemble with respect to an action of the cluster modular group on its associated function fields. We realize many examples of previously studied functions as elements of this type…
We study the existence and regularity of invariant graphs for bundle maps (or bundle correspondences with generating bundle maps motivated by ill-posed differential equations) having some relative partial hyperbolicity on non-trivial and…
In this paper, we study discrete harmonic functions on infinite penny graphs. For an infinite penny graph with bounded facial degree, we prove that the volume doubling property and the Poincar\'e inequality hold, which yields the Harnack…
We consider percolation on the Voronoi tessellation generated by a homogeneous Poisson point process on the hyperbolic plane. We show that the critical probability for the existence of an infinite cluster is asymptotically equal to $\pi…
Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…
A new Berry-Esseen bound for non-linear functionals of non-symmetric and non-homogeneous infinite Rademacher sequences is established. It is based on a discrete version of the Malliavin-Stein method and an analysis of the discrete…
This paper is concerned with an inverse wavenumber/frequency-dependent source problem for the Helmholtz equation. In two and three dimensions, the unknown source term is supposed to be compactly supported in spatial variables but…
We show that a large class of site percolation processes on any planar graph contains either zero or infinitely many infinite connected components. The assumptions that we require are: tail triviality, positive association (FKG) and that…
The spectral gap of the graph Laplacian with Dirichlet boundary conditions is computed for the graphs of several communication networks at the IP-layer, which are subgraphs of the much larger global IP-layer network. We show that the…
Hermon and Hutchcroft have recently proved the long-standing conjecture that in Bernoulli(p) bond percolation on any nonamenable transitive graph G, at any p > p_c(G), the probability that the cluster of the origin is finite but has a large…
We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta\geq 0$. Intuitively, larger $\beta$ means more randomness. In particular, at $\beta=0$ we start with loops…
We consider independent long-range percolation models on locally finite vertex-transitive graphs. Using coupling ideas we prove strict monotonicity of the critical points with respect to local perturbations in the connection function,…
Let $\mathbb{G}=\left(\mathbb{V},\mathbb{E}\right)$ be the graph obtained by taking the cartesian product of an infinite and connected graph $G=(V,E)$ and the set of integers $\mathbb{Z}$. We choose a collection $\mathcal{C}$ of finite…
We introduce and study some (infinite order) discrete derivative operators called Bernoulli operators. They are associated to a class of power series (tame power series), which include power series that converge in the unit disk, have at…