相关论文: Gaussian free field on the tree subject to a hard …
This is the second in a series of two works which study the discrete Gaussian free field on the binary tree when all leaves are conditioned to be positive. In the first work ("Gaussian free field on the tree subject to a hard wall I:…
We consider a branching random walk on a $d$-ary tree of height $n$ ($n \in \mathbb{N}$), under the presence of a hard wall which restricts each value to be positive, where $d$ is a natural number satisfying $d\geqslant2$. The question of…
We study the discrete Gaussian free field (harmonic crystal) on $\mathbb{Z}^d$, $d\geq 3$, with uniformly elliptic and bounded random conductances sampled according to a sufficiently mixing environment measure. We consider the hard wall…
We estimate the probability that the discrete Gaussian free field on a planar domain with Dirichlet boundary conditions stays positive in the bulk. Improving upon the result by Bolthausen, Deuschel and Giacomin from 2001, we derive the…
Boundary constraints in physical, environmental and engineering models restrict smooth states such as temperature to follow known physical laws at the edges of their spatio-temporal domain. Examples include fixed-state or fixed-derivative…
We provide uniform bounds and asymptotics for the probability that a two-dimensional discrete Gaussian free field on an annulus-like domain and with Dirichlet boundary conditions stays negative as the ratio of the radii of the inner and the…
We consider the lattice version of the free field in two dimensions and study the fractal structure of the sets where the field is unusually high (or low). We then extend some of our computations to the case of the free field conditioned on…
We investigate the realizations of a random Gaussian field on a finite domain of ${\mathbb R}^d$ in the limit where a given linear functional of the field is large. We prove that if its variance is bounded, the field converges uniformly and…
We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly $n$ vertices. These trees are embedded in the real line by affecting spatial positions to the vertices, in such a way that the…
Suppose that the edges of a complete graph are assigned weights independently at random and we ask for the weight of the minimal-weight spanning tree, or perfect matching, or Hamiltonian cycle. For these and several other common…
In this paper we investigate the geometry of a discrete Bayesian network whose graph is a tree all of whose variables are binary and the only observed variables are those labeling its leaves. We provide the full geometric description of…
We consider a Brownian motion with linear drift that splits at fixed time points into a fixed number of branches, which may depend on the branching point. For this process, which we shall refer to as the Brownian decision tree, we…
We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these…
We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…
Several classical results on boundary crossing probabilities of Brownian motion and random walks are extended to asymptotically Gaussian random fields, which include sums of i.i.d. random variables with multidimensional indices,…
Given a Galton-Watson process conditioned to have total progeny equal to $n$, we study the asymptotic probability that this conditioned Galton-Watson process has distance to the border bigger or equal than $k$, as the number of nodes $n…
We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…
In this paper we show that on bounded degree graphs and general trees, the cover time of the simple random walk is asymptotically equal to the product of the number of edges and the square of the expected supremum of the Gaussian free field…
We consider the maximum of the discrete two dimensional Gaussian free field in a box, and prove the existence of a (dense) deterministic subsequence along which the maximum, centered at its mean, is tight; this still leaves open the…
We provide a complete description of possible covariance matrices consistent with a Gaussian latent tree model for any tree. We then present techniques for utilising these constraints to assess whether observed data is compatible with that…