Related papers: A Random Necklace Model
Despite all the analogies with "usual random" models, tight binding operators for quasicrystals exhibit a feature which clearly distinguishes them from the former: the integrated density of states may be discontinuous. This phenomenon is…
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…
We consider Laplace operators on periodic discrete graphs perturbed by guides, i.e., graphs which are periodic in some directions and finite in other ones. The spectrum of the Laplacian on the unperturbed graph is a union of a finite number…
In the last twenty years network science has proven its strength in modelling many real-world interacting systems as generic agents, the nodes, connected by pairwise edges. Yet, in many relevant cases, interactions are not pairwise but…
Given a sequence of real numbers, we consider its subsequences converging to possibly different limits and associate to each of them an index of convergence which depends on the density of the associated subsequences. This index turns out…
We establish several properties of the integrated density of states for random quantum graphs: Under appropriate ergodicity and amenability assumptions, the integrated density of states can be defined using an exhaustion procedure by…
In this work we introduce a concept of complexity for undirected graphs in terms of the spectral analysis of the Laplacian operator defined by the incidence matrix of the graph. Precisely, we compute the norm of the vector of eigenvalues of…
Formal Laplace operators are analyzed for a large class of resistance networks with vertex weights. The graphs are completed with respect to the minimal resistance path metric. Compactness and a novel connectivity hypothesis for the…
We analyse the density of states of the random graph Laplacian in the percolating regime. A symmetry argument and knowledge of the density of states in the nonpercolating regime allows us to isolate the density of states of the percolating…
Networks observed in the real world often have many short loops. This violates the tree-like assumption that underpins the majority of random graph models and most of the methods used for their analysis. In this paper we sketch possible…
We study the spectrum of random operators on a large class of trees. These trees have finitely many cone types and they can be constructed by a substitution rule. The random operators are perturbations of Laplace type operators either by…
Consider $n$ points independently sampled from a density $p$ of class $\mathcal{C}^2$ on a smooth compact $d$-dimensional sub-manifold $\mathcal{M}$ of $\mathbb{R}^m$, and consider the generator of a random walk visiting these points…
We perform an extensive investigation of the localization properties of the eigenmodes of the Laplace and adjacency matrix for one-dimensional random geometric graphs. We evaluate the density of states, the probability distribution of the…
We study fundamental spectral properties of random block operators that are common in the physical modelling of mesoscopic disordered systems such as dirty superconductors. Our results include ergodic properties, the location of the…
The spectral properties of the Laplacian on a class of quantum graphs with random metric structure are studied. Namely, we consider quantum graphs spanned by the simple $\ZZ^d$-lattice with $\delta$-type boundary conditions at the vertices,…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
Each connected component of a mapping $\{1,2,...,n\}\rightarrow\{1,2,...,n\}$ contains a unique cycle. The largest such component can be studied probabilistically via either a delay differential equation or an inverse Laplace transform. The…
We give a simple formula for the looping rate of loop-erased random walk on a finite planar graph. The looping rate is closely related to the expected amount of sand in a recurrent sandpile on the graph. The looping rate formula is…
Latent-position random graph models usually treat the node set as fixed once the sample size is chosen, while graphon-based and random-measure constructions allow more randomness at the cost of weaker geometric interpretability. We…
We consider N initially disentangled spins, embedded in a ring or d-dimensional lattice of arbitrary geometry, which interact via some long--range Ising--type interaction. We investigate relations between entanglement properties of the…