Related papers: Spectral and localization properties of random bip…
We investigate adjacency matrices of bipartite graphs with power-law degree distribution. Motivation for this study is twofold. First, vibrational states in granular matter and jammed sphere packings; second, graphs encoding social…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
The purpose of this article is to introduce a new iterative algorithm with properties resembling real life bipartite graphs. The algorithm enables us to generate wide range of random bigraphs, which features are determined by a set of…
The bipartite graph is a ubiquitous data structure that can model the relationship between two entity types: for instance, users and items, queries and webpages. In this paper, we study the problem of ranking vertices of a bipartite graph,…
In this paper, we study a bipartite analogue of the `random graphs evolving by degrees' process. We are given a bipartitioned set of vertices $V$ into two disjoint parts ${L}$ and ${R}$ and possibly unequal positive constants $\alpha$ and…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
Let $G$ be a simple graph with order $n$ and adjacency matrix $\mathbf{A}(G)$. Let $\phi(G; \lambda)=\det(\lambda I-\mathbf{A}(G))=\sum_{i=0}^n\mathbf{a}_i(G)\lambda^{n-i}$ be the characteristic polynomial of $G$, where $\mathbf{a}_i(G)$ is…
Inspired by a concept in comparative genomics, we investigate properties of randomly chosen members of G_1(m,n,t), the set of bipartite graphs with $m$ left vertices, n right vertices, t edges, and each vertex of degree at least one. We…
This paper presents the applications of Eigenvalues and Eigenvectors (as part of spectral decomposition) to analyze the bipartivity index of graphs as well as to predict the set of vertices that will constitute the two partitions of graphs…
Bipartite graph embedding has recently attracted much attention due to the fact that bipartite graphs are widely used in various application domains. Most previous methods, which adopt random walk-based or reconstruction-based objectives,…
Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implications in diverse fields ranging from matching problems to the…
We introduce a quantitative measure of network bipartivity as a proportion of even to total number of closed walks in the network. Spectral graph theory is used to quantify how close to bipartite a network is and the extent to which…
We study the equivalence between bipartiteness and symmetry of spectra of mixed graphs, for $\theta$-Hermitian adjacency matrices defined by an angle $\theta \in (0, \pi]$. We show that this equivalence holds when, for example, an angle…
Regular and distance-regular characterizations of general graphs are well-known. In particular, the spectral excess theorem states that a connected graph G is distance-regular if and only if its spectral excess (a number that can be…
We perform an extensive numerical analysis of $\beta$-skeleton graphs, a particular type of proximity graphs. In a $\beta$-skeleton graph (BSG) two vertices are connected if a proximity rule, that depends of the parameter…
We investigate the spectrum of the non-backtracking matrix of a graph. In particular, we show how to obtain eigenvectors of the non-backtracking matrix in terms of eigenvectors of a smaller matrix. Furthermore, we find an expression for the…
An $(a,b)$-biregular bipartite graph is a bipartite graph with bipartition $(X, Y)$ such that each vertex in $X$ has degree $a$ and each vertex in $Y$ has degree $b$. By the bipartite expander mixing lemma, biregular bipartite graphs have…
We consider a random geometric hypergraph model based on an underlying bipartite graph. Nodes and hyperedges are sampled uniformly in a domain, and a node is assigned to those hyperedges that lie with a certain radius. From a modelling…
We prove spectral localization for infinite metric graphs with a self-adjoint Laplace operator and a random potential. To do so we adapt the multiscale analysis (MSA) from the R^d-case to metric graphs. In the MSA a covering of the graph is…
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have been made to provide accurate models. We study here a model…