Related papers: The Erlang Weighted Tree, A New Branching Process
The evolution of aligned DNA sequence sites is generally modeled by a Markov process operating along the edges of a phylogenetic tree. It is well known that the probability distribution on the site patterns at the tips of the tree…
We study the evolution of a positive operator under weighted residual maps determined by a finite family of orthogonal projections. Iterating these maps along the rooted tree of multi-indices produces a "weighted residual energy tree",…
Let $T$ be the extinction moment of a critical branching process $Z=(Z_{n},n\geq 0) $ in a random environment specified by iid probability generating functions. We study the asymptotic behavior of the probability of extinction of the…
The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…
We destroy a finite tree of size $n$ by cutting its edges one after the other and in uniform random order. Informally, the associated cut-tree describes the genealogy of the connected components created by this destruction process. We…
Let T be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The lambda-biased random walk (X_t, t>=0) on T is the nearest-neighbor random walk which, when at a…
We introduce a new percolation model to describe and analyze the spread of an epidemic on a general directed and locally finite graph. We assign a two-dimensional random weight vector to each vertex of the graph in such a way that the…
Warning Propagation is a combinatorial message passing algorithm that unifies and generalises a wide variety of recursive combinatorial procedures. Special cases include the Unit Clause Propagation and Pure Literal algorithms for…
In this paper we describe a randomized algorithm which returns a maximal spanning forest of an unknown {\em weighted} undirected graph making $O(n)$ $\mathsf{CUT}$ queries in expectation. For weighted graphs, this is optimal due to a result…
We prove that any graph $G$ with $n$ points has a distribution $\mathcal{T}$ over spanning trees such that for any edge $(u,v)$ the expected stretch $E_{T \sim \mathcal{T}}[d_T(u,v)/d_G(u,v)]$ is bounded by $\tilde{O}(\log n)$. Our result…
It is well-known that conditioning a supercritical (multi-type) branching process on the event that it eventually becomes extinct yields a subcritical branching process. We study the corresponding inverse problem: given a subcritical…
We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…
A recent conjecture of Fyodorov--Hiary--Keating states that the maximum of the absolute value of the Riemann zeta function on a typical bounded interval of the critical line is $\exp\{\log \log T -\frac{3}{4}\log \log \log T+O(1)\}$, for an…
We study probabilities of various rare events for the limiting point process that appears at the random matrix hard edge. We also show a transition from hard edge to bulk behavior. Asymptotic events studied include a central limit theorem…
Using graphical methods based on a `lookdown' and pruned version of the {\em ancestral selection graph}, we obtain a representation of the type distribution of the ancestor in a two-type Wright-Fisher population with mutation and selection,…
Variational approximation, such as mean-field (MF) and tree-reweighted (TRW), provide a computationally efficient approximation of the log-partition function for a generic graphical model. TRW provably provides an upper bound, but the…
Given an undirected graph $G = (V, E)$ and a weight function $w:E \to \mathbb{R}$, the \textsc{Minimum Dominating Tree} problem asks to find a minimum weight sub-tree of $G$, $T = (U, F)$, such that every $v \in V \setminus U$ is adjacent…
The statistics of natural catastrophes contains very counter-intuitive results. Using earthquakes as a working example, we show that the energy radiated by such events follows a power-law or Pareto distribution. This means, in theory, that…
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…
In this paper we prove a scaling limit result for the component of the root in the Wired Minimal Spanning Forest (WMSF) of the Poisson-Weighted Infinite Tree (PWIT), where the latter tree arises as the local weak limit of the Minimal…