A class of nonstationary adic transformations
A counterexample for the Markov property of local time for diffusions on graphs
A discrete theory of search. I
A functional combinatorial central limit theorem.
A game-theoretical model of competition for staff between two departments
The main purpose of this paper is to analyze a development of a scenario suggested by Baston and Garnaev (2005) for modelling the situation where two departments in a large organization are each seeking to make an appointment within the same area of expertise, for instance, a computer science specialist. The departments are interested in three skills of the candidate (say, writing code, communication and in algorithms). In our scenario Department 1 wants to employ a candidate with excellent skills...
A local limit theorem for the critical random graph.
A Markov chain approach to randomly grown graphs.
A microscopic model for the Burgers equation and longest increasing subsequences.
A Nearly Degenerate Random Variable Occurring in an Occupancy Problem.
A new model of combinatorial probability
A nonasymptotic theorem for unnormalized Feynman–Kac particle models
We present a nonasymptotic theorem for interacting particle approximations of unnormalized Feynman–Kac models. We provide an original stochastic analysis-based on Feynman–Kac semigroup techniques combined with recently developed coalescent tree-based functional representations of particle block distributions. We present some regularity conditions under which the -relative error of these weighted particle measures grows linearly with respect to the time horizon yielding what seems to be the first...
A note on the distribution of the three types of nodes in uniform binary trees.
A note on the exact expected length of the th part of a random partition.
A probabilistic approach to the asymptotics of the length of the longest alternating subsequence.
A -analogue of de Finetti's theorem.
A remark on Vapnik-Chervonienkis classes
We show that the family of all lines in the plane which is a VC class of index 2 cannot be obtained in a finite number of steps starting with VC classes of index 1 and applying the operations of intersection and union. This confirms a common belief among specialists and solves a question asked by several authors.
A simple card guessing game revisited.
A species sampling model with finitely many types.
A stationary random graph of no growth rate
We present a random automorphism-invariant subgraph of a Cayley graph such that with probability 1 its exponential growth rate does not exist.
A zero-inflated occupancy distribution: Exact results and Poisson convergence.