相关论文: Cokernels of adjacency matrices of random $r$-regu…

We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models…

Various important and useful quantities or measures that characterize the topological network structure are usually investigated for a network, then they are averaged over the samples. In this paper, we propose an explicit representation by…

Random correlation matrices are studied for both theoretical interestingness and importance for applications. The author of [6] is interested in their interpretation as covariance matrices of purely random signals, the authors of [16]…

We report on experimental studies of the distribution of the off-diagonal elements of the scattering matrix of open microwave networks with symplectic symmetry and a chaotic wave dynamics. These consist of two geometrically identical…

This Master's thesis examines the properties of large degree vertices in random recursive directed acyclic graphs (RRDAGs), a generalization of the well-studied random recursive tree (RRT) model. Using a novel adaptation of Kingman's…

Recently, Bollob\'as, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with $\Theta(n)$ edges. Roughly speaking, there is one model for each {\em kernel}, i.e., each symmetric…

Given a graph $\Gamma$, its auxiliary \emph{square-graph} $\square(\Gamma)$ is the graph whose vertices are the non-edges of $\Gamma$ and whose edges are the pairs of non-edges which induce a square (i.e., a $4$-cycle) in $\Gamma$. We…

For a simple finite graph G denote by {G \brace k} the number of ways of partitioning the vertex set of G into k non-empty independent sets (that is, into classes that span no edges of G). If E_n is the graph on n vertices with no edges…

In this note we study the distribution of the subrings of $\mathbb Z[t]/(t^4)$ and prove two results. The first result gives an asymptotic formula for the number of subrings of $\mathbb Z[t]/(t^4)$ of bounded index. The method of proof of…

We prove concentration inequalities for several models of non-linear random matrices. As corollaries we obtain estimates for linear spectral statistics of the conjugate kernel of neural networks and non-commutative polynomials in (possibly…

We use the steepest descents method to study the integral kernel of a family of normal random matrix ensembles with eigenvalue distribution P_{N}(z_{1},...,z_{N}) = Z_{N}^{-1} e^{-N\Sigma_{i=1}^{N}V_{\alpha}(z_{i})}…

Mirror graphs were introduced by Bre\v{s}ar et al. in 2004 as an intriguing class of graphs: vertex-transitive, isometrically embeddable into hypercubes, having a strong connection with regular maps and polytope structure. In this article…

We derive the asymptotic distribution of ordinal-pattern frequencies under weak dependence conditions and investigate the long-run covariance matrix not only analytically for moving-average, Gaussian, and the novel generalized coin-tossing…

Pedigree polytopes are extensions of the classical Symmetric Traveling Salesman Problem polytopes whose graphs (1-skeletons) contain the TSP polytope graphs as spanning subgraphs. While deciding adjacency of vertices in TSP polytopes is…

We study the spectra of mixed graphs about its Hermitian adjacency matrix of the second kind (i.e. N-matrix) introduced by Mohar [1]. We extend some results and define one new Hermitian adjacency matrix, and the entry corresponding to an…

We are concerned with sequences of graphs having a grid geometry, with a uniform local structure in a bounded domain $\Omega\subset {\mathbb R}^d$, $d\ge 1$. We assume $\Omega$ to be Lebesgue measurable with regular boundary and contained,…

We investigate the asymptotic distributions of coordinates of regression M-estimates in the moderate $p/n$ regime, where the number of covariates $p$ grows proportionally with the sample size $n$. Under appropriate regularity conditions, we…

We derive the distribution of the maximum number of common neighbours of a pair of vertices in a dense random regular graph.The proof involves two important steps. One step is to establish the extremal independence property: the asymptotic…

It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…

Recent work on the structure of social networks and the internet has focussed attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in…