Related papers: Boundedness of Gaussian random sums on trees
In this paper we show how to find nearly optimal embeddings of large trees in several natural classes of graphs. The size of the tree T can be as large as a constant fraction of the size of the graph G, and the maximum degree of T can be…
Suprema of random processes appear naturally in a plethora of disciplines, and Talagrand's majorizing theorem yields a geometric interpretation for them: for a centered Gaussian random process $(X_t)_{t \in T},$ $\mathbb{E}[\sup_{t \in…
We solve a problem of Krivelevich, Kwan and Sudakov [SIAM Journal on Discrete Mathematics 31 (2017), 155-171] concerning the threshold for the containment of all bounded degree spanning trees in the model of randomly perturbed dense graphs.…
Let $\mathcal{T}_n$ be the set of all mappings $T:[n]\to[n]$, where $[n]=\{1,2,\ldots,n\}$. The corresponding graph $G_T$ of $T$, called a functional digraph, is a union of disjoint connected components. Each component is a directed cycle…
We investigate the sub-Gaussian property for almost surely bounded random variables. If sub-Gaussianity per se is de facto ensured by the bounded support of said random variables, then exciting research avenues remain open. Among these…
We investigate the size of the embedded regular tree rooted at a vertex in a $d$ regular random graph. We show that almost always, the radius of this tree will be ${1/2}\log n$, where $n$ is the number of vertices in the graph. And we give…
We consider a Feller diffusion (Zs, s $\ge$ 0) (with diffusion coefficient $\sqrt$ 2$\beta$ and drift $\theta$ $\in$ R) that we condition on {Zt = at}, where at is a deterministic function, and we study the limit in distribution of 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…
Motivated by the statistical evaluation of complex computer models, we deal with the issue of objective prior specification for the parameters of Gaussian processes. In particular, we derive the Jeffreys-rule, independence Jeffreys and…
We study the additive functional $X_n(\alpha)$ on conditioned Galton-Watson trees given, for arbitrary complex $\alpha$, by summing the $\alpha$th power of all subtree sizes. Allowing complex $\alpha$ is advantageous, even for the study of…
Let $H$ be a fixed graph. The $H$-Transversal problem, given a graph $G$, asks to remove the smallest number of vertices from $G$ so that $G$ does not contain $H$ as a subgraph. While a simple $|V(H)|$-approximation algorithm exists and is…
Bounded infinite graphs are defined on the basis of natural physical requirements. When specialized to trees this definition leads to a natural conjecture that the average connectivity dimension of bounded trees cannot exceed two. We verify…
A tree $t$-spanner $T$ of a graph $G$ is a spanning tree of $G$ such that the distance in $T$ between every pair of verices is at most $t$ times the distance in $G$ between them. There are efficient algorithms that find a tree $t\cdot…
The probability that two randomly selected phylogenetic trees of the same size are isomorphic is found to be asymptotic to a decreasing exponential modulated by a polynomial factor. The number of symmetrical nodes in a random phylogenetic…
Let ${\cal T}$ be a rooted Galton-Watson tree with offspring distribution $\{p_k\}$ that has $p_0=0$, mean $m=\sum kp_k>1$ and exponential tails. Consider the $\lambda$-biased random walk $\{X_n\}_{n\geq 0}$ on ${\cal T}$; this is the…
We show that a necessary and sufficient condition for the sum of iid random vectors to converge (under appropriate shifting and scaling) to a multivariate Gaussian distribution is that the truncated second moment matrix is slowly varying at…
We discuss various forms of convergence of the vicinity of a uniformly at random selected vertex in random simply generated trees, as the size tends to infinity. For the standard case of a critical Galton-Watson tree conditioned to be large…
Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…
We consider the complex branching random walk on a dyadic tree with Gaussian weights on the boundary between the diffuse phase and the glassy phase. We study the branching random walk in the space of continuous functions and establish…
In this paper, we discuss vector-valued Gaussian processes for the approximation of divergence- or rotation-free functions. We establish the theory for such Gaussian processes, then link the theory to multivariate approximation theory, and…