Related papers: Muttalib--Borodin plane partitions and the hard ed…
We consider a last passage percolation model in dimension $1+1$ with potential given by the product of a spatial i.i.d. potential with symmetric bounded distribution and an independent i.i.d. in time sequence of signs. We assume that the…
The theory of P\'olya ensembles of positive definite random matrices provides structural formulas for the corresponding biorthogonal pair, and correlation kernel, which are well suited to computing the hard edge large $N$ asymptotics. Such…
We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [6]. We describe our results…
Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…
We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…
We consider a directed variant of the negative-weight percolation model in a two-dimensional, periodic, square lattice. The problem exhibits edge weights which are taken from a distribution that allows for both positive and negative values.…
Fragmentation processes are part of a broad class of models describing the evolution of a system of particles which split apart at random. These models are widely used in biology, materials science and nuclear physics, and their asymptotic…
We consider a new class of determinantal point processes in the complex plane coming from the ground state of free fermions associated with Berezin--Toeplitz operators. These processes generalize the Ginibre ensemble from random matrix…
We study first passage percolation on the configuration model. Assuming that each edge has an independent exponentially distributed edge weight, we derive explicit distributional asymptotics for the minimum weight between two randomly…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
Stationary and isotropic iteration stable random tessellations are considered, which can be constructed by a random process of cell division. The collection of maximal polytopes at a fixed time $t$ within a convex window $W\subset{\Bbb…
We define a class of random matrix ensembles that pertain to random looped polymers. Such random looped polymers are a possible model for bio-polymers such as chromatin in the cell nucleus. It is shown that the distribution of the largest…
We study nongeneric planar trees and prove the existence of a Gibbs measure on infinite trees obtained as a weak limit of the finite volume measures. It is shown that in the infinite volume limit there arises exactly one vertex of infinite…
Past studies on the local limit of maximal weight matchings in edge-weighted large random graphs rely fundamentally on the assumption that the weights are atomless, which ensures that the maximal weight matching is unique. This excludes de…
The point process of vertices of an iteration infinitely divisible or more specifically of an iteration stable random tessellation in the Euclidean plane is considered. We explicitly determine its covariance measure and its pair-correlation…
We study the local statistics of orthogonal polynomial ensembles near a hard edge, subject to a multiplicative deformation of the measure. Probabilistically, this deformation corresponds to a position-dependent conditional thinning of the…
We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In…
We study various models of random non-crossing configurations consisting of diagonals of convex polygons, and focus in particular on uniform dissections and non-crossing trees. For both these models, we prove convergence in distribution…
We study the large-volume asymptotics of the sum of power-weighted edge lengths $\sum_{e \in E}|e|^\alpha$ in Poisson-based spatial random networks. In the regime $\alpha > d$, we provide a set of sufficient conditions under which the upper…
We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…