相关论文: A tightness criterion for fragmentations

Additive tree functionals allow to represent the cost of many divide-and-conquer algorithms. We give an invariance principle for such tree functionals for the Catalan model (random tree uniformly distributed among the full binary ordered…

In this note, we prove a quenched functional central limit theorem for a biased random walk on a supercritical Galton-Watson tree with leaves. This extends a result of Peres and Zeitouni (2008) where the case without leaves is considered. A…

We introduce a simple technique for proving the transience of certain processes defined on the random tree $\mathcal{G}$ generated by a supercritical branching process. We prove the transience for once-reinforced random walks on…

We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation of the tree) and clusters (or trees) are frozen with a rate…

Fragmentation can be observed in nature and in everyday life on a wide range of length scales and for all kinds of technical applications. Most studies on dynamic failure focus on the behaviour of bulk systems in one, two and three…

In this paper, we show that a Galton-Watson tree conditioned to have a fixed number of particles in generation $n$ converges in distribution as $n\rightarrow\infty$, and with this tool we study the span and gap statistics of a branching…

We introduce three new cut tree structures of graphs $G$ in which the vertex set of the tree is a partition of $V(G)$ and contractions of tree vertices satisfy sparsification requirements that preserve various types of cuts. Recently,…

We study a new type of random minimum spanning trees. It is built on the complete graph where each vertex is given a weight, which is a positive real number. Then, each edge is given a capacity which is a random variable that only depends…

This work studies the statistical implications of using features comprised of general linear combinations of covariates to partition the data in randomized decision tree and forest regression algorithms. Using random tessellation theory in…

The goal of this paper is to provide a general purpose result for the coupling of exploration processes of random graphs, both undirected and directed, with their local weak limits when this limit is a marked Galton-Watson process. This…

Tree-cut width is a parameter that has been introduced as an attempt to obtain an analogue of treewidth for edge cuts. Unfortunately, in spite of its desirable structural properties, it turned out that tree-cut width falls short as an…

We propose a methodology for studying the performance of common splitting methods through semidefinite programming. We prove tightness of the methodology and demonstrate its value by presenting two applications of it. First, we use the…

It is well-known that the height profile of a critical conditioned Galton-Watson tree with finite offspring variance converges, after a suitable normalization, to the local time of a standard Brownian excursion. In this work, we study the…

In [Bonito et al., J. Comput. Phys. (2022)], a local discontinuous Galerkin method was proposed for approximating the large bending of prestrained plates, and in [Bonito et al., IMA J. Numer. Anal. (2023)] the numerical properties of this…

In this paper we prove a strong law of large numbers and its L^1-convergence counterpart for the process counted with a random characteristic in the context of self-similar fragmentation processes. This result extends a somewhat analogical…

Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…

We study the long-term behavior of weighted multi-type branching processes, focusing on extending classical laws of large numbers and martingale convergence to settings with infinitely many weighted particles, arbitrary type spaces and…

Similarly as in (Blancas et al. 2018) where nested coalescent processes are studied, we generalize the definition of partition-valued homogeneous Markov fragmentation processes to the setting of nested partitions, i.e. pairs of partitions…

We extend the results of Arguin et al and A\"\i{}d\'ekon et al on the convergence of the extremal process of branching Brownian motion by adding an extra dimension that encodes the "location" of the particle in the underlying Galton-Watson…

We work on a Galton--Watson tree with random weights, in the so-called "subdiffusive" regime. We study the rate of decay of the conductance between the root and the $n$-th level of the tree, as $n$ goes to infinity, by a mostly analytic…