Related papers: Importance sampling for maxima on trees
We introduce a novel approach based on stochastic optimization to find the optimal sampling distribution for the data-driven stability analysis of switched linear systems. Our goal is to address limitations of existing approaches, in…
This article is motivated by the objective of providing a new analytically tractable and fully frequentist framework to characterize and implement regression trees while also allowing a multivariate (potentially high dimensional) response.…
Over the past two decades, fair resource allocation problems have received considerable attention in a variety of application areas. However, little progress has been made in the design of distributed algorithms with convergence guarantees…
The solutions to a large class of semi-linear parabolic PDEs are given in terms of expectations of suitable functionals of a tree of branching particles. A sufficient, and in some cases necessary, condition is given for the integrability of…
The diameter distribution of a given species of deciduous trees in mature, temperate zone forests is well approximated by a Gamma distribution. Here we give new experimental evidence for this conjecture by analyzing deciduous tree size data…
We study the arboricity A and the maximum number T of edge-disjoint spanning trees of the Erdos-Renyi random graph G(n,p). For all p(n) in [0,1], we show that, with high probability, T is precisely the minimum between delta and…
We study the problem of maximizing the probability that (i) an electric component or financial institution $X$ does not default before another component or institution $Y$ and (ii) that $X$ and $Y$ default jointly within the class of all…
On the $Z^2$ lattice, vertices are assigned random weights $W(i,j)$. The point-to-point last passage percolation (LPP) time $S_{M,N+1-M}$ between $(1,1)$ and $(M,N+1-M)$ is the maximum total weight among all upward/right-oriented paths…
In this paper considering the transformation $X=\frac{Y}{1+Y}$, where $Y \sim\text{Lindley}(\theta)$, we propose the unit-Lindley distribution and investigate some of its mathematical properties. A important fact associated with this new…
Determinantal point processes (DPPs) have wide-ranging applications in machine learning, where they are used to enforce the notion of diversity in subset selection problems. Many estimators have been proposed, but surprisingly the basic…
Consider a critical branching L\'{e}vy process $\{X_t, t\ge 0\}$ with branching rate $\beta>0, $ offspring distribution $\{p_k:k\geq 0\}$ and spatial motion $\{\xi_t, \Pi_x\}$. For any $t\ge 0$, let $N_t$ be the collection of particles…
Let $W_i,i\in{\mathbb{N}}$, be independent copies of a zero-mean Gaussian process $\{W(t),t\in{\mathbb{R}}^d\}$ with stationary increments and variance $\sigma^2(t)$. Independently of $W_i$, let $\sum_{i=1}^{\infty}\delta_{U_i}$ be a…
Let $P_N$ be a uniform random $N\times N$ permutation matrix and let $\chi_N(z)=\det(zI_N- P_N)$ denote its characteristic polynomial. We prove a law of large numbers for the maximum modulus of $\chi_N$ on the unit circle, specifically, \[…
The ratio between the probability that two distributions $R$ and $P$ give to points $x$ are known as importance weights or propensity scores and play a fundamental role in many different fields, most notably, statistics and machine…
This paper presents an analysis of the stochastic recursion $W_{i+1} = [V_iW_i+Y_i]^+$ that can be interpreted as an autoregressive process of order 1, reflected at 0. We start our exposition by a discussion of the model's stability…
In Bayesian inference, the maximum a posteriori (MAP) problem combines the most probable explanation (MPE) and marginalization (MAR) problems. The counterpart in propositional logic is the exist-random stochastic satisfiability (ER-SSAT)…
In this paper, we consider the maximization of a probability $\mathbb{P}\{ \zeta \mid \zeta \in \mathbf{K}(\mathbf x)\}$ over a closed and convex set $\mathcal X$, a special case of the chance-constrained optimization problem. We define…
We prove an asymptotic Edgeworth expansion for the profiles of certain random trees including binary search trees, random recursive trees and plane-oriented random trees, as the size of the tree goes to infinity. All these models can be…
We analyze the eigenvalues of the adjacency matrices of a wide variety of random trees. Using general, broadly applicable arguments based on the interlacing inequalities for the eigenvalues of a principal submatrix of a Hermitian matrix and…
In a complete graph $K_n$ with edge weights drawn independently from a uniform distribution $U(0,1)$ (or alternatively an exponential distribution $\operatorname{Exp}(1)$), let $T_1$ be the MST (the spanning tree of minimum weight) and let…