English
Related papers

Related papers: Classical localization problem: a survey

200 papers

Using the supersymmetry technique, we study the localization-delocalization transition in quasi-one-dimensional non-Hermitian systems with a direction. In contrast to chains, our model captures the diffusive character of carriers' motion at…

Disordered Systems and Neural Networks · Physics 2009-10-31 A. V. Kolesnikov , K. B. Efetov

We explore the quantum dynamics of particles in a spatiotemporally driven lattice. A powerful numerical scheme is developed, which provides us with the Floquet modes and thus enables a stroboscopic propagation of arbitrary initial states. A…

Quantum Physics · Physics 2014-11-13 Thomas Wulf , Christoph Petri , Benno Liebchen , Peter Schmelcher

We address the question of symmetries of an important type of quantum walks. We introduce all the necessary definitions and provide a rigorous formulation of the problem. Using a thorough analysis, we reach the complete answer by presenting…

Quantum Physics · Physics 2012-11-02 Václav Potoček

Correlation clustering is a widely-used approach for clustering large data sets based only on pairwise similarity information. In recent years, there has been a steady stream of better and better classical algorithms for approximating this…

Data Structures and Algorithms · Computer Science 2025-04-08 Sepehr Assadi , Sanjeev Khanna , Aaron Putterman

We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding on a recent randomized iterated projection algorithm of…

Optimization and Control · Mathematics 2008-06-19 D. Leventhal , A. S. Lewis

A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we…

Combinatorics · Mathematics 2020-03-05 Sami H. Assaf

In this paper we tackle the issue of clustering trajectories of geolocalized observations. Using clustering technics based on the choice of a distance between the observations, we first provide a comprehensive review of the different…

Machine Learning · Statistics 2015-08-21 Philippe Besse , Brendan Guillouet , Jean-Michel Loubes , Royer François

We present a novel clustering approach for moving object trajectories that are constrained by an underlying road network. The approach builds a similarity graph based on these trajectories then uses modularity-optimization hiearchical graph…

Machine Learning · Statistics 2012-10-08 Mohamed Khalil El Mahrsi , Fabrice Rossi

We look at two possible routes to classical behavior for the discrete quantum random walk on the line: decoherence in the quantum ``coin'' which drives the walk, or the use of higher-dimensional coins to dilute the effects of interference.…

Quantum Physics · Physics 2009-11-07 Todd A. Brun , Hilary A. Carteret , Andris Ambainis

Passive network tomography uses end-to-end observations of network communication to characterize the network, for instance to estimate the network topology and to localize random or adversarial glitches. Under the setting of linear network…

Networking and Internet Architecture · Computer Science 2016-11-15 Hongyi Yao , Sidharth Jaggi , Minghua Chen

We present a computer simulation study of the compact self-avoiding loops as regards their length and topological state. We use a Hamiltonian closed path on the cubic-shaped segment of a 3D cubic lattice as a model of a compact polymer. The…

Soft Condensed Matter · Physics 2007-05-23 R. C. Lua , N. T. Moore , A. Yu. Grosberg

The spatial search problem aims to find a marked vertex of a finite graph using a dynamic with two constraints: (1) The walker has no compass and (2) the walker can check whether a vertex is marked only after reaching it. This problem is a…

Quantum Physics · Physics 2022-06-02 Hajime Tanaka , Mohamed Sabri , Renato Portugal

A local order parameter which is important in the analysis of phase transitions in frustrated combinatorial problems is the probability that a node is frozen in a particular state. There is a percolative transition when an infinite…

Disordered Systems and Neural Networks · Physics 2007-05-23 P. M. Duxbury

We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…

Statistical Mechanics · Physics 2012-01-10 Subhash Mahapatra , Prabwal Phukon , Tapobrata Sarkar

Percolation, describing critical behaviors of phase transition in a geometrical context, prompts wide investigations in natural and social networks as a fundamental model. The introduction of quantum-intrinsic interference and tunneling…

We address decoherence and classicalization of continuous-time quantum walks (CTQWs) on graphs. In particular, we investigate three different models of decoherence, and employ the quantum-classical (QC) dynamical distance as a figure of…

Quantum Physics · Physics 2022-10-11 Gabriele Bressanini , Claudia Benedetti , Matteo G. A. Paris

Localizing behaviors of neural networks to a subset of the network's components or a subset of interactions between components is a natural first step towards analyzing network mechanisms and possible failure modes. Existing work is often…

Machine Learning · Computer Science 2023-05-17 Nicholas Goldowsky-Dill , Chris MacLeod , Lucas Sato , Aryaman Arora

We study geodesics on the parameter manifold, for systems exhibiting second order classical and quantum phase transitions. The coupled non-linear geodesic equations are solved numerically for a variety of models which show such phase…

Statistical Mechanics · Physics 2015-06-11 Prashant Kumar , Subhash Mahapatra , Prabwal Phukon , Tapobrata Sarkar

Techniques of `dynamic renormalization', developed earlier for undirected percolation and the contact model, are adapted to the setting of directed percolation, thereby obtaining solutions of several problems for directed percolation on…

Probability · Mathematics 2007-05-23 Geoffrey Grimmett , Philipp Hiemer

We consider a set of N linearly coupled harmonic oscillators and show that the diagonalization of this problem can be put in geometrical terms. The matrix techniques developed here allowed for solutions in both the classical and quantum…

Quantum Physics · Physics 2009-11-11 A. R. Bosco de Magalhães , C. H. d'Ávila Fonseca , M. C. Nemes