Related papers: Ranked Fragmentations
Inertial particles suspended in many natural and industrial flows undergo coagulation upon collisions and fragmentation if their size becomes too large or if they experience large shear. Here we study this coagulation-fragmentation process…
We introduce a simple geometric model which describes the kinetics of fragmentation of d-dimensional objects. In one dimension our model coincides with the random scission model and show a simple scaling behavior in the long-time limit. For…
Mutually repelling particles form spontaneously ordered clusters when forced into confinement. The clusters may adopt similar spatial arrangements even if the underlying particle interactions are contrastingly different. Here we demonstrate…
Any homogeneous harmonic polynomial can be decomposed as a sum of powers of isotropic linear forms, that is, linear forms whose coefficients are the coordinates of isotropic points. The minimum size of such decompositions for a harmonic…
A self-organization is an universal phenomenon in nature and, in particular, is highly important in materials systems and biology. We proposed a new theory that allowed us to model the most challenging cases of atomic self-assembling whose…
We consider the concept of rank as a measure of the vertical levels and positions of elements of partially ordered sets (posets). We are motivated by the need for algorithmic measures on large, real-world hierarchically-structured data…
This paper gives a complete characterization of infinitely divisible semimartingales, i.e., semimartingales whose finite dimensional distributions are infinitely divisible. An explicit and essentially unique decomposition of such…
We introduce a technique called graph fission which takes in a graph which potentially contains only one observation per node (whose distribution lies in a known class) and produces two (or more) independent graphs with the same node/edge…
The rank of a semigroup is the cardinality of a smallest generating set. In this paper we compute the rank of the endomorphism monoid of a non-trivial uniform partition of a finite set, that is, the semigroup of those transformations of a…
This paper is a survey, with few proofs, of ideas and notions related to self-similarity of groups, semi-groups and their actions. It attempts to relate these concepts to more familiar ones, such as fractals, self-similar sets, and…
We introduce the notion of the definable rank of an ordered field, ordered abelian group and ordered set, respectively. We study the relation between the definable rank of an ordered field and the definable rank of the value group of its…
In this article we study the "norm" of an integer partition, which we define to be the product of the parts. This partition-theoretic statistic has appeared here and there in the literature of the last century or so, and is at the heart of…
The Poisson process is the most elementary continuous-time stochastic process that models a stream of repeating events. It is uniquely characterised by a single parameter called the rate. Instead of a single value for this rate, we here…
For itinerant fermionic and bosonic systems, we study `particle entanglement', defined as the entanglement between two subsets of particles making up the system. We formulate the general structure of particle entanglement in many-fermion…
Rank and select queries on bitmaps are essential building bricks of many compressed data structures, including text indexes, membership and range supporting spatial data structures, compressed graphs, and more. Theoretically considered yet…
Motivated by recent best case analyses for some sorting algorithms and based on the type of complexity we partition the algorithms into two classes: homogeneous and non homogeneous algorithms. Although both classes contain algorithms with…
We investigate the rank gradient and growth of torsion in homology in residually finite groups. As a tool, we introduce a new complexity notion for generating sets, using measured groupoids and combinatorial cost. As an application we prove…
We consider a family of fragmentation processes where the rate at which a particle splits is proportional to a function of its mass. Let $F\_{1}^{(m)}(t),F\_{2}^{(m)}(t),...$ denote the decreasing rearrangement of the masses present at time…
The convergence of a sequence of point processes with dependent points, defined by a symmetric function of iid high-dimensional random vectors, to a Poisson random measure is proved. This also implies the convergence of the joint…
The problem of ranking/ordering instances, instead of simply classifying them, has recently gained much attention in machine learning. In this paper we formulate the ranking problem in a rigorous statistical framework. The goal is to learn…