Related papers: Stick-breaking PG(\alpha,\zeta)-Generalized Gamma …

We consider the dimer model on piecewise Temperleyan, simply connected domains, on families of graphs which include the square lattice as well as superposition graphs. We focus on the spanning tree $\mathcal{T}_\delta$ associated to this…

This paper develops some general calculus for GGC and Dirichlet process means functionals. It then proceeds via an investigation of positive Linnik random variables, and more generally random variables derived from compositions of a stable…

We investigate the distribution of the Riemann zeta-function on the line $\Re(s)=\sigma$. For $\tfrac 12 < \sigma \le 1$ we obtain an upper bound on the discrepancy between the distribution of $\zeta(s)$ and that of its random model,…

We introduce a new class of nonparametric prior distributions on the space of continuously varying densities, induced by Dirichlet process mixtures which diffuse in time. These select time-indexed random functions without jumps, whose…

In this paper, we study a new discrete tree and the resulting branching process, which we call the \textbf{E}rlang \textbf{W}eighted \textbf{T}ree(\textbf{EWT}). The EWT appears as the local weak limit of a random graph model proposed…

The large deviation principle is established for the Poisson--Dirichlet distribution when the parameter $\theta$ approaches infinity. The result is then used to study the asymptotic behavior of the homozygosity and the Poisson--Dirichlet…

The partially asymmetric exclusion process (PASEP) is an important model from statistical mechanics which describes a system of interacting particles hopping left and right on a one-dimensional lattice of N sites. It is partially asymmetric…

We study a class of coalescents derived from a sampling procedure out of N i.i.d. Pareto(alpha) random variables, normalized by their sum, including beta-size-biasing on total length effects (beta < alpha). Depending on the range of alpha,…

In 1999, Zhang proved that, for first passage percolation on the square lattice $\mathbb{Z}^2$ with i.i.d. non-negative edge weights, if the probability that the passage time distribution of an edge $P(t_e = 0) =1/2 $, the critical value…

We give a Dirichlet form approach for the construction of distorted Brownian motion in a bounded domain $\Omega$ of $\mathbb{R}^d$, $d \geq 1$, with boundary $\Gamma$, where the behavior at the boundary is sticky. The construction covers…

Analytical results are presented for the structure of networks that evolve via a preferential-attachment-random-deletion (PARD) model in the regime of overall network growth and in the regime of overall contraction. The phase transition…

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…

Given a tree and a set P of non-trivial simple paths on it, VPT(P) is the VPT graph (i.e. the vertex intersection graph) of the paths P, and EPT(P) is the EPT graph (i.e. the edge intersection graph) of P. These graphs have been extensively…

We introduce a simple tree growth process that gives rise to a new two-parameter family of discrete fragmentation trees that extends Ford's alpha model to multifurcating trees and includes the trees obtained by uniform sampling from…

It is shown that for a non-decreasing self-similar stochastic process $T$ with independent increments, the range of $T$ forms a Poisson point process with $\sigma$-finite intensity if and only if the one-dimensional distribution of $T(1)$…

We investigate the possibility of large CP- violating phases in the soft breaking terms derived in superstring models. The bounds on the electric dipole moments (EDM's) of the electron and neutron are satisfied through cancellations…

We derive a construction of the beta process that allows for the atoms with significant measure to be drawn first. Our representation is based on an extension of the Sethuraman (1994) construction of the Dirichlet process, and therefore we…

Gaussian processes (GPs) provide a probabilistic nonparametric representation of functions in regression, classification, and other problems. Unfortunately, exact learning with GPs is intractable for large datasets. A variety of approximate…

Many hard graph problems, such as Hamiltonian Cycle, become FPT when parameterized by treewidth, a parameter that is bounded only on sparse graphs. When parameterized by the more general parameter clique-width, Hamiltonian Cycle becomes…

Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on the realizations of graphic degree sequences of simple graphs. Several results were proved on rapidly mixing Markov chains on unconstrained,…