Related papers: Chasing Silver
Coincidence Site Lattices (CSLs) are a well established tool in the theory of grain boundaries. For several lattices up to dimension $d=4$, the CSLs are known explicitly as well as their indices and multiplicity functions. Many of them…
We give an alternative proof of the localization of Sinai's random walk in random environment under weaker hypothesis than the ones used by Sinai. Moreover we give estimates that are stronger than the one of Sinai on the localization…
This is a technical report, containing all the theorem proofs and additional evaluations in paper "Network Capability in Localizing Node Failures via End-to-end Path Measurements" by Liang Ma, Ting He, Ananthram Swami, Don Towsley, and Kin…
Modern learning classifier systems typically exploit a niched genetic algorithm to facilitate rule discovery. When used for reinforcement learning, such rules represent generalisations over the state-action-reward space. Whilst encouraging…
Transfer learning has been proven effective when within-target labeled data is scarce. A lot of works have developed successful algorithms and empirically observed positive transfer effect that improves target generalization error using…
In the recent paper [I.M.Suslov, JETP {\bf 114} (2012) 107] a new scaling theory of electron localization was proposed. We show that numerical data for the quasi-one dimensional Anderson model do not support predictions of this theory.
Continuous spontaneous localisation (CSL) is a model that captures the effects of a class of extensions to quantum theory which are expected to result from quantum gravity, and is such that wavefunction collapse is a physical process. The…
We present a closed-form expression for the survival probability of a biased random walker to first reach a target site on a 1D lattice. The expression holds for any step number $N$ and is computationally faster than non-closed-form results…
The Capacitated Facility Location (CFL), a long-standing classic problem with intriguing approximability and literature dated back to the 90s, is considered. Following the open question posted in [Williamson and Shmoys, 2011] and the…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
By a virtual model, we mean a model of set theory which is elementary in its transitive closure. Virtual models are first used by Neeman \cite{neeman2014forcing} to iterate forcing. That paper is concerned with proper forcing. The method…
In this paper we develop a Nash-Moser iteration type reducibility approach to prove the (inverse) localization for some $d$-dimensional discrete almost-periodic operators with power-law long-range hopping. We also provide a quantitative…
The present paper is devoted to new, improved bounds for the eigenfunctions of random operators in the localized regime. We prove that, in the localized regime with good probability, each eigenfunction is exponentially decaying outside a…
We consider the model of a directed polymer pinned to a line of i.i.d. random charges, and focus on the interior of the delocalized phase. We first show that in this region, the partition function remains bounded. We then prove that for…
In sufficiently strong scattering media, light transport is suppressed and modes are exponentially localized. Anderson-like localized states have long been recognized as potential candidate for high-Q optical modes for low-threshold, cost…
It was recently shown that the lossless compression of a single source $X^n$ is achievable with a notion of strong locality; any $X_i$ can be decoded from a constant number of compressed bits, with a vanishing in $n$ probability of error.…
We propose a localized divide and conquer algorithm for inverse factorization $S^{-1} = ZZ^*$ of Hermitian positive definite matrices $S$ with localized structure, e.g. exponential decay with respect to some given distance function on the…
We suggest necessary conditions of soficness of multidimensional shifts formulated in termsof resource-bounded Kolmogorov complexity. Using this technique we provide examples ofeffective and non-sofic shifts on $\mathbb{Z}^2$ with very low…
In this review article we describe the localization of three dimensional N=2 supersymmetric theories on compact manifolds, including the squashed sphere, S^3_b, the lens space, S^3_b/Z_p, and S^2 x S^1. We describe how to write…
We use the approximation method of Razborov to analyze the locality barrier which arose from the investigation of the hardness magnification approach to complexity lower bounds. Adapting a limitation of the approximation method obtained by…