Related papers: Ranked Fragmentations
The sequence of so-called signature moments describes the laws of many stochastic processes in analogy with how the sequence of moments describes the laws of vector-valued random variables. However, even for vector-valued random variables,…
In this paper, we introduce and formalize a rank-one partitioning learning paradigm that unifies partitioning methods that proceed by summarizing a data set using a single vector that is further used to derive the final clustering…
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
We classify the subsets of a group by their sizes, formalize the basic methods of partitions and apply them to partition a group to subsets of prescribed sizes.
In this paper we study generating functions resembling the rank of strongly unimodal sequences. We give combinatorial interpretations, identities in terms of mock modular forms, asymptotics, and a parity result. Our functions imitate a…
We describe a new method that is both physically explicable and quantitatively accurate in describing the multifractal characteristics of intermittent events based on groupings of rank-ordered fluctuations. The generic nature of such…
Consider a graph on randomly scattered points in an arbitrary space, with two points $x,y$ connected with probability $\phi(x,y)$. Suppose the number of points is large but the mean number of isolated points is $O(1)$. We give general…
We study topological factors of rank-one subshifts and prove that those factors that are themselves subshifts are either finite or isomorphic to the original rank-one subshifts. Thus, we completely characterize the subshift factors of…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
Many scientists are interested in but puzzled by the various inverse power laws with a negative exponent 1 such as the rank-size rule. The rank-size rule is a very simple scaling law followed by many observations of the ubiquitous empirical…
In this paper, we study Ruelle's probability cascades in the framework of time-inhomogeneous fragmentation processes. We describe Ruelle's cascades mechanism exhibiting a family of measures $(\nu_t,t\in [0,1[)$ that characterizes its…
We formulate the statistics of the discrete multicomponent fragmentation event using a methodology borrowed from statistical mechanics. We generate the ensemble of all feasible distributions that can be formed when a single integer…
We consider the fragmentation process with mass loss and discuss self-similar properties of the arising structure both in time and space, focusing on dimensional analysis. This exhibits a spectrum of mass exponents $\theta$, whose exact…
Linear rate equations are used to describe the cascading decay of an initial heavy cluster into fragments. Using a procedure inspired by the similar, but continuous case of jet fragmentation in QCD, this discretized process may be analyzed…
In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…
Suppose some random resource (energy, mass or space) $\chi \geq 0$ is to be shared at random between (possibly infinitely many) species (atoms or fragments). Assume ${\Bbb E}\chi =\theta <\infty $ and suppose the amount of the individual…
In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…
We define a spatially-dependent fragmentation process, which involves rectangles breaking up into progressively smaller pieces at rates that depend on their shape. Long, thin rectangles are more likely to break quickly, and are also more…
Fractional minimum positive semidefinite rank is defined from $r$-fold faithful orthogonal representations and it is shown that the projective rank of any graph equals the fractional minimum positive semidefinite rank of its complement. An…