Related papers: Sandpile groups and the coeulerian property for ra…
We prove the existence of a limiting distribution for the appropriately rescaled diameters of random undirected Cayley graphs of finite nilpotent groups of bounded rank and nilpotency class, thus extending a result of Shapira and Zuck which…
Given a group $G$, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of $G$ where each element of $G$ is included in the generating set independently at random with probability $p$. In this article, we…
We introduce the notion of a bivariate random discrete copula on an equidistant mesh and explore its stochastic properties. A random discrete copula is a discrete random field, hence, its value at a given point on the mesh is a random…
The sandpile group of a connected graph $G$, defined to be the torsion part of the cokernel of the graph Laplacian, is a subtle graph invariant with combinatorial, algebraic, and geometric descriptions. Extending and improving previous…
We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associated to a directed graph, whose order is the number of oriented…
This paper develops methods to study the distribution of Eulerian statistics defined by second-order recurrence relations. We define a random process to decompose the statistics over compositions of integers. It is shown that the numbers of…
For undirected graphs, the Ricci curvature introduced by Lin-Lu-Yau has been widely studied from various perspectives, especially geometric analysis. In the present paper, we discuss generalization problem of their Ricci curvature for…
Numerical estimates are given for the spectral radius of simple random walks on Cayley graphs. Emphasis is on the case of the fundamental group of a closed surface, for the usual system of generators.
We compute the cone types of the Cayley graph of the modular group $\mathrm{PSL}(2,\mathbf{Z})$ associated with the standard system of generators ${\small\left\{\left(\begin{smallmatrix} 0 & -1 \\ 1 & 0…
We consider random Cayley digraphs of order $n$ with uniformly distributed generating set of size $k$. Specifically, we are interested in the asymptotics of the probability such a Cayley digraph has diameter two as $n\to\infty$ and…
We report about the results of the application of modern computer algebra tools for construction of directed strongly regular graphs. The suggested techniques are based on the investigation of non-commutative association schemes and Cayley…
We consider the class of simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). For this class of graphs we determine the asymptotic behavior of the number of Eulerian orientations. In…
A strongly regular graph is called trivial if it or its complement is a union of disjoint cliques. We prove that every infinite family of nontrivial strongly regular graphs is quasi-random in the sense of Chung, Graham and Wilson.
Let d = (d1, d2, ..., dn) be a vector of non-negative integers with even sum. We prove some basic facts about the structure of a random graph with degree sequence d, including the probability of a given subgraph or induced subgraph.…
We study the behaviour of random labelled and unlabelled cographs with n vertices as n tends to infinity. Our main result is a novel probabilistic limit in the space of graphons.
We study random graph models for directed acyclic graphs, an important class of networks that includes citation networks, food webs, and feed-forward neural networks among others. We propose two specific models, roughly analogous to the…
Diagonalizability plays an important role in the analysis and design of multivariable systems. A structured matrix is called structurally diagonalizable if almost all of its numerical realizations, obtained by assigning real values to its…
We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decomposition of a directed graph $D$ in terms of its degree…
In this paper we relate a fundamental parameter of a random graph, its degree sequence, to a simple model of nearly independent binomial random variables. This confirms a conjecture made in 1997. As a result, many interesting functions of…
In this paper we show that almost all Cayley digraphs have automorphism group as small as possible; that is, they are digraphical regular representations (DRRs). More precisely, we show that as $r$ tends to infinity, for every finite group…