Related papers: Domination Between Trees and Application to an Exp…
In multi-class communication networks, traffic surges due to one class of users can significantly degrade the performance for other classes. During these transient periods, it is thus of crucial importance to implement priority mechanisms…
Motivated by the applications, a class of optimal control problems is investigated, where the goal is to influence the behavior of a given population through another controlled one interacting with the first. Diffusive terms accounting for…
A dual control problem is presented for the optimal stochastic control of a system governed by partial differential equations. Relationships between the optimal values of the original and the dual problems are investigated and two duality…
It follows from a classical result of Jordan that every tree with maximum degree at most $r$ containing a vertex set labeled by $[n]$, has a single-edge cut which separates two subsets $A,B \subset [n]$ for which $\min\{|A|,|B|\} \ge…
Understanding the evolution of a set of genes or species is a fundamental problem in evolutionary biology. The problem we study here takes as input a set of trees describing {possibly discordant} evolutionary scenarios for a given set of…
Quantitative predictions about the processes that promote species coexistence are a subject of active research in ecology. In particular, competitive interactions are known to shape and maintain ecological communities, and situations where…
We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…
Tree ensembles are one of the most widely used model classes. However, these models are susceptible to adversarial examples, i.e., slightly perturbed examples that elicit a misprediction. There has been significant research on designing…
We consider a control problem constrained by the unsteady stochastic Stokes equations with nonhomogeneous boundary conditions in connected and bounded domains. In this paper, controls are defined inside the domain as well as on the…
A spanning tree of a graph $G$ is a connected acyclic spanning subgraph of $G$. We consider enumeration of spanning trees when $G$ is a $2$-tree, meaning that $G$ is obtained from one edge by iteratively adding a vertex whose neighborhood…
We study how iterated convolutions of probability measures compare under stochastic domination. We give necessary and sufficient conditions for the existence of an integer $n$ such that $\mu^{*n}$ is stochastically dominated by $\nu^{*n}$…
The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have a definable choice function (by a monadic formula with…
Consider the following heuristic for building a decision tree for a function $f : \{0,1\}^n \to \{\pm 1\}$. Place the most influential variable $x_i$ of $f$ at the root, and recurse on the subfunctions $f_{x_i=0}$ and $f_{x_i=1}$ on the…
In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the domination number. Given the sheer scale of modern networks, many existing domination type structures are expensive to…
Elementary decision-theoretic analysis of the Monty Hall dilemma shows that the problem has dominance. This makes possible to discard nonswitching strategies, without making any assumptions on the prior distribution of factors out of…
The properties of randomly evolving special trees having defined and analyzed already in two earlier papers (arXiv:cond-mat/0205650 and arXiv:cond-mat/0211092) have been investigated in the case when the continuous time parameter converges…
We give a unified treatment of the limit, as the size tends to infinity, of simply generated random trees, including both the well-known result in the standard case of critical Galton--Watson trees and similar but less well-known results in…
Recently several authors have proposed stochastic evolutionary models for the growth of complex networks that give rise to power-law distributions. These models are based on the notion of preferential attachment leading to the ``rich get…
A stochastic forest model of young and old age class trees is studied. First, we prove existence, uniqueness and boundedness of global nonnegative solutions. Second, we investigate asymptotic behavior of solutions by giving a sufficient…
Dynamic regression trees are an attractive option for automatic regression and classification with complicated response surfaces in on-line application settings. We create a sequential tree model whose state changes in time with the…