English
Related papers

Related papers: A representation for exchangeable coalescent trees…

200 papers

We propose a random forest estimator for the intensity of spatial point processes, applicable with or without covariates. It retains the well-known advantages of a random forest approach, including the ability to handle a large number of…

Methodology · Statistics 2025-11-13 Christophe Biscio , Frédéric Lavancier

We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In…

Probability · Mathematics 2012-11-12 Bo Chen , Matthias Winkel

Phylogenetic networks are a generalization of evolutionary or phylogenetic trees that are commonly used to represent the evolution of species which cross with one another. A special type of phylogenetic network is an {\em $X$-cactus}, which…

Populations and Evolution · Quantitative Biology 2021-09-08 Andrew Francis , Katharina T. Huber , Vincent Moulton , Taoyang Wu

For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.

Probability · Mathematics 2007-05-23 Alexander Gnedin

We propose and study a multi-scale approach to vector quantization. We develop an algorithm, dubbed reconstruction trees, inspired by decision trees. Here the objective is parsimonious reconstruction of unsupervised data, rather than…

Machine Learning · Computer Science 2019-09-05 Enrico Cecini , Ernesto De Vito , Lorenzo Rosasco

This paper presents a new probabilistic generative model for image segmentation, i.e. the task of partitioning an image into homogeneous regions. Our model is grounded on a mid-level image representation, called a region tree, in which…

Machine Learning · Statistics 2015-06-15 Shell X. Hu , Christopher K. I. Williams , Sinisa Todorovic

This paper considers the probabilistic representation of the solutions of ordinary differential equations (ODEs) by the generation of marked random trees in which marks can be interpreted as mutant types in population genetics models. We…

Probability · Mathematics 2025-11-11 Qiao Huang , Nicolas Privault

We study the generating function of rooted and unrooted hyperforests in a general complete hypergraph with n vertices by using a novel Grassmann representation of their generating functions. We show that this new approach encodes the known…

Mathematical Physics · Physics 2008-11-26 Andrea Bedini , Sergio Caracciolo , Andrea Sportiello

We investigate a neutral model for speciation and extinction, the constant rate birth-death process. The process is conditioned to have $n$ extant species today, we look at the tree distribution of the reconstructed trees-- i.e. the trees…

Probability · Mathematics 2008-03-04 Tanja Gernhard

The purpose of this article is to show how the isotropy subgroup of leaf permutations on binary trees can be used to systematically identify tree-informative invariants relevant to models of phylogenetic evolution. In the quartet case, we…

Quantitative Methods · Quantitative Biology 2012-04-24 J G Sumner , P D Jarvis

Fermat-Weber points with respect to an asymmetric tropical distance function are studied. It turns out that they correspond to the optimal solutions of a transportation problem. The results are applied to obtain a new method for computing…

Combinatorics · Mathematics 2025-12-30 Andrei Comăneci , Michael Joswig

We consider the generalized Ornstein- Uhlenbeck equation $\partial_t X=-m X_t+\eta$. In this paper We construct the L\'evy noise $\eta$. The generalized Ornstein- Uhlenbeck process $X_t$ will be represented by a special types of graphs…

Probability · Mathematics 2013-12-03 Boubaker Smii

We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…

Probability · Mathematics 2026-03-06 Arthur Blanc-Renaudie , Emmanuel Kammerer

We propose a novel methodology, forest floor, to visualize and interpret random forest (RF) models. RF is a popular and useful tool for non-linear multi-variate classification and regression, which yields a good trade-off between robustness…

Machine Learning · Statistics 2016-07-05 Soeren H. Welling , Hanne H. F. Refsgaard , Per B. Brockhoff , Line H. Clemmensen

We consider the task of learning Ising models when the signs of different random variables are flipped independently with possibly unequal, unknown probabilities. In this paper, we focus on the problem of robust estimation of…

Machine Learning · Statistics 2020-06-11 Ashish Katiyar , Vatsal Shah , Constantine Caramanis

In 1998, B\"{o}cker and Dress gave a 1-to-1 correspondence between symbolically dated rooted trees and symbolic ultrametrics. We consider the corresponding problem for unrooted trees. More precisely, given a tree $T$ with leaf set $X$ and a…

Combinatorics · Mathematics 2018-01-19 Stefan Grünewald , Yangjing Long , Yaokun Wu

Consider a continuous time Markov chain with rates Q in the state space \Lambda\cup\{0\} with 0 as an absorbing state. In the associated Fleming-Viot process N particles evolve independently in \Lambda with rates Q until one of them…

Probability · Mathematics 2009-05-12 Amine Asselah , Pablo A. Ferrari , Pablo Groisman

We construct a measure-valued equivalent to the spatial Lambda-Fleming-Viot process (SLFV) introduced in [Eth08]. In contrast with the construction carried out in [Eth08], we fix the realization of the sequence of reproduction events and…

Probability · Mathematics 2013-09-04 Amandine Veber , Anton Wakolbinger

Nested (or reconciled) phylogenetic trees model co-evolutionary systems in which one evolutionary history is embedded within another. We introduce a geometric framework for such systems by defining $\sigma$-space, a moduli space of fully…

Combinatorics · Mathematics 2026-04-16 G. Grindstaff , R. S. Hoekzema

We study (plane) tree-valued Markov chains $(T_n,n \geq 1)$ with uniform backward dynamics and show that they can be obtained by sampling from a real tree. As non--plane trees, every such Markov chain is represented by a weighted real tree.…

Probability · Mathematics 2026-03-17 David Geldbach