相关论文: Random eigenvalues of graphenes and the triangulat…
Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…
A density-functional approach on the hexagonal graphene lattice is developed using an exact numerical solution to the Hubbard model as the reference system. Both nearest-neighbour and up to third nearest-neighbour hoppings are considered…
Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…
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…
A 1d random geometric graph (1d RGG) is built by joining a random sample of $n$ points from an interval of the real line with probability $p$. We count the number of $k$-hop paths between two vertices of the graph in the case where the…
In this report, the explicit probability density functions of the random Euclidean distances associated with regular hexagons are given, when the two endpoints of a link are randomly distributed in the same hexagon, and two adjacent…
This paper studies the eigenvalue distribution of the Watts-Strogatz random graph, which is known as the "small-world" random graph. The construction of the small-world random graph starts with a regular ring lattice of n vertices; each has…
In this report, the explicit probability density functions of the random Euclidean distances associated with equilateral triangles are given, when the two endpoints of a link are randomly distributed in 1) the same triangle, 2) two adjacent…
We study the interplay between proximity-induced superconductivity and ferromagnetism in graphene by self-consistently solving the Bogoliubov-de Gennes equations on the honeycomb lattice. We find that a strong triplet proximity effect is…
We compute the dynamical polarization function for a graphene antidot lattice in the random-phase approximation. The computed polarization functions display a much more complicated structure than what is found for pristine graphene (even…
Given a symmetric $n\times n$ matrix $P$ with $0 \le P(u, v)\le 1$, we define a random graph $G_{n, P}$ on $[n]$ by independently including any edge $\{u, v\}$ with probability $P(u, v)$. For $k\ge 1$ let $\mathcal{A}_k$ be the property of…
We give a simple formula for the looping rate of loop-erased random walk on a finite planar graph. The looping rate is closely related to the expected amount of sand in a recurrent sandpile on the graph. The looping rate formula is…
We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…
The paper concerns lattice triangulations, that is, triangulations of the integer points in a polygon in $\mathbb{R}^2$ whose vertices are also integer points. Lattice triangulations have been studied extensively both as geometric objects…
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…
In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…
We examine the empirical distribution of the eigenvalues and the eigenvectors of adjacency matrices of sparse regular random graphs. We find that when the degree sequence of the graph slowly increases to infinity with the number of…
Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq 3$, and denote the eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We prove that the…
The distributions of the random distances associated with hexagons, rhombuses and triangles have been derived and verified in the existing work. All of these geometric shapes are related to each other and have various applications in…
Consider the triangle $T$ with vertices $(0,0)$, $(0,1)$, and $(1,0)$. The lower boundary of the convex hull of $(0,1)$, $(1,0)$, together with $n$ independent uniformly distributed random points in $T$, is called a random convex chain and…