相关论文: Breadth first search coding of multitype forests w…
An evolutionary tree is a cascade of bifurcations starting from a single common root, generating a growing set of daughter species as time goes by. Species here is a general denomination for biological species, spoken languages or any other…
We present a method for learning treewidth-bounded Bayesian networks from data sets containing thousands of variables. Bounding the treewidth of a Bayesian greatly reduces the complexity of inferences. Yet, being a global property of the…
We consider a random forest $\mathcal{F}^*$, defined as a sequence of i.i.d. birth-death (BD) trees, each started at time 0 from a single ancestor, stopped at the first tree having survived up to a fixed time $T$. We denote by…
We present a bijection between some quadrangular dissections of an hexagon and unrooted binary trees, with interesting consequences for enumeration, mesh compression and graph sampling. Our bijection yields an efficient uniform random…
In this paper, we present a distributed algorithm to compute various parameters of a tree such as the process number, the edge search number or the node search number and so the pathwidth. This algorithm requires n steps, an overall…
We revisit the Bayesian Context Trees (BCT) modelling framework for discrete time series, which was recently found to be very effective in numerous tasks including model selection, estimation and prediction. A novel representation of the…
In this series of articles we study connections between combinatorics of multidimensional generalizations of Cauchy identity and continuous objects such as multidimensional Brownian motions and Brownian bridges. In Part I of the series we…
Hash codes are a very efficient data representation needed to be able to cope with the ever growing amounts of data. We introduce a random forest semantic hashing scheme with information-theoretic code aggregation, showing for the first…
We consider the problem of change-point detection in multivariate time-series. The multivariate distribution of the observations is supposed to follow a graphical model, whose graph and parameters are affected by abrupt changes throughout…
We consider the evaluation of first-order queries over classes of databases with bounded expansion. The notion of bounded expansion is fairly broad and generalizes bounded degree, bounded treewidth and exclusion of at least one minor. It…
It is shown that a breadth-first search in a directed or undirected graph with $n$ vertices and $m$ edges can be carried out in $O(n+m)$ time with $n\log_2 3+O((\log n)^2)$ bits of working memory.
We consider a class of density-dependent branching processes which generalises exponential, logistic and Gompertz growth. A population begins with a single individual, grows exponentially initially, and then growth may slow down as the…
Motivated as a null model for comparison with data, we study the following model for a phylogenetic tree on $n$ extant species. The origin of the clade is a random time in the past, whose (improper) distribution is uniform on $(0,\infty)$.…
We consider the Wright-Fisher model for a population of $N$ individuals, each identified with a sequence of a finite number of sites, and single-crossover recombination between them. We trace back the ancestry of single individuals from the…
The Binary Space Partitioning~(BSP)-Tree process is proposed to produce flexible 2-D partition structures which are originally used as a Bayesian nonparametric prior for relational modelling. It can hardly be applied to other learning tasks…
Species tree estimation is a complex problem, due to the fact that different parts of the genome can have different evolutionary histories than the genome itself. One of the causes for this discord is incomplete lineage sorting (also called…
Joint distributions over many variables are frequently modeled by decomposing them into products of simpler, lower-dimensional conditional distributions, such as in sparsely connected Bayesian networks. However, automatically learning such…
The degree sequence $(n_{i,j}(k), 1\leq i,j\leq d, k\geq 0)$ of a multitype forest with $d$ types encodes the number of individuals of type $i$ with $k$ children of type $j$. In this paper, we introduce a simple algorithm to sample a…
It is well known that, given \(b\ge 0\), finding an $(a,b)$-trapping set with the minimum \(a\) in a binary linear code is NP-hard. In this paper, we demonstrate that this problem can be solved with linear complexity with respect to the…
Consider two ancestral lineages sampled from a system of two-dimensional branching random walks with logistic regulation in the stationary regime. We study the asymptotics of their coalescence time for large initial separation and find that…