Related papers: Ramanujan Graphs and Interlacing Families
Many real-world complex networks actually have a bipartite nature: their nodes may be separated into two classes, the links being between nodes of different classes only. Despite this, and despite the fact that many ad-hoc tools have been…
Machine learning on graphs, especially using graph neural networks (GNNs), has seen a surge in interest due to the wide availability of graph data across a broad spectrum of disciplines, from life to social and engineering sciences. Despite…
Graphs are widely used in various fields of computer science. They have also found application in unrelated areas, leading to a diverse range of problems. These problems can be modeled as relationships between entities in various contexts,…
Many real-world complex networks are best modeled as bipartite (or 2-mode) graphs, where nodes are divided into two sets with links connecting one side to the other. However, there is currently a lack of methods to analyze properly such…
We prove that there is a correspondence between Ramanujan-type formulas for 1/\pi, and formulas for Dirichlet L-values. The same method also allows us to resolve certain values of the Epstein zeta function in terms of rapidly converging…
Graphs have a superior ability to represent relational data, like chemical compounds, proteins, and social networks. Hence, graph-level learning, which takes a set of graphs as input, has been applied to many tasks including comparison,…
In this paper, we determine the bound of the valency of the odd circulant graph which guarantees to be a Ramanujan graph for each fixed number of vertices. In almost of the cases, the bound coincides with the trivial bound, which comes from…
Graphs are an essential data structure utilized to represent relationships in real-world scenarios. Prior research has established that Graph Neural Networks (GNNs) deliver impressive outcomes in graph-centric tasks, such as link prediction…
In this paper we give a technique to represent simple connected graphs by using Clockwise Circular Representations and we show its applications by calculating orthogonal representations of simple connected graphs which are essentials in…
In this paper we generalize single-relation pseudo-Riemannian graph embedding models to multi-relational networks, and show that the typical approach of encoding relations as manifold transformations translates from the Riemannian to the…
The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…
Graphs, and graph transformation systems, are used in many areas within Computer Science: to represent data structures and algorithms, to define computation models, as a general modelling tool to study complex systems, etc. Research in term…
Complex networks have acquired a great popularity in recent years, since the graph representation of many natural, social and technological systems is often very helpful to characterize and model their phenomenology. Additionally, the…
Expander graphs have been, during the last five decades, the subject of a most fruitful interaction between pure mathematics and computer science, with influence and applications going both ways (cf. [Lub94], [HLW06], [Lub12] and the…
Let $\mathcal{A}\subseteq{[n]\choose a}$ and $\mathcal{B}\subseteq{[n]\choose b}$ be two families of subsets of $[n]$, we say $\mathcal{A}$ and $\mathcal{B}$ are cross-intersecting if $A\cap B\neq \emptyset$ for all $A\in\mathcal{A}$,…
We study degree spectra of structures with respect to the bi-embeddability relation. The bi-embeddability spectrum of a structure is the family of Turing degrees of its bi-embeddable copies. To facilitate our study we introduce the notions…
A bipartite graph is called bipancyclic if it contains cycles of every even length from four up to the number of vertices in the graph. A theorem of Schmeichel and Mitchem states that for $n \geq 4$, every balanced bipartite graph on $2n$…
This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have…
In this article, we consider systems of linear congruences in several variables and obtain necessary and sufficient conditions as well as explicit expressions for the number of solutions subject to certain restriction conditions. These…
We revisit several entries from Ramanujan's notebooks which follow from more elementary arguments than a first glance may suggest. Our goal is to demystify these results through more accessible proofs, while also shining some light on the…