Related papers: Periodic orbit theory and spectral statistics for …
The global constraints on chaotic dynamics induced by the analyticity of smooth flows are used to dispense with individual periodic orbits and derive infinite families of exact sum rules for several simple dynamical systems. The associated…
Given a labeled graph, the frequent-subgraph mining (FSM) problem asks to find all the $k$-vertex subgraphs that appear with frequency greater than a given threshold. FSM has numerous applications ranging from biology to network science, as…
This paper establishes suficient conditions for the orbital stability of one-parameter spatially periodic traveling-wave solutions for one-dimensional dispersive equations. Our method of proof combines known techniques with some new ideas.…
There is a connection between *-representations of algebras associated with graphs and the problem about the spectrum of a sum of Hermitian operators (spectral problem). For algebras associated with extended Dynkin graphs we give an…
As a contribution to the inverse scattering problem for classical chaotic systems, we show that one can select sequences of intervals of continuity, each of which yields the information about period, eigenvalue and symmetry of one unstable…
Complex networks or graphs are ubiquitous in sciences and engineering: biological networks, brain networks, transportation networks, social networks, and the World Wide Web, to name a few. Spectral graph theory provides a set of useful…
The theory of scattering of atom pairs in a periodic potential is presented for the case of different atoms. When the scattering dynamics is restricted to the lowest Bloch band of the periodic potential, a separation in relative and average…
We analyze spectral properties of a quantum graph in the form of a ring chain with a $\delta$ coupling in the vertices exposed to a homogeneous magnetic field perpendicular to the graph plane. We find the band spectrum in the case when the…
We review recent progress in attaining a quantitative understanding of the scarring phenomenon, the non-random behavior of quantum wavefunctions near unstable periodic orbits of a classically chaotic system. The wavepacket dynamics…
We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous-time, which involves sketching small weighted graphs with self-loops and considering degenerate…
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…
Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…
This paper tackles important aspects of comets dynamics from a statistical point of view. Existing methodology uses numerical integration for computing planetary perturbations for simulating such dynamics. This operation is highly…
This paper is devoted to the investigation of the spectral theory and dynamical properties of periodic graphs which are not locally finite but carry non-negative, symmetric and summable edge weights. These graphs are shown to exhibit rather…
This paper studies projections of uniform random elements of (co)adjoint orbits of compact Lie groups. Such projections generalize several widely studied ensembles in random matrix theory, including the randomized Horn's problem, the…
We consider the dynamics of relativistic spin-half particles in quantum graphs with transparent branching points. The system is modeled by combining the quantum graph concept with the one of transparent boundary conditions applied to the…
We study the quantum-mechanical transport on two-dimensional graphs by means of continuous-time quantum walks and analyse the effect of different boundary conditions (BCs). For periodic BCs in both directions, i.e., for tori, the problem…
This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…
As the name indicates, a periodic orbit is a solution for a dynamical system that repeats itself in time. In the regular regime, periodic orbits are stable, while in the chaotic regime, they become unstable. The presence of unstable…
In the present paper, we study the continuous-time quantum walk on quotient graphs. On such graphs, there is a straightforward reduction of problem to a subspace that can be considerably smaller than the original one. Along the lines of…