相关论文: The Hilbert-Galton board

Consider two urns, $A$ and $B$, where initially $A$ contains a large number $n$ of balls and $B$ is empty. At each step, with equal probability, either we pick a ball at random in $A$ and place it in $B$, or vice-versa (provided of course…

We study stochastic billiards on general tables: a particle moves according to its constant velocity inside some domain ${\mathcal D} \subset {\mathbb R}^d$ until it hits the boundary and bounces randomly inside according to some reflection…

We study random composite structures considered up to symmetry that are sampled according to weights on the inner and outer structures. This model may be viewed as an unlabelled version of Gibbs partitions and encompasses multisets of…

Given discrete time observations over a fixed time interval, we study a nonparametric Bayesian approach to estimation of the volatility coefficient of a stochastic differential equation. We postulate a histogram-type prior on the volatility…

This thesis introduces a way to build Markov chains out of Hopf algebras. The transition matrix of a "Hopf-power Markov chain" is (the transpose of) the matrix of the coproduct-then-product operator on a combinatorial Hopf algebra with…

The paper concerns lattice triangulations, that is, triangulations of the integer points in a polygon in $\mathbb{R}^2$ whose vertices are also integer points. Lattice triangulations have been studied extensively both as geometric objects…

We perform scanning gate experiments on ballistic constrictions in the presence of small perpendicular magnetic fields. The constrictions form the entrance and exit of a circular gate-defined ballistic stadium. Close to constrictions we…

In this paper we study random partitions of 1,...n, where every cluster of size j can be in any of w\_j possible internal states. The Gibbs (n,k,w) distribution is obtained by sampling uniformly among such partitions with k clusters. We…

The Gumbel trick is a method to sample from a discrete probability distribution, or to estimate its normalizing partition function. The method relies on repeatedly applying a random perturbation to the distribution in a particular way, each…

We consider a class of random billiards in a tube, where reflection angles at collisions with the boundary of the tube are random variables rather than deterministic (and elastic) quantities. We obtain a (non-standard) Central Limit Theorem…

We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…

Recently Wilson [Ann. Appl. Probab. 14 (2004) 274--325] introduced an important new technique for lower bounding the mixing time of a Markov chain. In this paper we extend Wilson's technique to find lower bounds of the correct order for…

Some elements of classical mechanics and classical statistical mechanics are formulated in terms of fibre bundles. In the bundle approach the dynamical and distribution functions are replaced by liftings of paths in a suitably chosen…

We study the distributions of money in a simple closed economic system for different types of monetary transactions. We know that for arbitrary and random sharing but locally conserving money transactions, the money distribution goes to the…

Astute variations in the geometry of mathematical billiard tables have been and continue to be a source of understanding their wide range of dynamical behaviors, from regular to chaotic. Viewing standard specular billiards in the broader…

We investigate the transmission and reflection survival probabilities for the chaotic stadium billiard with two holes placed asymmetrically. Classically, these distributions are shown to have algebraic or exponential decays depending on the…

Multivariate generalized Gamma convolutions are distributions defined by a convolutional semi-parametric structure. Their flexible dependence structures, the marginal possibilities and their useful convolutional expression make them…

Orthogonal polynomials for the multinomial distribution m(x, p) of N balls dropped into d boxes (box i has probability p(i)) are called multivariate Krawtchouk polynomials. This paper gives an introduction to their properties, collections…

Binomial distributions capture the probabilities of `heads' outcomes when a (biased) coin is tossed multiple times. The coin may be identified with a distribution on the two-element set {0,1}, where the 1 outcome corresponds to `head'. One…

We consider the example from invariant theory concerning the conjugation action of the general linear group on several copies of the $n \times n$ matrices, and examine a symmetric function which stably describes the Hilbert series for the…