Related papers: Explicit cutoff profiles for colored top-$m$-to-ra…
Families of symmetric simple random walks on Cayley graphs of Abelian groups with a bound on the number of generators are shown to never have sharp cut off in the sense of [1], [3], or [5]. Here convergence to the stationary distribution is…
Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll \log k \ll \log |G|$ (ie $1 \ll k = |G|^{o(1)}$). A conjecture of Aldous and Diaconis (1985) asserts, for…
For two fixed graphs $T$ and $H$ let $ex(G(n,p),T,H)$ be the random variable counting the maximum number of copies of $T$ in an $H$-free subgraph of the random graph $G(n,p)$. We show that for the case $T=K_m$ and $\chi(H)> m$ the behavior…
Decision trees are widely used for their low computational cost, good predictive performance, and ability to assess the importance of features. Though often used in practice for feature selection, the theoretical guarantees of these methods…
In this paper, we consider the problem of partitioning a small data sample of size $n$ drawn from a mixture of 2 sub-gaussian distributions in $\R^p$. We consider semidefinite programming relaxations of an integer quadratic program that is…
We study the component structure of the random graph $G=G_{n,m,d}$. Here $d=O(1)$ and $G$ is sampled uniformly from ${\mathcal G}_{n,m,d}$, the set of graphs with vertex set $[n]$, $m$ edges and maximum degree at most $d$. If $m=\mu n/2$…
Efficient and accurate estimation of multivariate empirical probability distributions is fundamental to the calculation of information-theoretic measures such as mutual information and transfer entropy. Common techniques include variations…
We present an implementation and analysis of a stochastic high performance algorithm to calculate the correlation energy of three dimensional periodic systems in second-order M{\o}ller-Plesset perturbation theory (MP2). In particular we…
In 1960, R\'enyi asked for the number of random queries necessary to recover a hidden bijective labeling of n distinct objects. In each query one selects a random subset of labels and asks, what is the set of objects that have these labels?…
We introduce the Random Subsequence Model, a spin glass model on pairs of random strings $(X,Y) \in \{0,1\}^N \times \{0,1\}^M$ whose partition function counts subsequence embeddings of $Y$ into $X$. We study two variants: the null model,…
In this paper we consider graph algorithms in models of computation where the space usage (random accessible storage, in addition to the read only input) is sublinear in the number of edges $m$ and the access to input data is constrained.…
Accurate and comprehensive atomic data are essential for the modelling of stellar spectra. Uncertainties in the oscillator strengths of specific lines used for abundance analyses directly translate into uncertainties in the derived…
We present a technique for optimizing hundreds of thousands of variational parameters in variational quantum Monte Carlo. By introducing iterative Krylov subspace solvers and by multiplying by the Hamiltonian and overlap matrices as they…
Consider the interchange process on a connected graph $G=(V,E)$ on $n$ vertices. I.e.\ shuffle a deck of cards by first placing one card at each vertex of $G$ in a fixed order and then at each tick of the clock, picking an edge uniformly at…
Motivated by the celebrated Beck-Fiala conjecture, we consider the random setting where there are $n$ elements and $m$ sets and each element lies in $t$ randomly chosen sets. In this setting, Ezra and Lovett showed an $O((t \log t)^{1/2})$…
The binomial random bipartite graph $G(n,n,p)$ is the random graph formed by taking two partition classes of size $n$ and including each edge between them independently with probability $p$. It is known that this model exhibits a similar…
Given a set $S$ of $n$ colored sites, each $s\in S$ associated with a distance-to-site function $\delta_s \colon \mathbb{R}^2 \to \mathbb{R}$, we consider two distance-to-color functions for each color: one takes the minimum of $\delta_s$…
Consider a system of $N$ non-intersecting Brownian bridges in $[0,1]$, and let $\mathcal M_N(p)$ be the maximal height attained by the top path in the interval $[0,p]$, $p\in[0,1]$. It is known that, under a suitable rescaling, the…
The stickiness effect is a fundamental feature of quasi-integrable Hamiltonian systems. We propose the use of an entropy-based measure of the recurrence plots (RP), namely, the entropy of the distribution of the recurrence times (estimated…
Given a multiset of $n$ items from $\mathcal{D}$, the \emph{profile reconstruction} problem is to estimate, for $t = 0, 1, \dots, n$, the fraction $\vec{f}[t]$ of items in $\mathcal{D}$ that appear exactly $t$ times. We consider…