Related papers: Gaussian approximation for rooted edges in a rando…

The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…

We show that the Brownian continuum random tree is the Gromov-Hausdorff-Prohorov scaling limit of the uniform spanning tree on high-dimensional graphs including the $d$-dimensional torus $\mathbb{Z}_n^d$ with $d>4$, the hypercube…

Consider the following partial "sorting algorithm" on permutations: take the first entry of the permutation in one-line notation and insert it into the position of its own value. Continue until the first entry is 1. This process imposes a…

We work on a Galton--Watson tree with random weights, in the so-called "subdiffusive" regime. We study the rate of decay of the conductance between the root and the $n$-th level of the tree, as $n$ goes to infinity, by a mostly analytic…

On the 1+2 dimensional lattice, we consider a directed polymer in a random Gaussian environment that is independent in time and correlated in space. The spatial correlation is supposed to decay as $(\log |x|)^a /|x|^{2}$, $a>-1$, where the…

We obtained Pearson's coefficient of strongly correlated recursive networks growing by preferential attachment of every new vertex by $m$ edges. We found that the Pearson coefficient is exactly zero in the infinite network limit for the…

Let $\eta_t$ be a Poisson point process of intensity $t\geq 1$ on some state space $\Y$ and $f$ be a non-negative symmetric function on $\Y^k$ for some $k\geq 1$. Applying $f$ to all $k$-tuples of distinct points of $\eta_t$ generates a…

We consider the number of edge crossings in a random graph drawing generated by projecting a random geometric graph on some compact convex set $W\subset \mathbb{R}^d$, $d\geq 3$, onto a plane. The positions of these crossings form the…

Consider a random uniform sample of $n$ points in a compact region $A$ of Euclidean $d$-space, $d \geq 2$, with a smooth or (when $d=2$) polygonal boundary. Fix $k \in {\bf N}$. Let $T_{n,k}$ be the threshold $r$ at which the geometric…

We prove that every 3-regular, n-vertex simple graph with sufficiently large girth contains an independent set of size at least 0.4361n. (The best known bound is 0.4352n.) In fact, computer simulation suggests that the bound our method…

We study random two-dimensional spanning forests in the plane that can be viewed both in the discrete case and in their appropriately taken scaling limits as a uniformly chosen spanning tree with some Poissonian deletion of edges or points.…

We study the normal approximation of functionals of Poisson measures having the form of a finite sum of multiple integrals. When the integrands are nonnegative, our results yield necessary and sufficient conditions for central limit…

For a class of degenerate diffusion processes of rank 2, i.e. when only Poisson brackets of order one are needed to span the whole space, we obtain a parametrix representation of the density from which we derive some explicit Gaussian…

Treedepth, a more restrictive graph width parameter than treewidth and pathwidth, plays a major role in the theory of sparse graph classes. We show that there exists a constant $C$ such that for every positive integers $a,b$ and a graph…

A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps…

We establish a rigorous asymptotic theory for the joint estimation of roughness and scale parameters in two-dimensional Gaussian random fields with power-law generalized covariances \cite{Matheron1973, Stein1999, Yaglom1987}. Our main…

We consider Berry's random planar wave model (1977), and prove spatial functional limit theorems - in the high-energy limit - for discretized and truncated versions of the random field obtained by restricting its nodal length to rectangular…

We consider Robinson-Schensted-Knuth algorithm applied to a random input and study the growth of the bottom rows of the corresponding Young diagrams. We prove multidimensional Poisson limit theorem for the resulting Plancherel growth…

We study random integer-valued Lipschitz functions on regular trees. It was shown by Peled, Samotij and Yehudayoff that such functions are localized, however, finer questions about the structure of Gibbs measures remain unanswered. Our main…

A Chebyshev-type quadrature for a probability measure sigma is a distribution which is uniform on n points and has the same first k moments as sigma. We give an upper bound for the minimal n required to achieve a given degree k, for sigma…