Related papers: Bumping sequences and multispecies juggling
We investigate universal features of the jamming transition in granular materials, colloids and glasses. We show that the jamming transition in these systems has common features: slowing of response to external perturbation, and the onset…
We study multipartite entanglement measures for a one-dimensional Ising chain that is capable of showing both integrable and nonintegrable behaviour. This model includes the kicked transverse Ising model, which we solve exactly using the…
We begin a systematic study of the enumerative combinatorics of mixed succession rules, which are succession rules such that, in the associated generating tree, the nodes are allowed to produce their sons at several different levels…
We study the problem of characterizing the expected hitting times for a robust generalization of continuous-time Markov chains. This generalization is based on the theory of imprecise probabilities, and the models with which we work…
We consider a stochastic model, called the replicator coalescent, describing a system of blocks of $k$ different types which undergo pairwise mergers at rates depending on the block types: with rate $C_{i,j}$ blocks of type $i$ and $j$…
In this study, a new extension of the Markov Renewal theory is introduced by allowing time to evolve in multiple dimensions. The resulting chains are referred to as multi-time Markov Renewal chains and since this extension is new, the state…
We review theoretical approaches to the understanding of food webs. After an overview of the available food web data, we discuss three different classes of models. The first class comprise static models, which assign links between species…
Suppose that there are n bins, and balls arrive in a Poisson process at rate \lambda n, where \lambda >0 is a constant. Upon arrival, each ball chooses a fixed number d of random bins, and is placed into one with least load. Balls have…
Reversible jump Markov chain Monte Carlo (RJMCMC) proposals that achieve reasonable acceptance rates and mixing are notoriously difficult to design in most applications. Inspired by recent advances in deep neural network-based normalizing…
We show that evolutionary computation can be implemented as standard Markov-chain Monte-Carlo (MCMC) sampling. With some care, `genetic algorithms' can be constructed that are reversible Markov chains that satisfy detailed balance; it…
We study common frequently hypercyclic vectors for countable families of weighted backward shifts acting on $\ell_p$ spaces, $1\leq p<\infty$. Using probabilistic techniques, we develop a general existence criterion, complemented by a…
This paper is mainly concerned with applying the theory of M-regularity developed in the previous math.AG/0110003 to the study of linear series given by multiples of ample line bundles on abelian varieties. We define a new invariant of a…
Using the combinatorial properties of subsets of integers, a classification of metric dynamical systems was given in [V. Bergelson and T. Downarowicz, Large sets of integers and hierarchy of mixing properties of measure-preserving systems,…
The multilayer garbage disposal game is an evolution of the garbage disposal game. Each layer represents a social relationship within a system of finitely many individuals and finitely many layers. An agent can redistribute their garbage…
Consider a weighted branching process generated by the lengths of intervals obtained by stick-breaking of unit length (a.k.a. the residual allocation model) and associate with each weight a `box'. Given the weights `balls' are thrown…
We study the processes in which fluctuating elements of a system are progressively fixed (quenched) while keeping the interaction with the remaining unfixed elements. If the interaction is global among the Ising spin elements and if the…
Recall that a Stirling permutation is a permutation on the multiset $\{1,1,2,2,\ldots,n,n\}$ such that any numbers appearing between repeated values of $i$ must be greater than $i$. We call a Stirling permutation ``flattened'' if the…
We investigate the entanglement properties of multiparticle systems, concentrating on the case where the entanglement is robust against disposal of particles. Two qubits -belonging to a multipartite system- are entangled in this sense iff…
Collective classification models attempt to improve classification performance by taking into account the class labels of related instances. However, they tend not to learn patterns of interactions between classes and/or make the assumption…
We study sorting machines consisting of a stack and a pop stack in series, with or without a queue between them. While there are, a priori, four such machines, only two are essentially different: a pop stack followed directly by a stack,…