Related papers: Scaling Limits for Width Two Partially Ordered Set…
In the last decade there has been increasing interest in the fields of random matrices, interacting particle systems, stochastic growth models, and the connections between these areas. For instance, several objects appearing in the limit of…
We consider a large family of branching-selection particle systems. The branching rate of each particle depends on its rank and is given by a function $b$ defined on the unit interval. There is also a killing measure $D$ supported on the…
For general $\beta \geq 1$, we consider Dyson Brownian motion at equilibrium and prove convergence of the extremal particles to an ensemble of continuous sample paths in the limit $N \to \infty$. For each fixed time, this ensemble is…
In the zero temperature Brownian semi-discrete directed polymer we study the joint distribution of two last-passage times at positions ordered in the time-like direction. This is the situation when we have the slow de-correlation…
We study the order statistics of one dimensional branching Brownian motion in which particles either diffuse (with diffusion constant $D$), die (with rate $d$) or split into two particles (with rate $b$). At the critical point $b=d$ which…
In this work we construct a sequence of Riemannian metrics on the three-sphere with scalar curvature greater than or equal to $6$ and arbitrarily large widths. Our procedure is based on the connected sum construction of positive scalar…
We study the height of the maximal particle at time $t$ of a one dimensional branching Brownian motion with a space-dependent branching rate. The branching rate is set to zero in finitely many intervals (obstacles) of order $t$. We obtain…
We study the random simple connected cubic planar graph $\mathsf{C}_n$ with an even number $n$ of vertices. We show that the Brownian map arises as Gromov--Hausdorff--Prokhorov scaling limit of $\mathsf{C}_n$ as $n \in 2 \ndN$ tends to…
We study the volume of rigid loop-$O(n)$ quadrangulations with a boundary of length $2p$ in the non-generic critical regime. We prove that, as the half-perimeter $p$ goes to infinity, the volume scales in distribution to an explicit random…
We explore some of the connections between the local picture left by the trace of simple random walk on a discrete cylinder with base a d-dimensional torus, d at least 2, of side-length N running for times of order N^{2d} and the model of…
This paper studies three natural pre-orders of increasing generality on the set of all completely non-unitary partial isometries with equal defect indices. We show that the problem of determining when one partial isometry is less than…
In this paper we extend the work of Owen (2007) by deriving a second order expansion for the slope parameter in logistic regression, when the size of the majority class is unbounded and the minority class is finite. More precisely, we…
In the second article of this series, we establish the convergence of the loop ensemble of interfaces in the random cluster Ising model to a conformal loop ensemble (CLE) --- thus completely describing the scaling limit of the model in…
We show that the scaling limit of the random walk loop soup on suitable planar graphs is the Brownian loop soup, under a topology on multisets of unrooted, unparameterized, and macroscopic loops. The result holds assuming only convergence…
The aim of the present article is to introduce a concept which allows to generalise the notion of Poissonian pair correlation, a second-order equidistribution property, to higher dimensions. Roughly speaking, in the one-dimensional setting,…
We propose a generic framework for establishing the decidability of a wide range of logical entailment problems (briefly called querying), based on the existence of countermodels that are structurally simple, gauged by certain types of…
Random Boolean networks, originally invented as models of genetic regulatory networks, are simple models for a broad class of complex systems that show rich dynamical structures. From a biological perspective, the most interesting networks…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
We consider a weighted random walk on the backbone of an oriented percolation cluster. We determine necessary conditions on the weights for Brownian scaling limits under the annealed and the quenched law. This model is a random walk in…
We consider a discrete-time branching random walk defined on the real line, which is assumed to be supercritical and in the boundary case. It is known that its leftmost position of the $n$-th generation behaves asymptotically like…