Related papers: Localized and delocalized modes on random geometri…
Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…
In this paper, we study the connectivity of a one-dimensional soft random geometric graph (RGG). The graph is generated by placing points at random on a bounded line segment and connecting pairs of points with a probability that depends on…
The dynamics of two-dimensional fluids confined within a random matrix of obstacles is investigated using both colloidal model experiments and molecular dynamics simulations. By varying fluid and matrix area fractions in the experiment, we…
We study a one-dimensional model of disordered electrons (also relevant for random spin chains), which exhibits a delocalisation transition at half-filling. Exact probability distribution functions for the Wigner time and transmission…
We show that, with very high probability, the random graph Laplacian has simple spectrum. Our method provides a quantitatively effective estimate of the spectral gaps. Along the way, we establish results on affine no-gaps delocalization,…
We find large deviation principles for the degree distribution and the proportion of isolated vertices for the near intermediate random geometric graph models on n vertices placed uniformly in [0, 1]^d, for d in N. In the course of the…
In this article, we study random graphs with a given degree sequence $d_1, d_2, \cdots, d_n$ from the configuration model. We show that under mild assumptions of the degree sequence, the spectral distribution of the normalized Laplacian…
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…
We provide a complete thermodynamic solution of a 1D hopping model in the presence of a random potential by obtaining the density of states. Since the partition function is related to the density of states by a Laplace transform, the…
We consider highly heterogeneous random networks with symmetric interactions in the limit of high connectivity. A key feature of this system is that the spectral density of the corresponding ensemble exhibits a divergence within the bulk.…
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…
For a sequence p=(p(1),p(2), ...) let G(n,p) denote the random graph with vertex set {1,2, ...,n} in which two vertices i, j are adjacent with probability p(|i-j|), independently for each pair. We study how the convergence of probabilities…
The one dimensional dimer model is investigated and the localization length calculated exactly. The presence of delocalized states at $E_c = \epsilon_{a,b}$ of two possible values of the chemical potential in case of…
We consider d-dimensional random surface models which for d=1 are the standard (tied-down) random walks (considered as a random ``string''). In higher dimensions, the one-dimensional (discrete) time parameter of the random walk is replaced…
In this paper, we study rare events in spherical and Gaussian random geometric graphs in high dimensions. In these models, the vertices correspond to points sampled uniformly at random on the $d$ dimensional unit sphere or correspond to $d$…
The spectral properties of the adjacency matrix, in particular its largest eigenvalue and the associated principal eigenvector, dominate many structural and dynamical properties of complex networks. Here we focus on the localization…
Domain specific localization of eigenstates has been a persistent observation for systems with local symmetries. The underlying mechanism for this localization behaviour has however remained elusive. We provide here an analysis of locally…
We introduce a modified version of the disordered Klein-Gordon lattice model, having two parameters for controlling the disorder strength: $D$, which determines the range of the coefficients of the on-site potentials, and $W$, which defines…