Related papers: Derangement Frequency in the Boolean Complex
We study the vibrational properties near a free surface of disordered spring networks derived from jammed sphere packings. In bulk systems, without surfaces, it is well understood that such systems have a plateau in the density of…
This work deals with the average scattering entropy of quantum graphs. We explore this concept in several distinct scenarios that involve periodic, aperiodic and random distribution of vertices of distinct degrees. In particular, we compare…
In order to analyze the effect of chaos or order on the rate of decoherence in a subsystem we aim to distinguish effects of the two types of dynamics from those depending on the choice of the wave packet. To isolate the former we introduce…
The decoherence rate of a quantum dot coupled to a fluctuating environment described by a normal-metal superconductor junction is considered. The density-density correlator at low frequencies constitutes the kernel which enters the…
We study the dependence of the quantum graph Hamiltonian, its resolvent, and its spectrum on the vertex conditions and graph edge lengths. In particular, several results on the interlacing (bracketing) of the spectra of graphs with…
We establish an interesting connection between Morin singularities and stable homotopy groups of spheres. We apply this connection to computations of cobordism groups of certain singular maps. The differentials of the spectral sequence…
We consider random graphs sampled uniformly from a structured class of graphs, such as the class of graphs embeddable in a given surface. We sharpen and extend earlier results on pendant appearances, concerning for example numbers of…
The spectral fluctuations of complex quantum systems, in appropriate limit, are known to be consistent with that obtained from random matrices. However, this relation between the spectral fluctuations of physical systems and random matrices…
We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…
We assume that the energy spectrum of a chaotic system undergoing symmetry breaking transitions can be represented as a superposition of independent level sequences, one increasing on the expense of the others. The relation between the…
We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…
This paper presents bounds for the variation of the spectral radius $\lambda(G)$ of a graph $G$ after some perturbations or local vertex/edge modifications of $G$. The perturbations considered here are the connection of a new vertex with,…
Dielectric relaxation in disordered dielectric mixtures are presented by emphasizing the interfacial polarization. The obtained results coincide with and cause confusion with those of the low frequency dispersion behavior. The considered…
For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along with other associated cell complexes) is found to be homotopy…
The distortion of the regular motion in a quantum system by its coupling to the continuum of decay channels is investigated. The regular motion is described by means of a Poissonian ensemble. We focus on the case of only few channels K<10.…
We investigate the nature of quantum entanglement in long-range orders and spontaneous symmetry breaking. It is shown that diminishing of entanglement between the condensate mode and the rest of the system underlies off-diagonal long-range…
We consider frequency-domain acoustic scattering at a homogeneous star-shaped penetrable obstacle, whose shape is uncertain and modelled via a radial spectral parameterization with random coefficients. Using recent results on the stability…
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…
We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for…
In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph $G$, $\{-1, 1\}$ labels are assigned to the edges, and we consider a family $\mathcal{S}_G$ of (spanning) subgraphs of…