相关论文: Enumerative Theory for the Tsetlin Library
We consider a problem of shuffling a deck of cards with ordered labels. Namely we split the deck of N=k^tq cards (where t>=1 is maximal) into k equally sized stacks and then take the top card off of each stack and sort them by the order of…
We analyse a preferential urn model with randomness using the replica method. The preferential urn model is a stochastic model based on the concept "the rich get richer." The replica analysis clarifies that the preferential urn model with…
The game "Spot It!" is played with a deck of cards in which every pair of cards has exactly one matching symbol and the aim is to be the fastest at finding the match. It is known that finite projective planes correspond to decks in which…
Markov chains are an important example for a course on stochastic processes because simple board games can be used to illustrate the fundamental concepts. For example, a looping board game (like Monopoly) consists of all recurrent states,…
We study a generalization of Holte's amazing matrix, the transition probability matrix of the Markov chains of the 'carries' in a non-standard numeration system. The stationary distributions are explicitly described by the numbers which can…
We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities…
Ensembling is among the most popular tools in machine learning (ML) due to its effectiveness in minimizing variance and thus improving generalization. Most ensembling methods for black-box base learners fall under the umbrella of "stacked…
Neural scaling laws (NSL) refer to the phenomenon where model performance improves with scale. Sharma & Kaplan analyzed NSL using approximation theory and predict that MSE losses decay as $N^{-\alpha}$, $\alpha=4/d$, where $N$ is the number…
The goal of the paper is to describe new connections between representation theory and algebraic combinatorics on one side, and probability theory on the other side. The central result is a construction, by essentially algebraic tools, of a…
We find a strong separation between two natural families of simple rank one theories in Keisler's order: the theories $T_\mathfrak{m}$ reflecting graph sequences, which witness that Keisler's order has the maximum number of classes, and the…
We study the distributions of the splitting primes in certain families of number fields. The first and main example is the family Pn,N of integer polynomials monic of degree n with height less or equal then N, and then let N go to infinity.…
We present a novel approach to detecting and utilizing symmetries in probabilistic graphical models with two main contributions. First, we present a scalable approach to computing generating sets of permutation groups representing the…
We present a novel approach to detecting and utilizing symmetries in probabilistic graphical models with two main contributions. First, we present a scalable approach to computing generating sets of permutation groups representing the…
We study the properties of a subclass of stochastic processes called discrete time nonlinear Markov chains with an aggregator, which naturally appear in various topics such as strategic queueing systems, inventory dynamics, opinion…
A random walk on a directed graph gives a Markov chain on the vertices of the graph. An important question that arises often in the context of Markov chain is whether the uniform distribution on the vertices of the graph is a stationary…
We investigate the $k$-cycle shuffle on repeated cards, namely on a deck consisting of $l$ identical copies of each of $m$ card types, with total size $n=ml$. We establish asymptotic results for the total variation mixing of this shuffle,…
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…
A pure Hotelling game is a competition between a finite number of players who select simultaneously a location in order to attract as many consumers as possible. In this paper, we study the case of a general distribution of consumers on a…
A placement of chess pieces on a chessboard is called dominating, if each free square of the chessboard is under attack by at least one piece. In this contribution we compute the number of dominating arrangements of $k$ rooks on an $n\times…
An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the…