相关论文: A tightness criterion for fragmentations

This paper investigates the a-posteriori analysis of Branch-and-Bound~(BB) trees to extract structural information about the feasible region of mixed-binary linear programs. We introduce three novel outer approximations of the feasible…

We prove a scaling limit theorem for discrete Galton-Watson processes in varying environments. A simple sufficient condition for the weak convergence in the Skorokhod space is given in terms of probability generating functions. The limit…

We give tightness criteria for random variables taking values in the space of all compact sets of cadlag real-valued paths, in terms of both the Skorohod J1 and M1 topologies. This extends earlier work motivated by the study of the Brownian…

This is an expository review paper elaborating on the proof of the martingale functional central limit theorem (FCLT). This paper also reviews tightness and stochastic boundedness, highlighting one-dimensional criteria for tightness used in…

We study an implementation of the theoretical splitting scheme introduced in [Chassagneux and Yang, 2022] for singular FBSDEs [Carmona and Delarue 2013] and their associated quasi-linear degenerate PDEs. The fully implementable algorithm is…

A number of researchers have independently introduced topologies on the set of laws of stochastic processes that extend the usual weak topology. Depending on the respective scientific background this was motivated by applications and…

We extend the functional Breuer-Major theorem by Nourdin and Nualart (2020) to the space of rough paths. The proof of tightness combines the multiplication formula for iterated Malliavin divergences, due to Furlan and Gubinelli (2019), with…

Growth-fragmentation processes describe systems of particles in which each particle may grow larger or smaller, and divide into smaller ones as time proceeds. Unlike previous studies, which have focused mainly on the self-similar case, we…

Tree-decompositions and treewidth are of fundamental importance in structural and algorithmic graph theory. The "spread" of a tree-decomposition is the minimum integer $s$ such that every vertex lies in at most $s$ bags. A…

The Peaceman-Rachford splitting method is efficient for minimizing a convex optimization problem with a separable objective function and linear constraints. However, its convergence was not guaranteed without extra requirements. He {\it et…

We study the limiting degree distribution of the vertex splitting model introduced in \cite{DDJS:2009}. This is a model of randomly growing ordered trees, where in each time step the tree is separated into two components by splitting a…

We explore statistical inference in self-similar conservative fragmentation chains when only approximate observations of the sizes of the fragments below a given threshold are available. This framework, introduced by Bertoin and Martinez…

The accurate measurement of fracture resistance in elastomers is essential for predicting the mechanical limits of soft devices. Usually, this is achieved by performing tearing or peeling experiments on thin-sheet samples. Here, we show…

We consider a discrete-time Markov chain, called fragmentation process, that describes a specific way of successively removing objects from a linear arrangement. The process arises in population genetics and describes the ancestry of the…

We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly $n$ vertices. These trees are embedded in the real line by affecting spatial positions to the vertices, in such a way that the…

In these expository notes, we describe some features of the multiplicative coalescent and its connection with random graphs and minimum spanning trees. We use Pitman's proof of Cayley's formula, which proceeds via a calculation of the…

Background: We study the statistical properties of fragment coverage in genome sequencing experiments. In an extension of the classic Lander-Waterman model, we consider the effect of the length distribution of fragments. We also introduce…

We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…

In 1981, J. Hawkes conjectured the exact form of the Hausdorff gauge function for the boundary of supercritical Galton-Watson trees under a certain assumption on the tail at the infinity of the total mass of the branching measure. Hawkes's…

As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…