Related papers: Split merge dynamics for expanding intervals and p…
A general setting for nested subdivisions of a bounded real set into intervals defining the digits $X_1,X_2,...$ of a random variable $X$ with a probability density function $f$ is considered. Under the weak condition that $f$ is almost…
We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…
We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…
We propose a novel family of test statistics to detect the presence of changepoints in a sequence of dependent, possibly multivariate, functional-valued observations. Our approach allows to test for a very general class of changepoints,…
In this article, we consider a sequence $(N_n)_{n \geq 1}$ of point processes, whose points lie in a subset $E$ of $\bR \verb2\2 \{0\}$, and satisfy an asymptotic independence condition. Our main result gives some necessary and sufficient…
Consider n non-intersecting Brownian motions on $\mathbb{R}$, depending on time $t \in [0,1]$, with $m_i$ particles forced to leave from $a_i$ at time $t=0$, $1\leq i\leq q$, and $n_j$ particles forced to end up at $b_j$ at time $t=1$,…
We propose a general method for distributed Bayesian model choice, using the marginal likelihood, where a data set is split in non-overlapping subsets. These subsets are only accessed locally by individual workers and no data is shared…
In this paper, the problem of the minimal description of the structure of a vector function f(x) over an $N$-dimensional interval is studied. Methods adaptively subdividing the original interval in smaller subintervals and evaluating f(x)…
We investigate a diffusive motion of a system of interacting Brownian particles in quasi-one-dimensional micropores. In particular, we consider a semi-infinite 1D geometry with a partially absorbing boundary and the hard-core inter-particle…
For each $n \geq 1$, let $\{X_{j,n}\}_{1 \leq j \leq n}$ be a sequence of strictly stationary random variables. In this article, we give some asymptotic weak dependence conditions for the convergence in distribution of the point process…
In reliable decision-making systems based on machine learning, models have to be robust to distributional shifts or provide the uncertainty of their predictions. In node-level problems of graph learning, distributional shifts can be…
Particle splitting methods are considered for the estimation of rare events. The probability of interest is that a Markov process first enters a set $B$ before another set $A$, and it is assumed that this probability satisfies a large…
We investigate the long-time evolution of branching diffusion processes (starting with a single particle) in inhomogeneous media. The qualitative behavior of the processes depends on the intensity of the branching. We analyze the…
We consider a Markovian evolution on point processes, the $\Psi$--process, on the unit interval in which points are added according to a rule that depends only on the spacings of the existing point configuration. Having chosen a spacing, a…
Gorman and Bedrick (2019) argued for using random splits rather than standard splits in NLP experiments. We argue that random splits, like standard splits, lead to overly optimistic performance estimates. We can also split data in biased or…
We consider the joint distribution of the area and perimeter statistics on the set I_n of inversion sequences of length n represented as bargraphs. Functional equations for both the ordinary and exponential generating functions are derived…
We consider a certain sequence of random walks. The state space of the n-th random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to…
We analyze the $L^1$-mixing of a generalization of the Averaging process introduced by Aldous. The process takes place on a growing sequence of graphs which we assume to be finite-dimensional, in the sense that the random walk on those…