Related papers: A graph-theoretic remark on Stieltjes moment seque…
We use representation theory of $S_n$ to analyze the mixing of permutation cycle type statistics $a_j(\sigma) = ${# of $j$-cycles of $\sigma$} for any fixed $j$ and $\sigma$ resulting from a random $i$-cycle walk on $S_n$. We also derive…
The 1-2-3 Conjecture, introduced by Karo\'nski, {\L}uczak, and Thomason in 2004, was recently solved by Keusch. This implies that, for any connected graph $G$ different from $K_2$, we can turn $G$ into a locally irregular multigraph $M(G)$,…
It has been known that an effective smooth $({\Bbb Z}_2)^k$-action on a smooth connected closed manifold $M^n$ fixing a finite set can be associated to a $({\Bbb Z}_2)^k$-colored regular graph. In this paper, we consider abstract graphs…
Tracking of moving objects is crucial to security systems and networks. Given a graph $G$, terminal vertices $s$ and $t$, and an integer $k$, the \textsc{Tracking Paths} problem asks whether there exists at most $k$ vertices, which if…
In this note, we recall Kummer's Fourier series expansion of the 1-periodic function that coincides with the logarithm of the Gamma function on the unit interval $(0,1)$, and we use it to find closed forms for some numerical series related…
We prove that on the set of lattice paths with steps N=(0,1) and E=(1,0) that lie between two fixed boundaries T and B (which are themselves lattice paths), the statistics `number of E steps shared with B' and `number of E steps shared with…
We introduce the notion of a move graph, that is, a directed graph whose vertex set is a $\mathbb Z$-module $\mathbb Z_n^m$, and whose arc set is uniquely determined by the action $M\!:\!\mathbb Z_n^m\to \mathbb Z_n^m$ where $M$ is an…
A graph $G$ is called an $L_1$-graph if $d(u)+d(v)\ge|N(u)\cup N(v)\cup N(w)|-1$ for every triple of vertices $u,v,w$ where $u$ and $v$ are at distance 2 and $w\in N(u)\cap N(v)$. Asratian et al. (1996) proved that all finite connected…
Two graphs are isomorphic exactly when they admit the same number of homomorphisms from every graph. Hence, a graph is recognized up to isomorphism by homomorphism counts over the class of all graphs. Restricting to a specific graph class…
For a fixed SL(3, Z) Maass form g, we consider the family of L-functions L(g \times u_j, s) where u_j runs over the family of Hecke-Maass cusp forms on SL(2,Z). We obtain an estimate for the second moment of this family of L-functions at…
We consider for two based graphs $G$ and $H$ the sequence of graphs $G_k$ given by the wedge sum of $G$ and $k$ copies of $H$. These graphs have an action of the symmetric group $\Sigma_k$ by permuting the $H$-summands. We show that the…
We define an infinite sequence of generalizations, parametrized by an integer $m \ge 1$, of the Stieltjes--Rogers and Thron--Rogers polynomials; they arise as the power-series expansions of some branched continued fractions, and as the…
We study asymptotic properties of spatially non-homogeneous random walks with non-integrable increments, including transience, almost-sure bounds, and existence and non-existence of moments for first-passage and last-exit times. In our…
For a large class of symmetric random matrices with correlated entries, selected from stationary random fields of centered and square integrable variables, we show that the limiting distribution of eigenvalue counting measure always exists…
In the present paper, as a continuation of our preceding paper [10], we study another kind of central limit theorems (CLTs) for non-symmetric random walks on nilpotent covering graphs from a viewpoint of discrete geometric analysis…
Kronk introduced the $l$-path hamiltonianicity of graphs in 1969. A graph is $l$-path Hamiltonian if every path of length not exceeding $l$ is contained in a Hamiltonian cycle. We have shown that if $P=uvz$ is a 2-path of a 2-connected,…
We verify that the established one- and two-step recurrences for positive definite functions on spheres extend to the spatio-temporal case.
The rotor-router model, also called the Propp machine, was introduced as a deterministic alternative to the random walk. In this model, a group of identical tokens are initially placed at nodes of the graph. Each node maintains a cyclic…
We show central limit theorems (CLT) for the Stieltjes transforms or more general analytic functions of symmetric matrices with independent heavy tailed entries, including entries in the domain of attraction of $\alpha$-stable laws and…
The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…