Related papers: Local Extrema in Quantum Chaos
In this paper, we propose a multilayer inhomogeneous random graph model (MIRG), whose layers may consist of both single-edge and multi-edge graphs. In the single layer case, it has been shown that the regular variation of the weight…
We investigate the distribution of eigenvalues of weighted adjacency matrices from a specific ensemble of random graphs. We distribute $N$ vertices across a fixed number $\kappa$ of components, with asymptotically $\alpha_j \dot N$ vertices…
We study the problem of estimating the number of edges in an unknown graph. We consider a hybrid model in which an algorithm may issue independent set, degree, and neighbor queries. We show that this model admits strictly more efficient…
Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is omega(ln n). We prove that the adjacency matrix and the Laplacian of that…
We report our experiments in identifying large bipartite subgraphs of simple connected graphs which are based on the sign pattern of eigenvectors belonging to the extremal eigenvalues of different graph matrices: adjacency, signless…
In this paper we provide a connection between the geometrical properties of a chaotic dynamical system and the distribution of extreme values. We show that the extremes of so-called physical observables are distributed according to the…
We present a possible extension of the random-matrix theory, which is widely used to describe spectral fluctuations of chaotic systems. By considering the Kaniadakis non-Gaussian statistics, characterized by the index {\kappa}…
We address the Laplacian on a perturbed periodic graph which might not be a periodic graph. We present a class of perturbed graphs for which the essential spectra of the Laplacians are stable even when the graphs are perturbed by adding and…
We show that the limiting minimal eigenvalue distributions for a natural generalization of Gaussian sample-covariance structures (the "beta ensembles") are described by the spectrum of a random diffusion generator. By a Riccati…
We extend the latent position random graph model to the line graph of a random graph, which is formed by creating a vertex for each edge in the original random graph, and connecting each pair of edges incident to a common vertex in the…
In an attempt to characterize the structure of eigenvectors of random regular graphs, we investigate the correlations between the components of the eigenvectors associated to different vertices. In addition, we provide numerical…
We investigate the spatial statistics of the energy eigenfunctions on large quantum graphs. It has previously been conjectured that these should be described by a Gaussian Random Wave Model, by analogy with quantum chaotic systems, for…
This paper investigates the quadratic irrationals that arise as periodic points of the Gauss type shift associated to the odd continued fraction expansion. It is shown that these numbers, which we call O-reduced, when ordered by the length…
We study the spatial Gibbs random graphs introduced in [MV16] from the point of view of local convergence. These are random graphs embedded in an ambient space consisting of a line segment, defined through a probability measure that favors…
Recent developments in extreme value statistics have established the so-called geometric approach as a powerful modelling tool for multivariate extremes. We tailor these methods to the case of spatial modelling and examine their efficacy at…
We investigate different mean-field-like approximations for stochastic dynamics on graphs, within the framework of a cluster-variational approach. In analogy with its equilibrium counterpart, this approach allows one to give a unified view…
We introduce a complex-plane generalization of the consecutive level-spacing distribution, used to distinguish regular from chaotic quantum spectra. Our approach features the distribution of complex-valued ratios between nearest- and…
We formulate and study an elliptic transmission-like problem combining local and nonlocal elements. Let $\mathbb{R}^{n}$ be separated into two components by a smooth hypersurface $\Gamma$. On one side of $\Gamma$, a function satisfies a…
We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…
Gamma distributions, which contain the exponential as a special case, have a distinguished place in the representation of near-Poisson randomness for statistical processes; typically, they represent distributions of spacings between events…