相关论文: Voting models and tightness for a family of recurs…

In this paper we study the tightness of solutions for a family of recursion equations. These equations arise naturally in the study of random walks on tree-like structures. Examples include the maximal displacement of a branching random…

We study branching random walk on $\mathbb{Z}$ in a bounded i.i.d. random environment. For this process, we prove that, for almost every realization of the environment, the distributions of the maximally displaced particle (re-centered…

We consider branching random walk in random environment (BRWRE) and prove the existence of deterministic subsequences along which their maximum, centered at its mean, is tight. This partially answers an open question in arXiv:1711.00852.…

We study a class of non-reversible, continuous-time random walks in random environments on $\mathbb{Z}^d$ that admit a cycle representation with finite cycle length. The law of the transition rates, taking values in $[0, \infty)$, is…

We study a non-reversible random walk advected by the symmetric simple exclusion process, so that the walk has a local drift of opposite sign when sitting atop an occupied or an empty site. We prove that the back-tracking probability of the…

We give tightness criteria for random variables taking values in the space of all compact sets of cadlag real-valued paths, in terms of both the Skorohod J1 and M1 topologies. This extends earlier work motivated by the study of the Brownian…

We consider several critical wetting models. In the discrete case, these probability laws are known to converge, after an appropriate rescaling, to the law of a reflecting Brownian motion, or of the modulus of a Brownian bridge, according…

We derive a quenched invariance principle for random walks in random environments whose transition probabilities are defined in terms of weighted cycles of bounded length. To this end, we adapt the proof for random walks among random…

Non-linear latent variable models have become increasingly popular in a variety of applications. However, there has been little study on theoretical properties of these models. In this article, we study rates of posterior contraction in…

We consider the problem of exact probabilistic inference for Union of Conjunctive Queries (UCQs) on tuple-independent databases. For this problem, two approaches currently coexist. In the extensional method, query evaluation is performed by…

We study discrete-time dynamical systems that switch between different evolution rules based on thresholds that themselves adapt over time. Specifically, we analyze the coupled recursion $a_{n+1} = f(a_n)$ if $a_n \leq c_n$ and $a_{n+1} =…

Central limit theorems for random walks in quenched random environments have attracted plenty of attention in the past years. More recently still, finer local limit theorems -- yielding a Gaussian density multiplied by a highly oscillatory…

We consider real random walks with finite variance. We prove an optimal integrability result for the diffusively rescaled maximum, when the walk or its bridge is conditioned to stay positive, or to avoid zero. As an application, we prove…

The framework of this article is cell motility modeling. Approximating cells as rigid spheres we take into account for both non-penetration and adhesions forces. Adhesions are modeled as a memory-like microscopic elastic forces. This leads…

We study two models of growing recursive trees. For both models, initially the tree only contains one vertex $u_1$ and at each time $n\geq 2$ a new vertex $u_n$ is added to the tree and its parent is chosen randomly according to some rule.…

Probabilistic model checking for systems with large or unbounded state space is a challenging computational problem in formal modelling and its applications. Numerical algorithms require an explicit representation of the state space, while…

Probabilities of causation (PoCs) are fundamental quantities for counterfactual analysis and personalized decision making. However, existing analytical results are largely confined to binary settings. This paper extends PoCs to multi-valued…

We consider a random walk on Z^d in an i.i.d. balanced random environment, that is a random walk for which the probability to jump from x to nearest neighbor x+e is the same as to nearest neighbor x-e. Assuming that the environment is…

The goal of this paper is to prove rigorous results for the behavior of genealogies in a one-dimensional long range biased voter model introduced by Hallatschek and Nelson [25]. The first step, which is easily accomplished using results of…

In a Bayesian setting, inverse problems and uncertainty quantification (UQ) --- the propagation of uncertainty through a computational (forward) model --- are strongly connected. In the form of conditional expectation the Bayesian update…