Related papers: Random Heegaard splittings
A connection is made between the random turns model of vicious walkers and random permutations indexed by their increasing subsequences. Consequently the scaled distribution of the maximum displacements in a particular asymmeteric version…
Hypergraphs provide a fundamental framework for representing complex systems involving interactions among three or more entities. As empirical hypergraphs grow in size, characterizing their structural properties becomes increasingly…
In the context of countable groups of polynomial volume growth, we consider a large class of random walks that are allowed to take long jumps along multiple subgroups according to power law distributions. For such a random walk, we study…
Given a Heegaard splitting of a closed 3-manifold, the skein modules of the two handlebodies are modules over the skein algebra of their common boundary surface. The zeroth Hochschild homology of the skein algebra of a surface with…
Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…
A gap in a paper of Rubinstein-Scharlemann is explored: new examples are found of closed orientable 3-manifolds with possibly multiple genus 2 Heegaard splittings. Properties common to all the examples in the original paper are not…
In this paper we study the number of returns to the coordinate hyperplanes for multidimensional nearest-neighbour random walks. While one-dimensional results on returns are classical, much less is known in higher dimensions. We analyse the…
We show that if a Heegaard splitting is obtained by gluing a splitting of Hempel distance at least 4 and the genus-1 splitting of $S^2 \times S^1$, then the Goeritz group of the splitting is finitely generated. To show this, we first…
Turn the set of permutations of $n$ objects into a graph $G_n$ by connecting two permutations that differ by one transposition, and let $\sigma_t$ be the simple random walk on this graph. In a previous paper, Berestycki and Durrett [In…
Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…
Suppose that a three-manifold M contains infinitely many distinct strongly irreducible Heegaard splittings H + nK, obtained by Haken summing the surface H with n copies of the surface K. We show that K is incompressible. All known examples,…
Using the results obtained by the non commutative geometry techniques applied to the Harper equation, we derive the areas distribution of random walks of length $ N $ on a two-dimensional square lattice for large $ N $, taking into account…
In this paper, we derive the distribution of a two-dimensional (complex) random walk in which the angle of each step is restricted to a subset of the circle. This setting appears in various domains, such as in over-the-air computation in…
We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is a non-compact simple Lie group and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense subgroup.…
In this paper, we introduce a new concept of {\it strongly keen} for Heegaard splittings, and show that, for any integers $n\geq 2$ and $g\geq 3$, there exists a strongly keen Heegaard splitting of genus $g$ whose Hempel distance is $n$.
This paper deals with random walks on isometry groups of Gromov hyperbolic spaces, and more precisely with the dimension of the harmonic measure $\nu$ associated with such a random walk. We first establish a link of the form $\dim \nu \leq…
We show that given a partially flat angled ideal triangulation for a 3-manifold $M$ with boundary (as defined by Lackenby), there is an algorithm to produce a list of Heegaard splittings for $M$ such that below a given genus $g$, each…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
We show that a random link defined by random bridge splitting is hyperbolic with asymptotic probability 1.
Random geometric graphs are random graph models defined on metric spaces. Such a model is defined by first sampling points from a metric space and then connecting each pair of sampled points with probability that depends on their distance,…