Related papers: Cutoff for the cyclic adjacent transposition shuff…

In a graph, the switching operation reverses adjacencies between a subset of vertices and the others. For a hereditary graph class $\mathcal{G}$, we are concerned with the maximum subclass and the minimum superclass of $\mathcal{G}$ that…

In this paper we study the scattering amplitudes at strong coupling for the case where the number of gluons is a multiple of four. This is an important missing piece in arXiv:1002.2459. The tricky point for n=4K is that there is some…

We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation. Our method finds explicit quantum…

Parameter estimation of mixture regression model using the expectation maximization (EM) algorithm is highly sensitive to outliers. Here we propose a fast and efficient robust mixture regression algorithm, called Component-wise Adaptive…

We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undirected graph on $n$ vertices up to a $1+\epsilon$ error must…

In the present paper, exterior algebraic shifting and symmetric algebraic shifting of bipartite graphs and chordal graphs are studied. First, we will determine the symmetric algebraic shifted graph of complete bipartite graphs. It turns out…

We consider a dynamic random graph on $n$ vertices that is obtained by starting from a random graph generated according to the configuration model with a prescribed degree sequence and at each unit of time randomly rewiring a fraction…

We provide a simple new randomized contraction approach to the global minimum cut problem for simple undirected graphs. The contractions exploit 2-out edge sampling from each vertex rather than the standard uniform edge sampling. We…

Host cardinality is one of the important attributes in the field of network research. The cardinality estimation under sliding time window has become a research hotspot in recent years because of its high accuracy and small delay. This kind…

We show how the holomorphic anomaly found in hep-th/0409245 can be used to efficiently compute certain classes of unitarity cuts of one-loop N=4 amplitudes of gluons. These classes include all cuts of n-gluon one-loop MHV amplitudes and of…

Let $x_1,\ldots,x_n$ be a fixed sequence of real numbers. At each stage, pick two indices $I$ and $J$ uniformly at random and replace $x_I$, $x_J$ by $(x_I+x_J)/2$, $(x_I+x_J)/2$. Clearly all the coordinates converge to…

I present an algorithm that, given a number $n \geq 1$, computes a compact representation of the set of all noncrossing acyclic digraphs with $n$ nodes. This compact representation can be used as the basis for a wide range of dynamic…

Finite-temperature spin transport in integrable isotropic spin chains (i.e., spin chains with continuous nonabelian symmetries) is known to be superdiffusive, with anomalous transport properties displaying remarkable robustness to isotropic…

A match cut is a transition between a pair of shots that uses similar framing, composition, or action to fluidly bring the viewer from one scene to the next. Match cuts are frequently used in film, television, and advertising. However,…

We show that the recently introduced classical Arnol'd cat map lattice field theories, which are chaotic, are exponentially mixing to all orders. Their mixing times are well-defined and are expressed in terms of the Lyapunov exponents, more…

We prove a cutoff for the random walk on random $n$-lifts of finite weighted graphs, even when the random walk on the base graph $\mathcal{G}$ of the lift is not reversible. The mixing time is w.h.p. $t_{mix}=h^{-1}\log n$, where $h$ is a…

Models for quantum computation with circuit connections subject to the quantum superposition principle have been recently proposed. There, a control quantum system can coherently determine the order in which a target quantum system…

For an $n$-element subset $U$ of $\mathbb{Z}^2$, select $x$ from $U$ according to harmonic measure from infinity, remove $x$ from $U$, and start a random walk from $x$. If the walk leaves from $y$ when it first enters $U$, add $y$ to $U$.…

Divide a deck of $kn$ cards into $k$ equal piles and place them from left to right. The standard shuffle $\sigma$ is performed by picking up the top cards one by one from left to right and repeating until all cards have been picked up. For…

We explore new approaches for finding matrix multiplication algorithms in the commutative setting by adapting the flip graph technique: a method previously shown to be effective for discovering fast algorithms in the non-commutative case.…