Related papers: The oscillatory distribution of distances in rando…
We consider the problem of allocating samples to a finite set of discrete distributions in order to learn them uniformly well in terms of four common distance measures: $\ell_2^2$, $\ell_1$, $f$-divergence, and separation distance. To…
This paper is concerned with the Stein's method associated with a (possibly) asymmetric $\alpha$-stable distribution $Z$, in dimension one. More precisely, its goal is twofold. In the first part, we exhibit a genuine bound for the…
In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively (from the root) split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities…
Many complex networks display strong heterogeneity in the degree (connectivity) distribution. Heterogeneity in the degree distribution often reduces the average distance between nodes but, paradoxically, may suppress synchronization in…
This paper deals with studying vague convergence of random measures of the form $\mu_{n}=\sum_{i=1}^{n} p_{i,n} \delta_{\theta_i}$, where $(\theta_i)_{1\le i \le n}$ is a sequence of independent and identically distributed random variables…
In the $k$-dispersion problem, we need to select $k$ nodes of a given graph so as to maximize the minimum distance between any two chosen nodes. This can be seen as a generalization of the independent set problem, where the goal is to…
In this paper, we show that the halfspace depth random variable for samples from a univariate distribution with a notion of center is distributed as a uniform distribution on the interval [0,1/2]. The simplicial depth random variable has a…
Consider a random recusive tree with n vertices. We show that the number of vertices with even depth is asymptotically normal as n tends to infinty. The same is true for the number of vertices of depth divisible by m for m=3, 4 or 5; in all…
This paper is based on the study of random lozenge tilings of non-convex polygonal regions with interacting non-convexities (cuts) and the corresponding asymptotic kernel as in [3] and [4] (discrete tacnode kernel). Here this kernel is used…
While statistical modeling of distributional data has gained increased attention, the case of multivariate distributions has been somewhat neglected despite its relevance in various applications. This is because the Wasserstein distance,…
Loops are subgraphs responsible for the multiplicity of paths going from one to another generic node in a given network. In this paper we present an analytic approach for the evaluation of the average number of loops in random scale-free…
We study the asymptotic behaviour of the distance to the first available parking slot in a recursive Manhattan street network endowed with a hyperfractal intensity structure, where slot-release events occur according to Poisson processes…
We consider the distribution of the duration time, the time elapsed since it began, of a diffusion process given its present position, under the assumption that the process began at the origin. For unbiased diffusion, the distribution does…
We investigate how correlations between the diversity of the connectivity of networks and the dynamics at their nodes affect the macroscopic behavior. In particular, we study the synchronization transition of coupled stochastic phase…
We revisit Markowitz's mean-variance portfolio selection model by considering a distributionally robust version, where the region of distributional uncertainty is around the empirical measure and the discrepancy between probability measures…
A promising new method for measuring intramolecular distances in solution uses small-angle X-ray scattering interference between gold nanocrystal labels (Mathew-Fenn et al, Science, 322, 446 (2008)). When applied to double stranded DNA, it…
The degree distribution of an ordered tree $T$ with $n$ nodes is $\vec{n} = (n_0,\ldots,n_{n-1})$, where $n_i$ is the number of nodes in $T$ with $i$ children. Let $\mathcal{N}(\vec{n})$ be the number of trees with degree distribution…
Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least…
We consider a discrete-time random walk on a one-dimensional lattice with space and time-dependent random jump probabilities, known as the Beta random walk. We are interested in the probability that, for a given realization of the jump…
Using Monte Carlo and analytic techniques, we study a minimal dynamic network involving two populations of nodes, characterized by different preferred degrees. Reminiscent of introverts and extroverts in a population, one set of nodes,…