Related papers: Sparse random matrix configurations for two or thr…
A class of splitting alternating algorithms is proposed for finding the sparse solution of linear systems with concatenated orthogonal matrices. Depending on the number of matrices concatenated, the proposed algorithms are classified into…
Few-layer graphene systems come in various stacking orders. Considering tight-binding models for electrons on stacked honeycomb layers, this gives rise to a variety of low-energy band structures near the charge neutrality point. Depending…
This paper studies the sparse identification problem of unknown sparse parameter vectors in stochastic dynamic systems. Firstly, a novel sparse identification algorithm is proposed, which can generate sparse estimates based on least squares…
We study the scaling of the localization length of two interacting particles in a one-dimensional random lattice with the single particle localization length. We obtain several regimes, among them one interesting weak Fock space disorder…
Random matrices acting on structured sets play a fundamental role in high-dimensional geometry, compressed sensing, and randomized algorithms. Existing results primarily focus on subgaussian models, when random matrices act as…
Chaotic systems, that have a small Lyapunov exponent, do not obey the common random matrix theory predictions within a wide "weak quantum chaos" regime. This leads to a novel prediction for the rate of heating for cold atoms in optical…
In a one dimensional lattice thermal fluctuations destroy the long-range order making particles of the lattice move on a scale much larger than the lattice spacing. We discuss the assumption that this motion may be responsible for the…
We consider the problem of electron transport along a one-dimensional disordered multiple-scattering conductor, and study the electron density for all the electronic levels. A model is proposed for the reduced density matrix of the system…
The prevalence of sparsity in interacting many-body systems motivates an investigation into the spectral statistics of sparse random matrices with on-site disorder. We numerically demonstrate that the Anderson transition can be identified…
Lateral microsegregation in a monolayer of a binary mixture of particles or macromolecules is studied by MD simulations in a generic model with the interacting potentials inspired by effective interactions in biological or soft-matter…
We perform experiments and phase model simulations with a ring network of oscillatory electrochemical reactions to explore the effect of random connections and non-isochronocity of the interactions on the pattern formation. A few additional…
We study matrix element fluctuations of the two-body screened Coulomb interaction and of the one-body surface charge potential in ballistic quantum dots. For chaotic dots, we use a normalized random wave model to obtain analytic expansions…
We apply Tsallis's q-indexed nonextensive entropy to formulate a random matrix theory (RMT), which may be suitable for systems with mixed regular-chaotic dynamics. We consider the super-extensive regime of q < 1. We obtain analytical…
We propose a new approach for metric learning by framing it as learning a sparse combination of locally discriminative metrics that are inexpensive to generate from the training data. This flexible framework allows us to naturally derive…
Using the superstatistics method, we propose an extension of the random matrix theory to cover systems with mixed regular-chaotic dynamics. Unlike most of the other works in this direction, the ensembles of the proposed approach are basis…
We demonstrate the connection between an operator's matrix element distribution and entangling power via numerical simulations of random, pseudo-random, and quantum chaotic operators. Creating operators with a random distribution of matrix…
In the present paper an approach for investigation of the disordered two-component Ising systems with long range interaction has been suggested. Possible applications to metalic and magnetic alloys and lattice gas are considered. We have…
We consider tensor factorizations based on sparse measurements of the components of relatively high rank tensors. The measurements are designed in a way that the underlying graph of interactions is a random graph. The setup will be useful…
The goal of these expository notes is to give an introduction to random matrices for non-specialist of this topic focusing on the link between random matrices and systems of particles in interaction. We first recall some general results…
We investigate the modification in mesoscopic electronic transport due to electron-electron interactions making use of scattering states. We demonstrate that for a specific (finite range) interaction kernel, the knowledge of the scattering…