Related papers: Ranked Fragmentations
Segregation is a popular phenomenon. It has considerable effects on material performance. To the author's knowledge, there is still no automated objective quantitative indicator for segregation. In order to full fill this task, segregation…
This text surveys different probabilistic aspects of a model which is used to describe the evolution of an object that falls apart randomly as time passes. Each point of view yields useful techniques to establish properties of such random…
It is well-known that tensor decompositions show separations, that is, that constraints on local terms (such as positivity) may entail an arbitrarily high cost in their representation. Here we show that many of these separations disappear…
We study the set of all decompositions (clusterings) of a graph through its characterization as a set of lifted multicuts. This leads us to practically relevant insights related to the definition of a class of decompositions by must-join…
We introduce the notion of echeloned spaces - an order-theoretic abstraction of metric spaces. The first step is to characterize metrizable echeloned spaces. It turns out that morphisms between metrizable echeloned spaces are uniformly…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
A new method of hierarchical clustering of graph vertexes is suggested. In the method, the graph partition is determined with an equivalence relation satisfying a recursive definition stating that vertexes are equivalent if the vertexes…
We show that the size distributions of fragments created by high energy nuclear collisions are remarkably well reproduced within the framework of a parameter free percolation model. We discuss two possible scenarios to explain this…
We study a large class of Poisson manifolds, derived from Manin triples, for which we construct explicit partitions into regular Poisson submanifolds by intersecting certain group orbits. Examples include all varieties ${\mathcal L}$ of…
The fragmentation equation is commonly expressed in terms of two functions, the rate of fragmentation and the mean number of fragments. In the case of binary fragmentation an alternative description is possible based on the fragmentation…
Fractals are geometric shapes that can display complex and self-similar patterns found in nature (e.g., clouds and plants). Recent works in visual recognition have leveraged this property to create random fractal images for model…
The idea is advanced that self-organization in complex systems can be treated as decision making (as it is performed by humans) and, vice versa, decision making is nothing but a kind of self-organization in the decision maker nervous…
We consider a model of fragmentation of sheet by cracks that move with a velocity in preferred direction, but undergo random transverse displacements as they move. There is a non-zero probability of crack-splitting, and the split cracks…
Matrices with low-rank structure are ubiquitous in scientific computing. Choosing an appropriate rank is a key step in many computational algorithms that exploit low-rank structure. However, estimating the rank has been done largely in an…
Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…
The process of rank aggregation is intimately intertwined with the structure of skew-symmetric matrices. We apply recent advances in the theory and algorithms of matrix completion to skew-symmetric matrices. This combination of ideas…
In this article a collection of random self-similar fractal dendrites is constructed, and their Hausdorff dimension is calculated. Previous results determining this quantity for random self-similar structures have relied on geometrical…
The problem of frequent pattern mining has been studied quite extensively for various types of data, including sets, sequences, and graphs. Somewhat surprisingly, another important type of data, namely rank data, has received very little…
We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which,…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…