Related papers: Combinatorially random curves on surfaces

It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…

We recall first Gallai-simplicial complex $\Delta_{\Gamma}(G)$ associated to Gallai graph $\Gamma(G)$ of a planar graph $G$. The Euler characteristic is a very useful topological and homotopic invariant to classify surfaces. In Theorems 3.2…

We show that on compact Riemann surfaces of nonpositive curvature, the generalized periods, i.e. the $\nu$-th order Fourier coefficients of eigenfunctions $e_\lambda$ over a closed smooth curve $\gamma$ which satisfies a natural curvature…

We present a finer quantitative version of an observation due to Breuillard, Green, Guralnick and Tao which tells that for finite non-bipartite Cayley graphs, once the nontrivial eigenvalues of their normalized adjacency matrices are…

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…

Given a closed orientable surface (\Sigma) of genus at least two, we establish an affine isomorphism between the convex compact set of isotopy-invariant topological measures on (\Sigma) and the convex compact set of additive functions on…

We define the quantile set of order $\alpha \in \left[ 1/2,1\right) $ associated to a law $P$ on $\mathbb{R}^{d}$ to be the collection of its directional quantiles seen from an observer $O\in \mathbb{R}^{d}$. Under minimal assumptions these…

Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…

We prove central limit theorems for the random walks on either the mapping class group of a closed, connected, orientable, hyperbolic surface, or on $\text{Out}(F_N)$, each time under a finite second moment condition on the measure (either…

Let $M$ be a smooth, compact manifold and let $\mathcal{N}_{\mu}$ denote the set of Riemannian metrics on $M$ with smooth volume density $\mu$. For a given $g_0\in \mathcal{N}_{\mu}$, we show that if $\dim(M)\ge 5$, then there exists an…

Lower bound on the equivariant Hilbertian compression exponent $\alpha$ are obtained using random walks. More precisely, if the probability of return of the simple random walk is $\succeq \textrm{exp}(-n^\gamma)$ in a Cayley graph then…

We establish mild conditions under which a possibly irregular, sparse graph $G$ has "many" strong orientations. Given a graph $G$ on $n$ vertices, orient each edge in either direction with probability $1/2$ independently. We show that if…

For graphs $F$ and $G$, let $F\to G$ signify that any red/blue edge coloring of $F$ contains a monochromatic $G$. Denote by ${\cal G}(N,p)$ the random graph space of order $N$ and edge probability $p$. Using the regularity method, one can…

Consider an orientable compact surface in three dimensional Euclidean space with minimum total absolute curvature. If the Gaussian curvature changes sign to finite order and satisfies a nondegeneracy condition along closed asymptotic…

Starting from an arbitrary sequence of polygons whose total perimeter is $2n$, we can build an (oriented) surface by pairing their sides in a uniform fashion. Chmutov and Pittel (arXiv:1503.01816) have shown that, regardless of the…

Let $M$ denote a low-dimensional manifold embedded in Euclidean space and let ${X}= \{ x_1, \dots, x_n \}$ be a collection of points uniformly sampled from it. We study the relationship between the curvature of a random geometric graph…

We impose the uniform probability measure on the set of all discrete Gelfand-Tsetlin patterns of depth $n$ with the particles on row $n$ in deterministic positions. These systems equivalently describe a broad class of random tilings models,…

The bondage number $b(G)$ of a graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination number. An orientable surface $\mathbb{S}_h$ of genus $h$, $h \geq 0$, is obtained from the sphere…

We present a simple mechanism, which can be randomised, for constructing sparse $3$-uniform hypergraphs with strong expansion properties. These hypergraphs are constructed using Cayley graphs over $\mathbb{Z}_2^t$ and have vertex degree…

We show that a random walk on the mapping class group of an orientable surface of finite type makes linear progress in the relative metric, which is quasi-isometric to the complex of curves.