Related papers: A Random Necklace Model
Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…
In this work, which was inspired by the article [2] by M. V. Velasco and A. R. Villena, we obtain a characterization for probably continuous operators and show that the probability of a linear random operator being continuous coincides with…
We consider some random iterated function systems on the interval and show that the invariant measure has density in $\mathcal{C}^\infty$. To prove this we use some techniques for contractions in cone metrics, applied to the transfer…
The structure of the spectrum of random operators is studied. It is shown that if the density of states measure of some subsets of the spectrum is zero, then these subsets are empty. In particular follows that absolute continuity of the IDS…
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…
We study the diffusion of a particle on a random lattice with fluctuating local connectivity of average value q. This model is a basic description of relaxation processes in random media with geometrical defects. We analyze here the…
Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…
We consider Laplacians on periodic metric graphs with unit-length edges. The spectrum of these operators consists of an absolutely continuous part (which is a union of an infinite number of non-degenerated spectral bands) plus an infinite…
We consider a charged spinless quantum particle confined to a graph consisting of a loop to which a halfline lead is attached; this system is placed into a homogeneous magnetic field perpendicular to the loop plane. We derive the reflection…
The transfer operator associated to a flow (continuous time dynamical system) is a one-parameter operator semigroup. We consider the operator-valued Laplace transform of this one-parameter semigroup. Estimates on the Laplace transform have…
We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…
It is known that electrical networks with resistors are related to the Laplace operator and random walk on weighted graphs. In this paper we consider more general electrical networks with coils, capacitors, and resistors. We give two…
We prove Anderson localization for the discrete Laplace operator on radial tree graphs with random branching numbers. Our method relies on the representation of the Laplace operator as the direct sum of half-line Jacobi matrices whose…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We consider disordered Hamiltonians given by the Laplace operator subject to arbitrary random self-adjoint singular perturbations supported on random discrete subsets of the real line. Under minimal assumptions on the type of disorder, we…
We demonstrate the connection between an operator's matrix element distribution and entangling power via numerical simulations of random, pseudo-random, and quantum chaotic operators. Creating operators with a random distribution of matrix…
We study spectra of alloy-type random Schr\"odinger operators on metric graphs. For finite edge subsets of general graphs we prove a Wegner estimate which is linear in the volume (i.e. the number of edges) and the length of the considered…
We apply in this article (non rigorous) statistical mechanics methods to the problem of counting long circuits in graphs. The outcomes of this approach have two complementary flavours. On the algorithmic side, we propose an approximate…
A cluster of $n$ needles ($1\leq n<\infty$) is dropped at random onto a plane lattice of rectangles. Each needle is fixed at one end in the cluster centre and can rotate independently about this centre. The distribution of the relative…
We study the synchronized interval in undirected and unweighted random networks of coupled oscillators as a function of the number of edges. In many coupled oscillator systems, synchronization is stable in a finite interval of coupling…