Related papers: Graph W*-probability Theory
A typical result in graph theory says that a graph $G$, satisfying certain conditions, has some property $\cal P$. Once such a theorem is established, it is natural to ask how strongly $G$ satisfies $\cal P$. Can one strengthen the result…
In this paper we give a formula for the $K$-theory of the $C^*$-algebra of a weakly left-resolving labelled space. This is done by realising the $C^*$-algebra of a weakly left-resolving labelled space as the Cuntz-Pimsner algebra of a…
We introduce a modification of the Tur\'an density of ordered graphs and investigate this graph parameter.
The problem of recovering graph signals is one of the main topics in graph signal processing. A representative approach to this problem is the graph Wiener filter, which utilizes the statistical information of the target signal computed…
For given a graph $H$, a graphic sequence $\pi=(d_1,d_2,...,d_n)$ is said to be potentially $H$-graphic if there exists a realization of $\pi$ containing $H$ as a subgraph. In this paper, we characterize the potentially $H$-graphic…
This survey on graphs of large girth consists of two parts. The first deals with some aspects of algebraic and extremal graph theory loosely related to the Moore bound. Our point of departure for the second, Ramsey theoretic, part are some…
Hypothesis testing for graphs has been an important tool in applied research fields for more than two decades, and still remains a challenging problem as one often needs to draw inference from few replicates of large graphs. Recent studies…
This is a graduate-level introduction to graph theory, corresponding to a quarter-long course. It covers simple graphs, multigraphs as well as their directed analogues, and more restrictive classes such as tournaments, trees and…
Percolation is an important topic in climate, physics, materials science, epidemiology, finance, and so on. Prediction of percolation thresholds with machine learning methods remains challenging. In this paper, we build a powerful graph…
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of…
Probabilistic graphs are an abstraction that allow us to study randomized propagation in graphs. In a probabilistic graph, each edge is "active" with a certain probability, independent of the other edges. For two vertices $u,v$, a classic…
The chapter aims to explore the application of graph theory and networks in the recommendation domain, encompassing the mathematical models that form the foundation for the algorithms and recommendation systems developed based on them. The…
In this paper, we introduce a generalized concept of vertex transitivity in graphs called generalized vertex transitivity. We put forward a new invariant called transitivity number of a graph. The value of this invariant in different…
We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.
Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which…
For graphs $G$ and $H$, what relations can be determined between $t(G,W)$ and $t(H,W)$ for a general graph $W$? We study this problem through the framework of the density domination exponent, which is defined to be the smallest constant $c$…
Final version, to appear in Mathematical Research Letters.
We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The…
The famous Gallai's Conjecture states that any connected graph with n vertices has a path decomposition containing at most (n+1)/2 paths. In this note, we explore graphs generated from removing edges from complete graphs. We first provide…
In the last decade it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks: separable elements, with connections (or interactions) between certain pairs of them.…