Related papers: Recursive partition structures
Certain mathematical structures make a habit of reoccuring in the most diverse list of settings. Some obvious examples exhibiting this intrusive type of behavior include the Fibonacci numbers, the Catalan numbers, the quaternions, and the…
A model of a discrete pregeometry on a microscopic scale is introduced. This model is a finite network of finite elementary processes. The mathematical description is a d-graph that is a generalization of a graph. This is the particular…
In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts increasing the coverage are accepted. A finite system eventually gets congested, and we study the statistics of congested…
The experiments conducted by various scientific groups indicate that, in dense two-dimensional systems of elongated particles subjected to vibration, the pattern formation is possible. Computer simulations have evidenced that the random…
The explosion in the amount of data available for analysis often necessitates a transition from batch to incremental clustering methods, which process one element at a time and typically store only a small subset of the data. In this paper,…
Signed networks appear naturally in contexts where conflict or animosity is apparent. In this book chapter we review some of the literature on signed networks, especially in the context of partitioning. Most of the work is founded in what…
We extend the Dirichlet principle to non-reversible Markov processes on countable state spaces. We present two variational formulas for the solution of the Poisson equation or, equivalently, for the capacity between two disjoint sets. As an…
We study the behaviour of discrete dynamical systems generated by a continuous map $f$ of a compact real interval into itself where at randomly chosen times a function different from $f$ - so called impulse function is applied. We show that…
We consider a preferential growth model where particles are added one by one to the system consisting of clusters of particles. A new particle can either form a new cluster (with probability q) or join an already existing cluster with a…
A topological dynamical system induces two natural systems, one is on the hyperspace and the other one is on the probability space. The connection among some dynamical properties on the original space and on the induced spaces are…
We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with…
There is a well-known bijection between finite binary sequences and integer partitions. Sequences of length r correspond to partitions of perimeter r+1. Motivated by work on rational numbers in the Calkin-Wilf tree, we classify partitions…
Consideration of a classification of the number of partitions of a natural number according to the members of sub-partitions differing from unity leads to a non-recursive formula for the number of irreducible representations of the…
Motivated by the fundamental problem of measuring species diversity, this paper introduces the concept of a cluster structure to define an exchangeable cluster probability function that governs the joint distribution of a random count and…
I propose two simple ways of generating the partitions of (n+1) from the partitions of n. A recurrence relation for P(n+1), the number of partitions of (n+1), in terms of P(n) and Q(n), where Q(n) denotes the number of partitions of n…
In this paper we consider a random partition of the plane into cells, the partition being based on the nodes and links of a {\it random planar geometric graph}. The resulting structure generalises the \emph{random \tes}\ hitherto studied in…
Multiplicative cascades have been introduced in turbulence to generate random or deterministic fields having intermittent values and long-range power-law correlations. Generally this is done using discrete construction rules leading to…
We consider any fixed $d\in\mathbb{Z}_{>0}$ number of second class particles in the asymmetric simple exclusion process (ASEP), constructed via a basic coupling of two ASEPs. We give the joint distribution of the positions of the second…
We numerically examine dynamical irreversible to reversible transitions and random organization for periodically driven gliding dislocation assemblies using the stroboscopic protocol developed to identify random organization in periodically…
We give Euler-like recursive formulas for the $t$-colored partition function when $t=2$ or $t=3,$ as well as for all $t$-regular partition functions. In particular, we derive an infinite family of ``triangular number" recurrences for the…