Related papers: Optimizing mixing in the Rudner-Levitov lattice
In this paper, we study an efficient algorithm for constructing node sets of high-quality quasi-Monte Carlo integration rules for weighted Korobov, Walsh, and Sobolev spaces. The algorithm presented is a reduced fast successive coordinate…
We give a bound on the mixing time of a uniformly ergodic, reversible Markov chain in terms of the spectral radius of the transition operator. This bound has been established previously in finite state spaces, and is widely believed to hold…
We improve upon all known lower bounds on the critical fugacity and critical density of the hard sphere model in dimensions two and higher. As the dimension tends to infinity our improvements are by factors of $2$ and $1.7$, respectively.…
Exceptional points in an optical dimer of spheres, which have the same size and operate in the spectral region of the dipolar resonance, are considered. By choosing different materials of these spheres, we can offset the radiative loss and…
The main goal of the paper is to find the {\it absolute maximum} of the width of the separatrix chaotic layer as function of the frequency of the time-periodic perturbation of a one-dimensional Hamiltonian system possessing a separatrix,…
Lattice reduction algorithms, such as the LLL algorithm, have been proposed as preprocessing tools in order to enhance the performance of suboptimal receivers in MIMO communications. In this paper we introduce a new kind of lattice…
We study the problem of clustering $T$ trajectories of length $H$, each generated by one of K unknown ergodic Markov chains over a finite state space of size $S$. We derive an instance-dependent, high-probability lower bound on the…
Lattice-linearity was introduced as a way to model problems using predicates that induce a lattice among the global states (Garg, SPAA 2020). A key property of \textit{the predicate} representing such problems is that it induces…
Linear nested codes, where two or more sub-codes are nested in a global code, have been proposed as candidates for reliable multi-terminal communication. In this paper, we consider nested array-based spatially coupled low-density…
We consider $\mathbb{Z}_2$-synchronization on the Euclidean lattice. Every vertex of $\mathbb{Z}^d$ is assigned an independent symmetric random sign $\theta_u$, and for every edge $(u,v)$ of the lattice, one observes the product…
Synchronization in a lattice of a finite population of phase oscillators with algebraically decaying, non-normalized coupling is studied by numerical simulations. A critical level of decay is found, below which full locking takes place if…
Krylov subspace recycling is a powerful tool for solving long series of large, sparse linear systems that change slowly. In PDE constrained shape optimization, these appear naturally, as hundreds or more optimization steps are needed with…
In this article we consider a lattice system of unbounded continuos spins. Otto & Reznikoff used the two-scale approach to show that exponential decay of correlations yields a logarithmic Sobolev inequality (LSI) with uniform constant in…
In this article we derive an (almost) optimal scaling law for a singular perturbation problem associated with the Tartar square. As in \cite{W97, C99}, our upper bound quantifies the well-known construction which is used in the literature…
The problem of efficiently sampling from a set of(undirected) graphs with a given degree sequence has many applications. One approach to this problem uses a simple Markov chain, which we call the switch chain, to perform the sampling. The…
The machine learning explosion has created a prominent trend in modern computer hardware towards low precision floating-point operations. In response, there have been growing efforts to use low and mixed precision in general scientific…
The dynamic iteration method with a restricted additive Schwarz splitting is investigated to co-simulate linear differential algebraic equations system coming from RLC electrical circuit with linear components. We show the pure linear…
We discuss space-time chaos and scaling properties for classical non-Abelian gauge fields discretized on a spatial lattice. We emphasize that there is a ``no go'' for simulating the original continuum classical gauge fields over a long time…
We consider the inverse scattering problem for time-harmonic acoustic waves in a medium with pointwise inhomogeneities. In the Foldy-Lax model, the estimation of the scatterers' locations and intensities from far field measurements can be…
In a series of recent works, Boyd, Diaconis, and their co-authors have introduced a semidefinite programming approach for computing the fastest mixing Markov chain on a graph of allowed transitions, given a target stationary distribution.…