相关论文: Domination Between Trees and Application to an Exp…

The dynamical processes taking place on a network depend on its topology. Influencing the growth process of a network therefore has important implications on such dynamical processes. We formulate the problem of influencing the growth of a…

Within machine learning, the supervised learning field aims at modeling the input-output relationship of a system, from past observations of its behavior. Decision trees characterize the input-output relationship through a series of nested…

We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly $n$ vertices. These trees are embedded in the real line by affecting spatial positions to the vertices, in such a way that the…

We address the problem of building and maintaining distributed spanning trees in highly dynamic networks, in which topological events can occur at any time and any rate, and no stable periods can be assumed. In these harsh environments, we…

Formation and competition of associations are studied in a six-species ecological model where each species has two predators and two prey. Each site of a square lattice is occupied by an individual belonging to one of the six species. The…

Convex combinations of i.i.d. random variables without a finite mean can behave in a strikingly different way from the finite-mean case: as the weight vector becomes more balanced, the resulting combination may become stochastically larger,…

We study the stochastic evolution of four species in cyclic competition in a well mixed environment. In systems composed of a finite number $N$ of particles these simple interaction rules result in a rich variety of extinction scenarios,…

Finding the most powerful node in a dynamic random network, the largest set in a partition-valued stochastic process, or the largest family in an evolving population at a given time, can be a very difficult problem. This is particularly the…

Random-cluster measures on infinite regular trees are studied in conjunction with a general type of `boundary condition', namely an equivalence relation on the set of infinite paths of the tree. The uniqueness and non-uniqueness of…

A permutation $\boldsymbol w$ gives rise to a graph $G_{\boldsymbol w}$; the vertices of $G_{\boldsymbol w}$ are the letters in the permutation and the edges of $G_{\boldsymbol w}$ are the inversions of $\boldsymbol w$. We find that the…

We consider the problem of \emph{pruning} a classification tree, that is, selecting a suitable subtree that balances bias and variance, in common situations with inhomogeneous training data. Namely, assuming access to mostly data from a…

This paper considers the problem of steering an arbitrary initial probability density function to an arbitrary terminal one, where the system dynamics is governed by a first-order linear stochastic difference equation. It is a…

In order to conduct a statistical analysis on a given set of phylogenetic gene trees, we often use a distance measure between two trees. In a statistical distance-based method to analyze discordance between gene trees, it is a key to decide…

We study rooted planar random trees with a probability distribution which is proportional to a product of weight factors $w_n$ associated to the vertices of the tree and depending only on their individual degrees $n$. We focus on the case…

The reconstruction of a central tendency `species tree' from a large number of conflicting gene trees is a central problem in systematic biology. Moreover, it becomes particularly problematic when taxon coverage is patchy, so that not all…

An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary trees are useful for modeling the evolutionary history of…

The forest of mutations associated to a multitype branching forest is obtained by merging together all vertices of its clusters and by preserving connections between them. We first show that the forest of mutations of any mulitype branching…

The domination number $\gamma(G)$ of a graph $G$, its exponential domination number $\gamma_e(G)$, and its porous exponential domination number $\gamma_e^*(G)$ satisfy $\gamma_e^*(G)\leq \gamma_e(G)\leq \gamma(G)$. We contribute results…

We consider the dynamics of a population spatially structured in colonies that are vulnerable to catastrophic events occurring at random times, which randomly reduce their population size and compel survivors to disperse to neighboring…

Consider a species whose population density solves the steady diffusive logistic equation in a heterogeneous environment modeled with the help of a spatially non constant coefficient standing for a resources distribution in a given box. We…