Related papers: Split merge dynamics for expanding intervals and p…
We study a general class of interacting particle systems over a countable state space $V$ where on each site $x \in V$ the particle mass $\eta(x) \geq 0$ follows a stochastic differential equation. We construct the corresponding Markovian…
Starting from a continuous time random walk (CTRW) model of particles that may evanesce as they walk, our goal is to arrive at macroscopic integro-differential equations for the probability density for a particle to be found at point r at…
We propose a new method, probabilistic divide-and-conquer, for improving the success probability in rejection sampling. For the example of integer partitions, there is an ideal recursive scheme which improves the rejection cost from…
This paper extends split variational inclusion problems to dynamic, stochastic, and multi-agent systems in Banach spaces. We propose novel iterative algorithms to handle stochastic noise, time-varying operators, and coupled variational…
This article studies a general divide-and-conquer algorithm for approximating continuous one-dimensional probability distributions with finite mean. The article presents a numerical study that compares pre-existing approximation schemes…
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative $(1+\delta)$ of uniform in expected…
For general thinning procedures, its inverse operation, the condensing, is studied and a link to integration-by-parts formulas is established. This extends the recent results on that link for independent thinnings of point processes to…
The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…
We study the dynamics of the outliers for a large number of independent Brownian particles in one dimension. We derive the multi-time joint distribution of the position of the rightmost particle, by two different methods. We obtain the two…
Although exchangeable processes from Bayesian nonparametrics have been used as a generating mechanism for random partition models, we deviate from this paradigm to explicitly incorporate clustering information in the formulation of our…
We consider a model of fragmentation of sheet by cracks that move with a velocity in preferred direction, but undergo random transverse displacements as they move. There is a non-zero probability of crack-splitting, and the split cracks…
We consider the general branching random walk under minimal assumptions, which in particular guarantee that the empirical particle distribution admits an almost sure central limit theorem. For such a process, we study the large time decay…
Nonintersecting motion of Brownian particles in one dimension is studied. The system is constructed as the diffusion scaling limit of Fisher's vicious random walk. N particles start from the origin at time t=0 and then undergo mutually…
We investigate the stationary distribution of asymmetric and weakly asymmetric simple exclusion processes with open boundaries. We project the stationary distribution onto a subinterval, whose size is allowed to grow with the length of the…
We introduce a reversible Markovian coagulation-fragmentation process on the set of partitions of $\{1,\ldots,L\}$ into disjoint intervals. Each interval can either split or merge with one of its two neighbors. The invariant measure can be…
The discrete distribution of the length of longest increasing subsequences in random permutations of $n$ integers is deeply related to random matrix theory. In a seminal work, Baik, Deift and Johansson provided an asymptotics in terms of…
Statistical inference is often simplified by sample-splitting. This simplification comes at the cost of the introduction of randomness not native to the data. We propose a simple procedure for sequentially aggregating statistics constructed…
In this paper we investigate \textit{pigeonhole statistics} for the fractional parts of the sequence $\sqrt{n}$. Namely, we partition the unit circle $ \mathbb{T} = \mathbb{R}/\mathbb{Z}$ into $N$ intervals and show that the proportion of…
We consider a branching random walk in a random space-time environment of disasters where each particle is killed when meeting a disaster. This extends the model of the "random walk in a disastrous random environment" introduced by [15]. We…
In this paper we develop a methodology that we call split sampling methods to estimate high dimensional expectations and rare event probabilities. Split sampling uses an auxiliary variable MCMC simulation and expresses the expectation of…