SearcharxivSearch

arXiv subjects

Yu. Dabaghian

Publications and source records attributed to Yu. Dabaghian.

18 recordsLinked to original sources

Topological schemas of cognitive maps and spatial learning in the hippocampus

Spatial navigation in mammals is based on building a mental representation of their environment---a cognitive map. However, both the nature of this cognitive map and its underpinning in neural structures and activity remains vague. A key difficulty is that these maps are collective, emergent phenomena that cannot be reduced to a simple combination of inputs provided by individual neurons. In this paper we suggest computational frameworks for integrating the spiking signals of individual cells into a spatial map, which we call schemas. We provide examples of four schemas defined by different types of topological relations that may be neurophysiologically encoded in the brain and demonstrate that each schema provides its own large-scale characteristics of the environment---the schema integrals. Moreover, we find that, in all cases, these integrals are learned at a rate which is faster than the rate of complete training of neural networks. Thus, the proposed schema framework differentiates between the cognitive aspect of spatial learning and the physiological aspect at the neural network level.

q-bio.NC

Topological Maps from Signals

We discuss the task of reconstructing the topological map of an environment based on the sequences of locations visited by a mobile agent -- this occurs in systems neuroscience, where one runs into the task of reconstructing the global topological map of the environment based on activation patterns of the place coding cells in hippocampus area of the brain. A similar task appears in the context of establishing wifi connectivity maps.

q-bio.QM

Complexity of spectral sequences: semiclassical approach

It has been long recognized that the task of semiclassical evaluation of quantum spectra for the classically nonintegrable systems is fundamentally more complex than for the classically integrable ones. Below it is argued that the quantum spectra of the chaotic systems can differ among themselves by level of their complexity.

quant-ph

Topological coding in hippocampus

The proposed analysis of the currently available experimental results concerning the neural cell activity in the brain area known as hippocampus suggests a particular mechanism of spatial information and memory processing. Below it is argued that the spatial information available through the analysis of the hippocampal cell activity is predominantly of topological nature. It is pointed out that a direct topological analysis can produce a topological invariant based classification of the cell activity patterns and a complete topological description of animal's current environment. It also provides a full first order logical system for local topological reasoning about spatial structure and animal's navigational strategies.

q-bio.OT

Periodic orbit theory and spectral statistics for scaling quantum graphs

The explicit solution to the spectral problem of quantum graphs found recently in \cite{Anima}, is used to produce the exact periodic orbit theory description for the probability distributions of spectral statistics, including the distribution for the nearest neighbor separations, $s_{n}=k_{n}-k_{n-1}$, and the distribution of the spectral oscillations around the average, $δk_{n}=k_{n}-\bar k_{n}$.

quant-ph

Statistical Properties of Quantum Graph Spectra

A general analytical approach to the statistical description of quantum graph spectra based on the exact periodic orbit expansions of quantum levels is discussed. The exact and approximate expressions obtained in \cite{Anima} for the probability distribution functions using the spectral hierarchy method are analyzed. In addition, the mechanism of appearance of the universal statistical properties of spectral fluctuations of quantum-chaotic systems is considered in terms of the semiclassical theory of periodic orbits.

quant-ph

Spectral statistics for scaling quantum graphs

The explicit solution to the spectral problem of quantum graphs is used to obtain the exact distributions of several spectral statistics, such as the oscillations of the quantum momentum eigenvalues around the average, $δk_{n}=k_{n}-\bar k_{n}$, and the nearest neighbor separations, $s_{n}=k_{n}-k_{n-1}$.

quant-ph

Quantum chaos in elementary quantum mechanics

We introduce an analytical solution to the one of the most familiar problems from the elementary quantum mechanics textbooks. The following discussion provides simple illustrations to a number of general concepts of quantum chaology, along with some recent developments in the field and a historical perspective on the subject.

quant-ph

Explicit Spectral formulae for scaling quantum graphs

