相关论文: Conditioned Brownian trees

Consider a rooted tree $T$ with leaf-set $[n]$, and with all non-leaf vertices having out-degree $2$, at least. A rooted tree $\mathcal T$ with leaf-set $S\subset [n]$ is induced by $S$ in $T$ if $\mathcal T$ is the lowest common ancestor…

Consider a rooted binary tree with n nodes. Assign with the root the abscissa 0, and with the left (resp. right) child of a node of abscissa i the abscissa i-1 (resp. i+1). We prove that the number of binary trees of size n having exactly…

Strong Disorder Renormalization for the Random Transverse Field Ising model leads to a complicated topology of surviving clusters as soon as $d>1$. Even if one starts from a Cayley tree, the network of surviving renormalized clusters will…

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…

Let $T$ be an infinite rooted tree with weights $w_e$ assigned to its edges. Denote by $m_n(T)$ the minimum weight of a path from the root to a node of the $n$th generation. We consider the possible behaviour of $m_n(T)$ with focus on the…

For a continuous function $f \in \mathcal{C}([0,1])$, define the Vervaat transform $V(f)(t):=f(\tau(f)+t \mod1)+f(1)1_{\{t+\tau(f) \geq 1\}}-f(\tau(f))$, where $\tau(f)$ corresponds to the first time at which the minimum of $f$ is attained.…

We consider the paths of a Gaussian random process $x(t)$, $x(0)=0$ not exceeding a fixed positive level over a large time interval $(0,T)$, $T\gg 1$. The probability $p(T)$ of such event is frequently a regularly varying function at…

A Brownian motion tree (BMT) model is a Gaussian model whose associated set of covariance matrices is linearly constrained according to common ancestry in a phylogenetic tree. We study the complexity of inferring the maximum likelihood (ML)…

We introduce a novel interpretable tree based algorithm for prediction in a regression setting. Our motivation is to estimate the unknown regression function from a functional decomposition perspective in which the functional components…

The model consists of a signal process $X$ which is a general Brownian diffusion process and an observation process $Y$, also a diffusion process, which is supposed to be correlated to the signal process. We suppose that the process $Y$ is…

A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown parent datum. The latent graph structure is assumed to lie in…

We consider branching Brownian motion in which initially there is one particle at $x$, particles produce a random number of offspring with mean $m+1$ at the time of branching events, and each particle branches at rate $\beta = 1/2m$.…

Nonintersecting Brownian bridges on the unit circle form a determinantal stochastic process exhibiting random matrix statistics for large numbers of walkers. We investigate the effect of adding a drift term to walkers on the circle…

We study a classical Bayesian statistics problem of sequentially testing the sign of the drift of an arithmetic Brownian motion with the $0$-$1$ loss function and a constant cost of observation per unit of time for general prior…

Tree rotations (left and right) are basic local deformations allowing to transform between two unlabeled binary trees of the same size. Hence, there is a natural problem of practically finding such transformation path with low number of…

We prove the existence of scaling limits for the projection on the backbone of the random walks on the Incipient Infinite Cluster and the Invasion Percolation Cluster on a regular tree. We treat these projected random walks as randomly…

We consider a renewal process that is conditioned on the number of events in a fixed time horizon. We prove that a centered and scaled version of this process converges to a Brownian bridge, as the number of events grows large, which relies…

We obtain an exact formula for the probability that a uniformly random spanning tree of the $2$-by-$n$ square grid is ``balanced'' in the sense that it has an edge whose removal partitions its vertices into two sets of equal size. We…

We consider an empirical process based upon ratio of selected pair of the non-overlapping $m$-spacings generated by independent samples of arbitrary sizes. As a main result, we show that when both samples are uniformly distributed on…

We construct a new family of random permutons, called skew Brownian permuton, which describes the limits of several models of random constrained permutations. This family is parametrized by two real parameters. For a specific choice of the…