Related papers: Spectral properties of disordered fully-connected …
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. The adjacency and Laplacian eigenvalues of an oriented hypergraph are studied. Eigenvalue bounds for both the adjacency and Laplacian…
We present full description of spectra for a Hamiltonian defined on periodic hexagonal elastic lattices. These continua are constructed out of Euler-Bernoulli beams, each governed by a scalar-valued self-adjoint operator, which is also…
We study the spectral properties of a system of electrons interacting through long-range Coulomb potential on a one-dimensional chain. When the interactions dominate over the electronic bandwidth, the charges arrange in an ordered…
We investigate the low-temperature properties of a ultracold gas made of bosonic alkali-metal atoms with finite-range interaction under the effect of a disordered environment. The statistical characterization of the disorder is investigated…
The critical behavior of the contact process in disordered and periodic binary 2d-lattices is investigated numerically by means of Monte Carlo simulations as well as via an analytical approximation and standard mean field theory.…
Let $G$ be a graph obtained as the union of some $n$-vertex graph $H_n$ with minimum degree $\delta(H_n)\geq\alpha n$ and a $d$-dimensional random geometric graph $G^d(n,r)$. We investigate under which conditions for $r$ the graph $G$ will…
We report the exact solution of spectral problem for a graphene sheet framed by two armchair- and two zigzag-shaped boundaries. The solution is found for the $\pi$ electron Hamiltonian and gives, in particular, a closed analytic expression…
We consider a problem of superconductivity coexistence with the spin-density-wave order in disordered multiband metals. It is assumed that random variations of the disorder potential on short length scales render the interactions between…
Spectral analysis of networks states that many structural properties of graphs, such as centrality of their nodes, are given in terms of their adjacency matrices. The natural extension of such spectral analysis to higher order networks is…
We prove a sufficient condition for synchronization for coupled one-dimensional maps and estimate the size of the window of parameters where synchronization takes place. It is shown that coupled systems on graphs with positive eigenvalues…
Highly-regular graphs can be regarded as a combinatorial generalization of distance-regular graphs. From this standpoint, we study combinatorial aspects of highly-regular graphs. As a result, we give the following three main results in this…
Disordered mechanical systems with high connectivity represent a limit opposite to the more familiar case of disordered crystals. Individual ions in a crystal are subjected essentially to nearest-neighbor interactions. In contrast, the…
We study electron transport properties of a monoatomic graphite layer (graphene) with different types of disorder at half filling. We show that the transport properties of the system depend strongly on the symmetry of disorder. We find that…
How can the `affinity' or `strength' of ties of a random graph be characterized and compactly represented? How can concepts like Fourier and inverse-Fourier like transform be developed for graph data? To do so, we introduce a new…
Characterizing the in uence of network properties on the global emerging behavior of interacting elements constitutes a central question in many areas, from physical to social sciences. In this article we study a primary model of disordered…
We analyze the spectrum of the generalized Schrodinger operator in $L^2(R^\nu) \nu \geq 2$, with a general local, rotationally invariant singular interaction supported by an infinite family of concentric, equidistantly spaced spheres. It is…
The complicated interactions in presence of disorder lead to a correlated randomization of states. The Hamiltonian as a result behaves like a multi-parametric random matrix with correlated elements. We show that the eigenvalue correlations…
We study the family of Hamiltonians which corresponds to the adjacency operators on a percolation graph. We characterise the set of energies which are almost surely eigenvalues with finitely supported eigenfunctions. This set of energies is…
We investigate the dynamics of an initially disentangled Gaussian state on a general finite symmetric graph. As concrete examples we obtain properties of this dynamics on mean field graphs of arbitrary sizes. In the same way that chains can…
A drawback of the classic approach for complexity analysis of distributed graph problems is that it mostly informs about the complexity of notorious classes of ``worst case'' graphs. Algorithms that are used to prove a tight (existential)…