Related papers: Sandpile groups and the coeulerian property for ra…

Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability…

We study of the directional distribution function of nodal lines for eigenfunctions of the Laplacian on a planar domain. This quantity counts the number of points where the normal to the nodal line points in a given direction. We give upper…

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…

We express the discrete Ricci curvature of a graph as the minimal eigenvalue of a family of matrices, one for each vertex of a graph whose entries depend on the local adjaciency structure of the graph. Using this method we compute or bound…

Motivated by a problem arising from pharmaceutical science [B. Baeumer et al., Discr. Contin. Dyn. Sys. B 12], we study random walks on the contact graph of a bidisperse random sphere packing. For a random walk on the unweighted graph that…

Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a $d$-dimensional…

We study topological properties of random closed curves on an orientable surface $S$ of negative Euler characteristic. Letting $\gamma_{n}$ denote the conjugacy class of the $n^{th}$ step of a simple random walk on the Cayley graph driven…

Structure learning methods for covariance and concentration graphs are often validated on synthetic models, usually obtained by randomly generating: (i) an undirected graph, and (ii) a compatible symmetric positive definite (SPD) matrix. In…

Let $G = \mathrm{SCl}_n(q)$ be a quasisimple classical group with $n$ large, and let $x_1, \dots, x_k \in G$ random, where $k \geq q^C$. We show that the diameter of the resulting Cayley graph is bounded by $q^2 n^{O(1)}$ with probability…

A random walk on a directed graph gives a Markov chain on the vertices of the graph. An important question that arises often in the context of Markov chain is whether the uniform distribution on the vertices of the graph is a stationary…

Let d_i(G) be the density of the 3-vertex i-edge graph in a graph G, i.e., the probability that three random vertices induce a subgraph with i edges. Let S be the set of all quadruples (d_0,d_1,d_2,d_3) that are arbitrary close to 3-vertex…

In 1980, Ajtai, Komlos and Szemer{\'e}di defined "groupie": Let $G=(V,E)$ be a simple graph, $|V|=n$, $|E|=e$. For a vertex $v\in V$, let $r(v)$ denote the sum of the degrees of the vertices adjacent to $v$. We say $v\in V$ is a {\it…

This paper develops a general inferential framework for discrete copulas on finite supports in any dimension. The copula of a multivariate discrete distribution is defined as Csiszar's I-projection (i.e., the minimum-Kullback-Leibler…

We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…

In this paper we study random induced subgraphs of Cayley graphs of the symmetric group induced by an arbitrary minimal generating set of transpositions. A random induced subgraph of this Cayley graph is obtained by selecting permutations…

We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…

We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on…

Consider the Cayley graph of the cyclic group of prime order q with k uniformly chosen generators. For fixed k, we prove that the diameter of said graph is asymptotically (in q) of order q^(1/k). The same also holds when the generating set…

Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particularly suited for the case of critical Bernoulli percolation…

Random directed graphs $D(n,p)$ undergo a phase transition around the point $p = 1/n$, and the width of the transition window has been known since the works of Luczak and Seierstad. They have established that as $n \to \infty$ when $p = (1…