Related papers: Random replacements in P\'olya urns with infinitel…
This paper studies a very general urn model stimulated by designs in clinical trials, where the number of balls of different types added to the urn at trial n depends on a random outcome directed by the composition at trials 1,2,...,n-1.…
Generating realistic artificial preference distributions is an important part of any simulation analysis of electoral systems. While this has been discussed in some detail in the context of a single electoral district, many electoral…
An urn scheme is a probabilistic model in which balls are placed into urns sequentially and independently of each other. All balls share the same probability distribution for hitting the urns. In the simplest case, there is a finite number…
In this study, we analyzed urn models by solving the discrete-time master equation using an expansion in moments. This approach is a viable alternative to conventional methods, such as system-size expansion, allowing for the determination…
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
We consider suitable weak solutions of 2-dimensional Euler equations on bounded domains, and show that the class of completely random measures is infinitesimally invariant for the dynamics. Space regularity of samples of these random fields…
We study the randomness properties of reals with respect to arbitrary probability measures on Cantor space. We show that every non-computable real is non-trivially random with respect to some measure. The probability measures constructed in…
We study substitutions on countably infinite alphabet (without compactification) as Borel dynamical systems. We construct stationary and non-stationary generalized Bratteli-Vershik models for a class of such substitutions, known as left…
Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability…
Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses M\"obius transforms and adapts Shapley's methodology in cooperative game theory, into the context of set theory.…
In this work infinitely divisible cylindrical probability measures on arbitrary Banach spaces are introduced. The class of infinitely divisible cylindrical probability measures is described in terms of their characteristics, a…
Let $\Om$ be a Borel subset of $S^\Bbb N$ where $S$ is countable. A measure is called exchangeable on $\Om$, if it is supported on $\Om$ and is invariant under every Borel automorphism of $\Om$ which permutes at most finitely many…
In this paper, we continue to explore the consistence and usability of Probability Bracket Notation (PBN) proposed in our previous articles. After a brief review of PBN with dimensional analysis, we investigate probability spaces in terms…
Given a probability space $(X, {\cal B}, m)$, measure preserving transformations $g_1, \dots , g_k$ of $X$, and a colour set $C$, a colouring rule is a way to colour the space with $C$ such that the colours allowed for apoint $x$ are…
We consider the space of countable structures with fixed underlying set in a given countable language. We show that the number of ergodic probability measures on this space that are $S_\infty$-invariant and concentrated on a single…
We consider random fields that can be represented as integrals of deterministic functions with respect to infinitely divisible random measures and show that these random fields are infinitely divisible.
In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show…
Using Reiner's definition of Stirling numbers of type B of the second kind, we provide a 'balls into urns' approach for proving a generalization of a well-known identity concerning the classical Stirling numbers of the second kind:…
In this paper we study random orderings of the integers with a certain invariance property. We describe all such orders in a simple way. We define and represent random shuffles of a countable set of labels and then give an interpretation of…
Based on previous work of Paul Ressel and myself, I show that the space of all "continuous" exchangeable probability measures on a certain set of order processes is a Bauer simplex.