相关论文: A stationary random graph of no growth rate
A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting along the simple random walk. We adapt the entropy technique developed for Cayley graphs and show in particular that stationary random…
We construct a unimodular random rooted graph with maximal degree $d\geq 3$ and upper growth rate $d-1$, which does not have a growth rate. Ab\'ert, Fraczyk and Hayes showed that for a unimodular random tree, if the upper growth rate is at…
For every infinite sequence of simple groups of Lie type of growing rank we exhibit connected Cayley graphs of degree at most 10 such that the isoperimetric number of these graphs converges to 0. This proves that these graphs do not form a…
We show by example that there is a Cayley graph, having two invariant random subgraphs X and Y, such that there exists a monotone coupling between them in the sense that $X\subset Y$, although no such coupling can be invariant. Here,…
We show that for any Cayley graph, the probability (at any $p$) that the cluster of the origin has size n decays at a well-defined exponential rate (possibly 0). For general graphs, we relate this rate being positive in the supercritical…
We show that the total variation mixing time is not quasi-isometry invariant, even for Cayley graphs. Namely, we construct a sequence of pairs of Cayley graphs with maps between them that twist the metric in a bounded way, while the ratio…
An inaccessible, vertex transitive, locally finite graph is described. This graph is not quasi-isometric to a Cayley graph.
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…
In this paper we introduce and study a type of Cayley graph -- subnormal Cayley graph. We prove that a subnormal 2-arc transitive Cayley graph is a normal Cayley graph or a normal cover of a complete bipartite graph $K_{p^d,p^d}$ with $p$…
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…
In this article the construction of a stationary random knot is proposed. The corresponding smooth random curve has no self-intersections in deterministic moments of time and changes its topological type at random moments.
We show that the expected gonality of a random graph is asymptotic to the number of vertices.
In this paper we are interested in the asymptotic enumeration of Cayley graphs. It has previously been shown that almost every Cayley digraph has the smallest possible automorphism group: that is, it is a digraphical regular representation…
We characterize the spectrum of the transition matrix for simple random walk on graphs consisting of a finite graph with a finite number of infinite Cayley trees attached. We show that there is a continuous spectrum identical to that for a…
For a 3-uniform hypergraph (3-graph) $F$, let $r(F,n)$ be the smallest $N$ such that any $N$-vertex $F$-free 3-graph has an independent set of size $n$. We construct a $3$-graph $H_2$ with six vertices and five edges such that…
We give an example of a 4-regular infinite automatic graph of intermediate growth. It is constructed as a Schreier graph of a certain group generated by 3-state automaton. The question was motivated by an open problem on the existence of…
Let $\Gamma$ be a Cayley graph, or a Cayley sum graph, or a twisted Cayley graph, or a twisted Cayley sum graph, or a vertex-transitive graph. Suppose $\Gamma$ is undirected and non-bipartite. Let $\mu$ (resp. $\mu_2$) denote the smallest…
We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching. The two results together imply that every Cayley graph…
We develop a general procedure that finds recursions for statistics counting isomorphic copies of a graph $G_0$ in the common random graph models ${\cal G}(n,m)$ and ${\cal G}(n,p)$. Our results apply when the average degrees of the random…
We prove that any stationary random graph satisfying a growth condition and having positive entropy almost surely admits an infinite dimensional space of bounded harmonic functions. Applications to random infinite planar triangulations and…