Related papers: Geometrical and spectral study of $\beta$-skeleton…
We carry out a numerical study of fluctuations in the spectrum of regular graphs. Our experiments indicate that the level spacing distribution of a generic k-regular graph approaches that of the Gaussian Orthogonal Ensemble of random matrix…
The spectral dimension has been widely used to understand transport properties on regular and fractal lattices. Nevertheless, it has been little studied for complex networks such as scale-free and small world networks. Here we study the…
Graph kernels are widely used for measuring the similarity between graphs. Many existing graph kernels, which focus on local patterns within graphs rather than their global properties, suffer from significant structure information loss when…
In this article, we develop a theory for understanding the traces left by a random walk in the vicinity of a randomly chosen reference vertex. The analysis is related to interlacements but goes beyond previous research by showing weak limit…
We study random labelings of graphs conditioned on a small number (typically one or two) peaks, i.e., local maxima. We show that the boundaries of level sets of a random labeling of a square with a single peak have dimension 2, in a…
We study the graph structure of large random dissections of polygons sampled according to Boltzmann weights, which encompasses the case of uniform dissections or uniform $p$-angulations. As their number of vertices $n$ goes to infinity, we…
Gait recognition from video streams is a challenging problem in computer vision biometrics due to the subtle differences between gaits and numerous confounding factors. Recent advancements in self-supervised pretraining have led to the…
In this article, we consider $\beta$-ensembles, i.e. collections of particles with random positions on the real line having joint distribution $$\frac{1}{Z_N(\beta)}|\Delta(\lambda)|^\beta e^{- \frac{N\beta}{4}\sum_{i=1}^N\lambda_i^2}d…
The spectral and localization properties of heterogeneous random graphs are determined by the resolvent distributional equations, which have so far resisted an analytic treatment. We solve analytically the resolvent equations of random…
We study the connectivity properties of random Bluetooth graphs that model certain "ad hoc" wireless networks. The graphs are obtained as "irrigation subgraphs" of the well-known random geometric graph model. There are two parameters that…
For a $\beta$ ensemble on $\Sigma^{(N)}=\{(x_1,\ldots,x_N)\mathbb R^N|x_1\le\cdots\le x_N\}$ with real analytic potential and general $\beta>0$, under the assumption that its equilibrium measure is supported on $q$ intervals where $q>1$, we…
In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…
In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graphs are identical. However, two graphs $ G_A $ and $ G_B $ can…
Recently similarity graphs became the leading paradigm for efficient nearest neighbor search, outperforming traditional tree-based and LSH-based methods. Similarity graphs perform the search via greedy routing: a query traverses the graph…
Consider a random block matrix model consisting of $D$ random systems arranged along a circle, where each system is modeled by an independent $N\times N$ complex Hermitian Wigner matrix. Neighboring systems interact via an arbitrary…
The full spectrum of transfer matrices of the general eight-vertex model on a square lattice is obtained by numerical diagonalization. The eigenvalue spacing distribution and the spectral rigidity are analyzed. In non-integrable regimes we…
Several examples of similarity transformations connecting two string theories with different backgrounds are reviewed. We also discuss general structure behind the similarity transformations from the point of view of the topological…
Structure and dynamics of complex networks usually deal with degree distributions, clustering, shortest path lengths and other graph properties. Although these concepts have been analysed for graphs on abstract spaces, many networks happen…
Given a graph $G=(V,E)$, a $\beta$-ruling set is a subset $S\subseteq V$ that is i) independent, and ii) every node $v\in V$ has a node of $S$ within distance $\beta$. In this paper we present almost optimal distributed algorithms for…
Gamma -ray bursts (GRBs) observed up to redshifts $z>9.4$ can be used as possible probes to test cosmological models. Here we show how changes of the slope of the {\it luminosity $L^*_X$ -break time $T^*_a$} correlation in GRB afterglows,…