Related papers: Protected Vertices in Motzkin trees
For a random graph on n vertices where the edges appear with individual rates, we give exact formulas for the expected time at which the number of components has gone down to k and the expected length of the corresponding minimal spanning…
To a higher rank directed graph $(\Lambda, d)$, in the sense of Kumjian and Pask, one can associate natural noncommutative analytic Toeplitz algebras, both weakly closed and norm closed. We introduce methods for the classification of these…
We consider a space of sparse Boolean matrices of size $n \times n$, which have finite co-rank over $GF(2)$ with high probability. In particular, the probability such a matrix has full rank, and is thus invertible, is a positive constant…
A well-known bijection between Motzkin paths and ordered trees with outdegree always $\le2$, is lifted to Grand Motzkin paths (the nonnegativity is dropped) and an ordered list of an odd number of such $\{0,1,2\}$ trees. This offers an…
It is known that the core of mathematics is natural numbers. And everything related to the natural number is interesting to mathematicians. In this paper, we draw parallels between natural numbers and elements of a non-numeric lexicographic…
We explore credit risk pricing by modeling equity as a call option and debt as the difference between the firm's asset value and a put option, following the structural framework of the Merton model. Our approach proceeds in two stages:…
Let $\mathcal{T}_n$ denote the set of all unrooted and unlabeled trees with $n$ vertices, and $(i,j)$ a double-star. By assuming that every tree of $\mathcal{T}_n$ is equally likely, we show that the limiting distribution of the number of…
By developing the entropy theory of random walks on equivalence relations and analyzing the asymptotic geometry of horospheric products we describe the Poisson boundary for random walks on random horospheric products of trees.
In this extended abstract, we present a PTAS for guarding the vertices of a weakly-visible polygon $P$ from a subset of its vertices, or in other words, a PTAS for computing a minimum dominating set of the visibility graph of the vertices…
In this article we discuss estimation of the common variance of several normal populations with tree order restricted means. We discuss the asymptotic properties of the maximum likelihood estimator of the variance as the number of…
Let $G$ be a finite tree with root $r$ and associate to the internal vertices of $G$ a collection of transition probabilities for a simple nondegenerate Markov chain. Embedd $G$ into a graph $G^\prime$ constructed by gluing finite linear…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
We consider a marking procedure of the vertices of a tree where each vertex is marked independently from the others with a probability that depends only on its out-degree. We prove that a critical Galton-Watson tree conditioned on having a…
Vertex-reinforced random walk is defined in Pemantle's (1988) thesis; it is a random walk that is biased to visit sites it has already visited a lot. We show that this reinforcement scheme, in contrast to the scheme of edge-reinforcement,…
In dealing with asymptotic approximation of possibly divergent nets of probability distributions, we are led to study uniform structures on the set of distributions. This paper identifies a class of such uniform structures that may be…
We show connection between Dyck paths with peaks of bounded height and random walks. The correspondence between a certain class of random walks and such Dyck paths allows us to develop a probabilistic perspective on Chebyshev polynomials.
Vortices symmetric with respect to simultaneous parity and time reversing transformations are considered on the square lattice in the framework of the discrete nonlinear Schr\"{o}dinger equation. The existence and stability of vortex…
Matrix completion algorithms recover a low rank matrix from a small fraction of the entries, each entry contaminated with additive errors. In practice, the singular vectors and singular values of the low rank matrix play a pivotal role for…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…
Several indices that measure the degree of balance of a rooted phylogenetic tree have been proposed so far in the literature. In this work we define and study a new index of this kind, which we call the total cophenetic index: the sum, over…