We present an exact analytical solution of the spectral problem of quasi one-dimensional scaling quantum graphs. Strongly stochastic in the classical limit, these systems are frequently employed as models of quantum chaos. We show that despite their classical stochasticity all scaling quantum graphs are explicitly solvable in the form $E_n=f(n)$, where $n$ is the sequence number of the energy level of the quantum graph and $f$ is a known function, which depends only on the physical and geometrical properties of the quantum graph. Our method of solution motivates a new classification scheme for quantum graphs: we show that each quantum graph can be uniquely assigned an integer $m$ reflecting its level of complexity. We show that a taut string with piecewise constant mass density provides an experimentally realizable analogue system of scaling quantum graphs.

quant-ph

Solution of scaling quantum networks

We show that all scaling quantum graphs are explicitly integrable, i.e. any one of their spectral eigenvalues $E_n$ is computable analytically, explicitly, and individually for any given $n$. This is surprising, since quantum graphs are excellent models of quantum chaos [see, e.g., T. Kottos and H. Schanz, Physica E {\bf 9}, 523 (2001)].

quant-ph

Explicit, analytical solution of scaling quantum graphs

Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos and quantum chaotic systems are not usually explicitly analytically solvable.

quant-ph

Integrability in 1D Quantum Chaos

Explicit, exact periodic orbit expansions for individual eigenvalues exist for a subclass of quantum networks called regular quantum graphs. We prove that all linear chain graphs have a regular regime.

quant-ph

Mathematical Foundations of Regular Quantum Graphs

We define a class of quantum systems called regular quantum graphs. Although their dynamics is chaotic in the classical limit with positive topological entropy, the spectrum of regular quantum graphs is explicitly computable analytically and exactly, state by state, by means of periodic orbit expansions. We prove analytically that the periodic orbit series exist and converge to the correct spectral eigenvalues. We investigate the convergence properties of the periodic orbit series and prove rigorously that both conditionally convergent and absolutely convergent cases can be found. We compare the periodic orbit expansion technique with Lagrange's inversion formula. While both methods work and yield exact results, the periodic orbit expansion technique has conceptual value since all the terms in the expansion have direct physical meaning and higher order corrections are obtained according to physically obvious rules. In addition our periodic orbit expansions provide explicit analytical solutions for many classic text-book examples of quantum mechanics that previously could only be solved using graphical or numerical techniques.

quant-ph

Spectra of regular quantum graphs

We consider a class of simple quasi one-dimensional classically non-integrable systems which capture the essence of the periodic orbit structure of general hyperbolic nonintegrable dynamical systems. Their behavior is simple enough to allow a detailed investigation of both classical and quantum regimes. Despite their classical chaoticity, these systems exhibit a ``nonintegrable analog'' of the Einstein-Brillouin-Keller quantization formula which provides their spectra explicitly, state by state, by means of convergent periodic orbit expansions.

quant-ph

One-dimensional quantum chaos: Explicitly solvable cases

We present quantum graphs with remarkably regular spectral characteristics. We call them {\it regular quantum graphs}. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly solvable in terms of periodic orbits. We present analytical solutions for the spectrum of regular quantum graphs in the form of explicit and exact periodic orbit expansions for each individual energy level.

quant-ph

Multiple Perron-Frobenius operators

A cycle expansion technique for discrete sums of several PF operators, similar to the one used in standard classical dynamical zeta-function formalism is constructed. It is shown that the corresponding expansion coefficients show an interesting universal behavior, which illustrates the details of the interference between the particlar mappings entering the sum.

nlin.CD

Explicitly solvable cases of one-dimensional quantum chaos

We identify a set of quantum graphs with unique and precisely defined spectral properties called {\it regular quantum graphs}. Although chaotic in their classical limit with positive topological entropy, regular quantum graphs are explicitly solvable. The proof is constructive: we present exact periodic orbit expansions for individual energy levels, thus obtaining an analytical solution for the spectrum of regular quantum graphs that is complete, explicit and exact.

quant-ph