Related papers: Extra heads and invariant allocations

This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching with independent edge weights to geometric models.…

We present simpler algorithms for two closely related morphing problems, both based on the barycentric interpolation paradigm introduced by Floater and Gotsman, which is in turn based on Floater's asymmetric extension of Tutte's classical…

The spectral gap $\gamma$ of a finite, ergodic, and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence. In applications, the transition matrix $P$ may be unknown, yet one sample of the chain up to…

The fermion doubling theorem plays a pivotal role in Hermitian topological materials. It states, for example, that Weyl points must come in pairs in three-dimensional semimetals. Here, we present an extension of the doubling theorem to…

Investigating translationally invariant qudit spin chains with a low local dimension, we ask what is the best possible tradeoff between the scaling of the entanglement entropy of a large block and the inverse-polynomial scaling of the…

In dense Erd\H{o}s-R\'enyi random graphs, we are interested in the events where large numbers of a given subgraph occur. The mean behavior of subgraph counts is known, and only recently were the related large deviations results discovered.…

We introduce $n(n-1)/2$ natural involutions ("toggles") on the set $S$ of noncrossing partitions $\pi$ of size $n$, along with certain composite operations obtained by composing these involutions. We show that for many operations $T$ of…

We consider topologically twisted $\mathcal{N}=2$, $SU(2)$ gauge theory with a massive adjoint hypermultiplet on a smooth, compact four-manifold $X$. A consistent formulation requires coupling the theory to a ${\rm Spin}^c$ structure, which…

We describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several…

The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions. However, in general, it is not necessarily…

Hoeffding has shown that tail bounds on the distribution for sampling from a finite population with replacement also apply to the corresponding cases of sampling without replacement. (A special case of this result is that binomial tail…

A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is…

We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property pi is called a pi-graph. If pi satisfies certain properties, then an n-node m-edge pi-graph G can…

For $\mu$ an edge percolation measure on the infinite square lattice, let $\mu_{\textit{hp}}$ (respectively, $\mu^*_{hp}$) denote its marginal (respectively, the marginal of its planar dual process) on the upper half-plane. We show that if…

The Standard Model calculation of $H\rightarrow\gamma\gamma$ has the curious feature of being finite but regulator-dependent. While dimensional regularization yields a result which respects the electromagnetic Ward identities, additional…

We revisit the problem of classifying topological band structures in non-Hermitian systems. Recently, a solution has been proposed, which is based on redefining the notion of energy band gap in two different ways, leading to the so-called…

For a group $\Gamma$, a $\Gamma$-labelled graph is an undirected graph $G$ where every orientation of an edge is assigned an element of $\Gamma$ so that opposite orientations of the same edge are assigned inverse elements. A path in $G$ is…

The method of alternating projections involves projecting an element of a Hilbert space cyclically onto a collection of closed subspaces. It is known that the resulting sequence always converges in norm and that one can obtain estimates for…

We construct a piecewise-polynomial interpolant $u \mapsto \Pi u$ for functions $u:\Omega \setminus \Gamma \to \mathbb{R}$, where $\Omega \subset \mathbb{R}^d$ is a Lipschitz polyhedron and $\Gamma \subset \Omega$ is a possibly non-manifold…

Given a finite-to-one factor code $\pi: X \to Y$ between irreducible sofic shifts and an ergodic $\nu$ on $Y$ with full support, it is known that the fiber $\pi^{-1}_*(\nu)$ has at most $d_\pi$ ergodic measures in it where $d_\pi$ is the…