Related papers: Unbounded subnormal weighted shifts on directed tr…

Robust adaptive control of scalar plants in the presence of unmodeled dynamics is established in this paper. It is shown that implementation of a projection algorithm with standard adaptive control of a scalar plant ensures global…

We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…

This article studies the Minimum Spanning Tree Problem under Explorable Uncertainty as well as a related vertex uncertainty version of the problem. We particularly consider special instance types, including cactus graphs, for which we…

Let $S_{\lambdab}$ be a bounded left-invertible weighted shift on a rootless directed tree $\mathcal T=(V, \mathcal E).$ We address the question of when $S_{\lambdab}$ has Wold-type decomposition. We relate this problem to the convergence…

In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply…

We introduce a new class of lower bounds on the log partition function of a Markov random field which makes use of a reversed Jensen's inequality. In particular, our method approximates the intractable distribution using a linear…

Coverings of undirected graphs are used in distributed computing, and unfoldings of directed graphs in semantics of programs. We study these two notions from a graph theoretical point of view so as to highlight their similarities, as they…

Considering the wired uniform spanning forest on a nonunimodular transitive graph, we show that almost surely each tree of the wired uniform spanning forest is light. More generally we study the tilted volumes for the trees in the wired…

We consider weighted ergodic averages indexed by primes, where the weight depends on the prime, and is a "trace function" coming from algebraic geometry. We obtain extensions the classical mean-ergodic and pointwise ergodic theorems, as…

In this paper, we investigate induced and nonlinear fiber topological pressure for random dynamical systems. We define a non-averaged induced fiber pressure via spanning and separated sets, characterize it as the pseudo-inverse of the…

We obtain new lower bounds on the critical points for various models of oriented percolation. The method is to provide a stochastic domination of the percolation processes by multitype Galton-Watson trees. This can be apply to the classical…

This study is dedicated to precise distributional analyses of the height of non-plane unlabelled binary trees ("Otter trees"), when trees of a given size are taken with equal likelihood. The height of a rooted tree of size $n$ is proved to…

The Rooted Maximum Leaf Outbranching problem consists in finding a spanning directed tree rooted at some prescribed vertex of a digraph with the maximum number of leaves. Its parameterized version asks if there exists such a tree with at…

This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…

Consider a class of null-recurrent randomly biased walks on a super-critical Gaton-Watson tree. We obtain the rates of convergence of the local times and the quenched local probability for the biased walk in the sub-diffusive case. These…

We study the limiting behavior of a Bienayme-Galton-Watson tree conditioned to have a large number of vertices and either a fixed number of leaves or a fixed number of internal nodes. The first biconditioning gives a universal result with…

We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that…

We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root…

Gurski and Wanke showed that a graph class C has bounded tree-width if and only if its associated class of directed line graphs has bounded clique-width. Inevitably -- asking whether this relationship lifts to directed graphs -- we…

We prove an extension of the Regularity Lemma with vertex and edge weights which can be applied for a large class of graphs. The applications involve random graphs and a weighted version of the Erd\H{o}s-Stone theorem. We also provide means…