Global eigenvalue fluctuations of random biregular bipartite graphs
نویسندگان
چکیده
We compute the eigenvalue fluctuations of uniformly distributed random biregular bipartite graphs with fixed and growing degrees for a large class analytic functions. As key step in proof, we obtain total variation distance bound Poisson approximation number cycles cyclically non-backtracking walks graphs, which might be independent interest. also prove semicircle law [Formula: see text]-biregular when text]. an application, translate results to adjacency matrices regular hypergraphs.
منابع مشابه
Bulk Eigenvalue Correlation Statistics of Random Biregular Bipartite Graphs
In this paper, we consider the randommatrix ensemble given by (db, dw)-regular graphs onM black vertices andN white vertices, where db ∈ [N γ , N2/3−γ ] for any γ > 0. We simultaneously prove that the bulk eigenvalue correlation statistics for both normalized adjacency matrices and their corresponding covariance matrices are stable for short times. Combined with an ergodicity analysis of the Dy...
متن کاملMatchings in Random Biregular Bipartite Graphs
We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdős and Rényi about perfect matchings in random bipartite graphs. We also present an application to commutative graphs, a class of graphs that are featured in additive number theory.
متن کاملAntimagic Orientation of Biregular Bipartite Graphs
An antimagic labeling of a directed graph D with n vertices and m arcs is a bijection from the set of arcs of D to the integers {1, . . . ,m} such that all n oriented vertex sums are pairwise distinct, where an oriented vertex sum is the sum of labels of all arcs entering that vertex minus the sum of labels of all arcs leaving it. An undirected graph G is said to have an antimagic orientation i...
متن کاملA Note on Path Factors of (3,4)-Biregular Bipartite Graphs
A proper edge coloring of a graph G with colors 1, 2, 3, . . . is called an interval coloring if the colors on the edges incident with any vertex are consecutive. A bipartite graph is (3, 4)-biregular if all vertices in one part have degree 3 and all vertices in the other part have degree 4. Recently it was proved [J. Graph Theory 61 (2009), 88-97] that if such a graph G has a spanning subgraph...
متن کاملOn one-sided interval edge colorings of biregular bipartite graphs
A proper edge t-coloring of a graphG is a coloring of edges of G with colors 1, 2, . . . , t such that all colors are used, and no two adjacent edges receive the same color. The set of colors of edges incident with a vertex x is called a spectrum of x. Any nonempty subset of consecutive integers is called an interval. A proper edge t-coloring of a graph G is interval in the vertex x if the spec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random matrices : theory and applications
سال: 2023
ISSN: ['2010-3263', '2010-3271']
DOI: https://doi.org/10.1142/s2010326323500041