English
Related papers

Related papers: Combinatorially random curves on surfaces

200 papers

We study some properties of the Cayley graph of the R.Thompson's group F in generators $x_0$, $x_1$. We show that the density of this graph, that is, the least upper bound of the average vertex degree of its finite subgraphs is at least 3.…

Group Theory · Mathematics 2007-05-23 Victor Guba

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…

Computational Complexity · Computer Science 2016-06-07 Tali Kaufman , David Mass

We give lower bounds on the maximum possible girth of an $r$-uniform, $d$-regular hypergraph with at most $n$ vertices, using the definition of a hypergraph cycle due to Berge. These differ from the trivial upper bound by an absolute…

Combinatorics · Mathematics 2017-07-14 David Ellis , Nathan Linial

It is well-known that a complete Riemannian manifold M which is locally isometric to a symmetric space is covered by a symmetric space. Here we prove that a discrete version of this property (called local to global rigidity) holds for a…

Metric Geometry · Mathematics 2019-11-26 Mikael de la Salle , Romain Tessera

Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of…

Geometric Topology · Mathematics 2023-06-07 Shuchi Agrawal , Tarik Aougab , Yassin Chandran , Marissa Loving , J. Robert Oakley , Roberta Shapiro , Yang Xiao

We study points of moderately low degree on a curve $C$ over a number field, which is embedded on a nice toric surface $S$. Recently, Smith and Vogt related the linear equivalence classes of such points to intersections of $C$ with curves…

Algebraic Geometry · Mathematics 2025-08-07 Eden Granot

Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq3$. We prove that, with probability $1-N^{-1+{\varepsilon}}$ for any ${\varepsilon} >0$, the following two properties hold as $N…

Probability · Mathematics 2025-02-04 Jiaoyang Huang , Horng-Tzer Yau

We show that the cop number of the Cayley sum graph of a finite group $G$ with respect to a symmetric subset $S$ is at most twice its degree when the graph is connected, undirected. We also prove that a similar bound holds for the cop…

Combinatorics · Mathematics 2025-04-29 Arindam Biswas , Jyoti Prakash Saha

Resolving parameters is a fundamental area of combinatorics with applications not only to many branches of combinatorics but also to other sciences. In this article, we construct a class of Toeplitz graphs, and will be denoted by…

Combinatorics · Mathematics 2021-12-14 Jia-Bao Liu , Ali Zafari

A taming symplectic structure provides an upper bound on the area of an approximately pseudoholomorphic curve in terms of its homology class. We prove that, conversely, an almost complex manifold with such an area bound admits a taming…

Symplectic Geometry · Mathematics 2023-11-16 Spencer Cattalani

Let $(\Sigma_n)$ be a sequence of surfaces immersed in a $4$-manifold $M$ which converges to a branched surface $\Sigma_0$ .\\ We denote by $k^T_p$ (resp. $k^N_p$) the amount of curvature of the tangent bundles $T\Sigma_n$ (resp. normal…

Differential Geometry · Mathematics 2025-09-03 Marina Ville

We show that, in discrete models of quantum gravity, emergent geometric space can be viewed as the entanglement pattern in a mixed quantum state of the "universe", characterized by a universal topological network entanglement. As a concrete…

High Energy Physics - Theory · Physics 2017-11-22 M. C. Diamantini , C. A. Trugenberger

Our main result is an extension of Pansu's theorem to random metrics, where the edges of the Cayley are i.i.d. random variable with some finite exponential moment. Based on a previous work by the second author, the proof relies on…

Probability · Mathematics 2015-05-13 Itai Benjamini , Romain Tessera

We establish spectral theorems for random walks on mapping class groups of connected, closed, oriented, hyperbolic surfaces, and on $\text{Out}(F_N)$. In both cases, we relate the asymptotics of the stretching factor of the…

Group Theory · Mathematics 2020-07-20 François Dahmani , Camille Horbez

Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$…

Probability · Mathematics 2019-07-29 Tom Hutchcroft

Given a finitely generated amenable group we consider ergodic random Schr\"odinger operators on a Cayley graph with random potentials and random boundary conditions. We show that the normalised eigenvalue counting functions of finite volume…

Mathematical Physics · Physics 2014-02-18 Felix Pogorzelski , Fabian Schwarzenberger , Christian Seifert

As generalizations of random graphs, random simplicial complexes have been receiving growing attention in the literature. In this paper, we naturally extend the Random Connection Model (RCM), a random graph that has been extensively studied…

Probability · Mathematics 2025-06-16 Dominik Pabst

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

Probability · Mathematics 2007-05-23 Noga Alon , Itai Benjamini , Alan Stacey

We study the existence of at least one conformal metric of prescribed Gaussian curvature on a closed surface $\Sigma$ admitting conical singularities of orders $\alpha_i$'s at points $p_i$'s. In particular, we are concerned with the case…

Analysis of PDEs · Mathematics 2017-01-20 Teresa D'Aprile , Francesca De Marchis , Isabella Ianni

Benjamini, Finucane and the first author have shown that if (G_n,S_n) is a sequence of Cayley graphs such that |S_n^n|=O(n^D|S_n|), then the sequence (G_n,d_{S_n}/n) is relatively compact for the Gromov-Hausdorff topology and every cluster…

Group Theory · Mathematics 2018-06-15 Romain Tessera , Matthew Tointon