Related papers: A model for random braiding in graph configuration…
Many random flows, including 2D unsteady and stagnation-free 3D steady flows, exhibit non-trivial braiding of pathlines as they evolve in time or space. We show that these random flows belong to a pathline braiding \emph{universality class}…
The time process of transport on randomly evolving trees is investigated. By introducing the notions of living and dead nodes a model of random tree evolution is constructed which describes the spreading in time of objects corresponding to…
The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…
We consider random partitions of the vertex set of a given finite graph that can be sampled by means of loop-erased random walks stopped at a random exponential time of parameter $q>0$. The related random blocks tend to cluster nodes…
Trees of finite cone type have appeared in various contexts. In particular, they come up as simplified models of regular tessellations of the hyperbolic plane. The spectral theory of the associated Laplacians can thus be seen as induced by…
In this paper, we consider the problem of distributed inference in tree based networks. In the framework considered in this paper, distributed nodes make a 1-bit local decision regarding a phenomenon before sending it to the fusion center…
We use a model whose rules were inspired by population genetics, the random capability growth model, to describe the statistical details observed in experiments of fragmentation of brittle platelike objects, and in particular the existence…
Hidden tree Markov models allow learning distributions for tree structured data while being interpretable as nondeterministic automata. We provide a concise summary of the main approaches in literature, focusing in particular on the…
We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…
We consider complex Mandelbrot multiplicative cascades on a random weigh\-ted tree. Under suitable assumptions, this yields a dynamics $\T$ on laws invariant by random weighted means (the so called fixed points of smoothing transformations)…
The uniform infinite planar quadrangulation is an infinite random graph embedded in the plane, which is the local limit of uniformly distributed finite quadrangulations with a fixed number of faces. We study asymptotic properties of this…
We study asymptotics of random shifted Young diagrams which correspond to a given sequence of reducible projective representations of the symmetric groups. We show limit results (Law of Large Numbers and Central Limit Theorem) for their…
We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional "doubling events" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size…
We develop a general framework for the probabilistic analysis of random finite point clouds in the context of topological data analysis. We extend the notion of a barcode of a finite point cloud to compact metric spaces. Such a barcode…
Let $T\_n$ denote the set of unrooted labeled trees of size $n$ and let $T\_n$ be a particular (finite, unlabeled) tree. Assuming that every tree of $T\_n$ is equally likely, it is shown that the limiting distribution as $n$ goes to…
We show that the homology of ordered configuration spaces of finite trees with loops is torsion free. We introduce configuration spaces with sinks, which allow for taking quotients of the base space. Furthermore, we give a concrete…
We study diffusion-type equations supported on structures that are randomly varying in time. After settling the issue of well-posedness, we focus on the asymptotic behavior of solutions: our main result gives sufficient conditions for…
In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily…
We exhibit a procedure to asymptotically enumerate monotone grid classes of permutations. This is then applied to compute the asymptotic number of permutations in any connected one-corner class. Our strategy consists of enumerating the…
We exhibit a non-varying phenomenon for the counting problem of cylinders, weighted by their area, passing through two marked (regular) Weierstrass points of a translation surface in a hyperelliptic connected component…