相关论文: A graph-theoretic remark on Stieltjes moment seque…

Let $H$ and $G$ be graphs such that $H$ has at least 3 vertices and is connected. The $H$-line graph of $G$, denoted by $HL(G)$, is that graph whose vertices are the edges of $G$ and where two vertices of $HL(G)$ are adjacent if they are…

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

We study recurrence properties and the validity of the (weak) law of large numbers for (discrete time) processes which, in the simplest case, are obtained from simple symmetric random walk on $\Z$ by modifying the distribution of a step…

In this survey article, we give an introduction to two methods of proof in random matrix theory: The method of moments and the Stieltjes transform method. We thoroughly develop these methods and apply them to show both the semicircle law…

Consider an $N\times n$ random matrix $Y_n=(Y^n_{ij})$ where the entries are given by $Y^n_{ij}=\frac{\sigma_{ij}(n)}{\sqrt{n}}X^n_{ij}$, the $X^n_{ij}$ being independent and identically distributed, centered with unit variance and…

In this paper we work over $\Gamma_0(N)$, for any $N$ and write the spectral moment of a product of two distinct Rankin-Selberg convolutions at a general point on the critical line $\frac{1}{2}+it$ as a main term plus a sharp error term in…

We introduce the notion of {\bf a}-walk $S(n)=a_1 X_1+\dots+a_n X_n$, based on a sequence of positive numbers ${\bf a}=(a_1,a_2,\dots)$ and a Rademacher sequence $X_1,X_2,\dots$. We study recurrence/transience (properly defined) of such…

For each $n,r \geq 0$, let $KG(n,r)$ denote the Kneser Graph; that whose vertices are labeled by $r$-element subsets of $n$, and whose edges indicate that the corresponding subsets are disjoint. Fixing $r$ and allowing $n$ to vary, one…

We study the spectral properties of a class of random matrices of the form $S_n^{-} = n^{-1}(X_1 X_2^* - X_2 X_1^*)$ where $X_k = \Sigma_k^{1/2}Z_k$, $Z_k$'s are independent $p\times n$ complex-valued random matrices, and $\Sigma_k$ are…

We study the asymptotic behaviour of Markov chains $(X_n,\eta_n)$ on $\mathbb{Z}_+ \times S$, where $\mathbb{Z}_+$ is the non-negative integers and $S$ is a finite set. Neither coordinate is assumed to be Markov. We assume a moments bound…

Let $n$ be a positive integer. For each $0\leq j \leq n-1$ we let $C_n^{j}$ denote Cayley graph for the cyclic group ${\mathbb Z}_n $ with respect to the subset $\{1, j\}$. For any such pair $(n,j)$ we compute the size of the Grothendieck…

We consider the random continued fraction S(t) := 1/(s_1 + t/(s_2 + t/(s_3 + >...))) where the s_n are independent random variables with the same gamma distribution. For every realisation of the sequence, S(t) defines a Stieltjes function.…

An L- sequence of a graph $G $ is a sequence of distinct vertices $S = \{v_1, ... , v_k\}$ such that $N[v_i] \setminus \cup_{j=1}^{i-1} N(v_j) \neq \emptyset$. The length of the longest L-sequence is called the L-Grundy domination number,…

Let $\mathscr{L}_{n,t}$ be the set of all $n$-vertex connected graphs with clique number $t$\,($2\leq t\leq n)$. For $n$-vertex connected graphs with given clique number, lexicographic ordering by spectral moments ($S$-order) is discussed…

Spectral characterization of graphs is an important topic in spectral graph theory, which has received a lot of attention from researchers in recent years. It is generally very hard to show a given graph to be determined by its spectrum.…

We revisit the problem of estimates of moments of random n-dimensional matrices of Wigner ensemble by using the approach elaborated by Ya. Sinai and A. Soshnikov and further developed by A. Ruzmaikina. Our main subject is given by the…

In the Stanley lattice defined on Dyck paths of size $n$, cover relations are obtained by replacing a valley $DU$ by a peak $UD$. We investigate a greedy version of this lattice, first introduced by Chenevi\`ere, where cover relations…

A directed graph (digraph) $ D $ is $ k $-linked if $ |D| \geq 2k $, and for any $ 2k $ distinct vertices $ x_1, \ldots, x_k, y_1, \ldots, y_k $ of $ D $, there exist vertex-disjoint paths $ P_1, \ldots, P_k $ such that $ P_i $ is a path…

Using the Dirichlet theorem on the equidistribution of residue classes modulo $q$ and the Lemke Oliver-Soundararajan conjecture on the distribution of pairs of residues on consecutive primes, we show that the domain of convergence of the…

Let $G$ be a connected linear algebraic group over a number field $K$, let $\Gamma$ be a finitely generated Zariski dense subgroup of $G(K)$ and let $Z\subseteq G(K)$ be a thin set, in the sense of Serre. We prove that, if…