Related papers: The algebraic method in tree percolation
We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…
We show, under natural conditions, that uniform rooted trees with fixed degree sequence converge after renormalization toward inhomogeneous continuum random trees (ICRT). We also provide a sharp upper-bound for the tail of their heights. We…
In this article, we introduce a formal definition of the concept of probability tree and conduct a detailed and comprehensive study of its fundamental structural properties. In particular, we define what we term an inductive probability…
We prove a new formula for the generating function of multitype Cayley trees counted according to their degree distribution. Using this formula we recover and extend several enumerative results about trees. In particular, we extend some…
Tree structured graphical models are powerful at expressing long range or hierarchical dependency among many variables, and have been widely applied in different areas of computer science and statistics. However, existing methods for…
Aromatic Butcher series were successfully introduced for the study and design of numerical integrators that preserve volume while solving differential equations in Euclidean spaces. They are naturally associated to pre-Lie-Rinehart algebras…
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…
The recursive and hierarchical structure of full rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. In most of these cases, the full rooted tree is…
This work considers the problem of learning the structure of multivariate linear tree models, which include a variety of directed tree graphical models with continuous, discrete, and mixed latent variables such as linear-Gaussian models,…
An ideal $I \subset \mathbb{k}[x_1, \ldots, x_n]$ is said to have linear powers if $I^k$ has a linear minimal free resolution, for all $k$. In this paper we study the Betti numbers of $I^k$, for ideals $I$ with linear powers. The Betti…
We study the scheme of formal arcs on a singular algebraic variety and its images under truncations. We prove a rationality result for the Poincare series of these images which is an analogue of the rationality of the Poincare series…
We introduce the class of vector-spread monomial ideals. This notion generalizes that of $t$-spread ideals introduced by Ene, Herzog and Qureshi. In particular, we focus on vector-spread strongly stable ideals, we compute their Koszul…
We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…
The arboreal gas is the probability measure on (unrooted spanning) forests of a graph in which each forest is weighted by a factor $\beta>0$ per edge. It arises as the $q\to 0$ limit of the $q$-state random cluster model with $p=\beta q$.…
Let $t$ be a rooted tree and $n_i(t)$ the number of nodes in $t$ having $i$ children. The degree sequence $(n_i(t),i\geq 0)$ of $t$ satisfies $\sum_{i\ge 0} n_i(t)=1+\sum_{i\ge 0} in_i(t)=|t|$, where $|t|$ denotes the number of nodes in…
Models of percolation processes on networks currently assume locally tree-like structures at low densities, and are derived exactly only in the thermodynamic limit. Finite size effects and the presence of short loops in real systems however…
We investigate the algebra and geometry of general interventions in discrete DAG models. To this end, we introduce a theory for modeling soft interventions in the more general family of staged tree models and develop the formalism to study…
We prove that the height of any algebraic computation tree for deciding membership in a semialgebraic set is bounded from below (up to a multiplicative constant) by the logarithm of m-th Betti number (with respect to singular homology) of…
We introduce a general framework of low regularity integrators which allows us to approximate the time dynamics of a large class of equations, including parabolic and hyperbolic problems, as well as dispersive equations, up to arbitrary…
Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…