Related papers: Observables of random spanning trees in random env…
Using well-known results from statistical physics, concerning the almost-sure behavior of the free energy of directed polymers in a random medium, we prove that random tree codes achieve the distortion-rate function almost surely under a…
We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…
We present an analysis of the spectral density of the adjacency matrix of large random trees. We show that there is an infinity of delta peaks at all real numbers which are eigenvalues of finite trees. By exact enumerations and Monte-Carlo…
Simulations are used to examine the microscopic origins of strain hardening in polymer glasses. While traditional entropic network models can be fit to the total stress, their underlying assumptions are inconsistent with simulation results.…
Stochastic Structural Stability Theory (SSST) provides an autonomous, deterministic, nonlinear dynamical system for evolving the statistical mean state of a turbulent system. In this work SSST is applied to the problem of understanding the…
We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding…
By means of analytic techniques we show that the expected number of spanning trees in a connected labelled series-parallel graph on $n$ vertices chosen uniformly at random satisfies an estimate of the form $s \varrho^{-n} (1+o(1))$, where…
Simulations are used to examine the microscopic origins of strain hardening in polymer glasses. While stress-strain curves for a wide range of temperature can be fit to the functional form predicted by entropic network models, many other…
In random networks decorated with Ising spins, an increase of the density of frustrations reduces the transition temperature of the spin-glass ordering. This result is in contradiction to the Bethe theory. Here we investigate if this effect…
Owing to their inherently interpretable structure, decision trees are commonly used in applications where interpretability is essential. Recent work has focused on improving various aspects of decision trees, including their predictive…
We define decorated $\alpha$-stable trees which are informally obtained from an $\alpha$-stable tree by blowing up its branchpoints into random metric spaces. This generalizes the $\alpha$-stable looptrees of Curien and Kortchemski, where…
In this paper, we present a fully-dynamic distributed algorithm for maintaining a minimum spanning tree on general graphs with positive real edge weights. The goal of a dynamic MST algorithm is to update efficiently the minimum spanning…
We study a generalisation of the random recursive tree (RRT) model and its multigraph counterpart, the uniform directed acyclic graph (DAG). Here, vertices are equipped with a random vertex-weight representing initial inhomogeneities in the…
We identify the local scaling limit of multiple boundary-to-boundary branches in a uniform spanning tree (UST) as a local multiple SLE(2), i.e., an SLE(2) process weighted by a suitable partition function. By recent results, this also…
We consider two natural variants of the problem of minimum spanning tree (MST) of a graph in the parallel setting: MST verification (verifying if a given tree is an MST) and the sensitivity analysis of an MST (finding the lowest cost…
We study maximal clades in random phylogenetic trees with the Yule-Harding model or, equivalently, in binary search trees. We use probabilistic methods to reprove and extend earlier results on moment asymptotics and asymptotic normality. In…
Fix a bounded $3$-polygon $(\Omega; x_1, x_2, x_3)$ with three marked boundary points $x_1, x_2, x_3\in\partial\Omega$ and suppose $(\Omega^{\delta}; x_1^{\delta}, x_2^{\delta}, x_3^{\delta})$ is an approximation of $(\Omega; x_1, x_2,…
In previous papers we have introduced a sufficient condition for uniform attractivity of the origin for a class of nonlinear time-varying systems which is stated in terms of persistency of excitation (PE), a concept well known in the…
We study the arboricity A and the maximum number T of edge-disjoint spanning trees of the Erdos-Renyi random graph G(n,p). For all p(n) in [0,1], we show that, with high probability, T is precisely the minimum between delta and…
The weight of the minimum spanning tree in a complete weighted graph with random edge weights is a well-known problem. For various classes of distributions, it is proved that the weight of the minimum spanning tree tends to a constant,…