Geometrical and spectral study of beta-skeleton graphs

We perform an extensive numerical analysis of beta-skeleton graphs, a particular type of proximity graphs. In beta-skeleton graph (BSG) two vertices are connected if a proximity rule, that depends of the parameter beta is an element of (0, infinity), is satisfied. Moreover, for beta > 1 there exist two different proximity rules, leading to lune-based and circle-based BSGs. First, by computing the average degree of large ensembles of BSGs we detect differences, which increase with the increase of beta, between lune-based and circle-based BSGs. Then, within a random matrix theory (RMT) approach, we explore spectral and eigenvector properties of random BSGs by the use of the nearest-neighbor energy-level spacing distribution and the entropic eigenvector localization length, respectively. The RMT analysis allows us to conclude that a localization transition occurs at beta = 1

Dynamical properties of a dissipative discontinuous map: A scaling investigation

The effects of dissipation on the scaling properties of nonlinear discontinuous maps are investigated by analyzing the behavior of the average squared action \left as a function of the $n$-th iteration of the map as well as the parameters $K$ and $\gamma$, controlling nonlinearity and dissipation, respectively. We concentrate our efforts to study the case where the nonlinearity is large; i.e., $K\gg 1$. In this regime and for large initial action $I_0\gg K$, we prove that dissipation produces an exponential decay for the average action \left. Also, for $I_0\cong 0$, we describe the behavior of \left using a scaling function and analytically obtain critical exponents which are used to overlap different curves of \left onto an universal plot. We complete our study with the analysis of the scaling properties of the deviation around the average action $\omega$.Comment: 20 pages, 7 figure

Weighted random--geometric and random--rectangular graphs: Spectral and eigenfunction properties of the adjacency matrix

Within a random-matrix-theory approach, we use the nearest-neighbor energy level spacing distribution $P(s)$ and the entropic eigenfunction localization length $\ell$ to study spectral and eigenfunction properties (of adjacency matrices) of weighted random--geometric and random--rectangular graphs. A random--geometric graph (RGG) considers a set of vertices uniformly and independently distributed on the unit square, while for a random--rectangular graph (RRG) the embedding geometry is a rectangle. The RRG model depends on three parameters: The rectangle side lengths $a$ and $1/a$, the connection radius $r$, and the number of vertices $N$. We then study in detail the case $a=1$ which corresponds to weighted RGGs and explore weighted RRGs characterized by $a\sim 1$, i.e.~two-dimensional geometries, but also approach the limit of quasi-one-dimensional wires when $a\gg1$. In general we look for the scaling properties of $P(s)$ and $\ell$ as a function of $a$, $r$ and $N$. We find that the ratio $r/N^\gamma$, with $\gamma(a)\approx -1/2$, fixes the properties of both RGGs and RRGs. Moreover, when $a\ge 10$ we show that spectral and eigenfunction properties of weighted RRGs are universal for the fixed ratio $r/{\cal C}N^\gamma$, with ${\cal C}\approx a$.Comment: 8 pages, 6 figure