Related papers: Cutoff for the cyclic adjacent transposition shuff…
The universal anomalous diffusion scaling is obtained for the semiclassical quantum Hall transition, which has been argued to describe samples with dissipation or correlated impurities. The results explain a discrepancy between existing…
We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…
Consider the following one player game. A deck containing $m$ copies of $n$ different card types is shuffled uniformly at random. Each round the player tries to guess the next card in the deck, and then the card is revealed and discarded.…
We propose Continual Repeated Annealed Flow Transport Monte Carlo (CRAFT), a method that combines a sequential Monte Carlo (SMC) sampler (itself a generalization of Annealed Importance Sampling) with variational inference using normalizing…
An error analysis of Runge-Kutta convolution quadrature based on Gauss methods applied to hyperbolic operators is given. The order of convergence relies heavily on the parity of the number of stages, a more favourable situation arising for…
The process of alternately row scaling and column scaling a positive $n \times n$ matrix $A$ converges to a doubly stochastic positive $n \times n$ matrix $S(A)$, often called the \emph{Sinkhorn limit} of $A$. The main result in this paper…
In this paper we investigate the bifurcation structure of the triangular SKT model in the weak competition regime and of the corresponding fast-reaction system in 1D and 2D domains via numerical continuation methods. We show that the…
We present the results of million atom electronic quantum transport calculations for graphene nanoconstrictions with edges that are smooth apart from atomic scale steps. We find conductances quantized in integer multiples of 2e2/h and a…
We consider a three-dimensional chaotic system consisting of the suspension of Arnold's cat map coupled with a clock via a weak dissipative interaction. We show that the coupled system displays a synchronization phenomenon, in the sense…
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential quantum-classical gap in the hitting time of discrete quantum…
Dirichlet process mixture models suffer from slow mixing of the MCMC posterior chain produced by stick-breaking Gibbs samplers, as opposed to collapsed Gibbs samplers based on the Polya urn representation which have shorter integrated…
This article aims to present the $AT$ algorithm, a novel two-step iterative approach for approximating fixed points of weak contractions within complete normed linear spaces. The article demonstrates the convergence of $AT$ algorithm…
Adaptive methods are extremely popular in machine learning as they make learning rate tuning less expensive. This paper introduces a novel optimization algorithm named KATE, which presents a scale-invariant adaptation of the well-known…
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
Spanners have been shown to be a powerful tool in graph algorithms. Many spanner constructions use a certain type of clustering at their core, where each cluster has small diameter and there are relatively few spanner edges between…
Unitary transformations are an essential tool for the theoretical understanding of many systems by mapping them to simpler effective models. A systematically controlled variant to perform such a mapping is a perturbative continuous unitary…
In this article, we prove the cutoff phenomenon for a general class of the discrete-time nonlinear recombination models. This system models the evolution of a probability measure on a finite product space $S^n$ representing the state of…
An exponential-time exact algorithm is provided for the task of clustering n items of data into k clusters. Instead of seeking one partition, posterior probabilities are computed for summary statistics: the number of clusters, and pairwise…
We consider a card guessing game with complete feedback. An ordered deck of $n$ cards labeled $1$ up to $n$ is shelf-shuffled exactly one time. One after the other a single card is drawn from the shuffled deck. The guesser makes has guess…
It is natural to expect that nonbacktracking random walk will mix faster than simple random walks, but so far this has only been proved in regular graphs. To analyze typical irregular graphs, let $G$ be a random graph on $n$ vertices with…