中文
相关论文

相关论文: A sharp threshold for collapse of the random trian…

200 篇论文

We consider random right-angled Coxeter groups, $W_{\Gamma}$, whose presentation graph $\Gamma$ is taken to be an Erd\H{o}s--R\'enyi random graph, i.e., $\Gamma\sim \mathcal{G}_{n,p}$. We use techniques from probabilistic combinatorics to…

概率论 · 数学 2025-02-26 Jason Behrstock , R. Altar Ciceksiz , Victor Falgas-Ravry

We study two global structural properties of a graph $\Gamma$, denoted AS and CFS, which arise in a natural way from geometric group theory. We study these properties in the Erd\"os--R\'enyi random graph model G(n,p), proving a sharp…

概率论 · 数学 2020-01-29 Jason Behrstock , Victor Falgas-Ravry , Mark F. Hagen , Timothy Susse

We give a sharp bound on the number of triangles in a graph with fixed number of edges. We also characterize graphs that achieve the maximum number of triangles. Using the upper bound on number of triangles, we prove that if $G$ is a…

群论 · 数学 2022-05-13 Tony N. Mavely , Viji Z. Thomas

Given a group G, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of G where each element of the generating set is chosen independently at random with probability p. In this article we show that for any…

组合数学 · 数学 2011-08-18 Demetres Christofides , Klas Markström

We investigate some properties of the $p$-elements of a profinite group $G$. We prove that if $p$ is odd and the probability that a randomly chosen element of $G$ is a $p$-element is positive, then $G$ contains an open prosolvable subgroup.…

群论 · 数学 2024-07-01 Andrea Lucchini , Nowras Otmen

We prove that with probability tending to 1, a 1-relator group with at least 3 generators and relator of length n is residually finite, virtually residually (finite p)-group for all sufficiently large p, and coherent. The proof uses both…

群论 · 数学 2009-09-13 Mark Sapir , Iva Spakulova

We prove part of a higher rank analogue of the Mazur-Gouvea Conjecture. More precisely, let $\tilde{\bf G}$ be a connected, reductive ${\Bbb Q}$-split group and let $\Gamma$ be an arithmetic subgroup of $\tilde{\bf G}$. We show that the…

数论 · 数学 2013-06-14 Joachim Mahnkopf

The random walk problem is studied in two and three dimensions in the presence of a random distribution of static traps. An efficient Monte Carlo method, based on a mapping onto a polymer model, is used to measure the survival probability…

统计力学 · 物理学 2009-11-07 G. T. Barkema , Parthapratim Biswas , Henk van Beijeren

The distinguishing number $D(\Gamma)$ of a graph $\Gamma$ is the least size of a partition of the vertices of $\Gamma$ such that no non-trivial automorphism of $\Gamma$ preserves this partition. We show that if the automorphism group of a…

组合数学 · 数学 2020-06-16 Mariusz Grech , Andrzej Kisielewicz

What is the probability that a random triangle is acute? We explore this old question from a modern viewpoint, taking into account linear algebra, shape theory, numerical analysis, random matrix theory, the Hopf fibration, and much much…

历史与综述 · 数学 2015-01-14 Alan Edelman , Gilbert Strang

A $p$-divisible group over a field $K$ admits a slope decomposition; associated to each slope $\lambda$ is an integer $m$ and a representation $\gal(K) \ra \gl_m(D_\lambda)$, where $D_\lambda$ is the $\rat_p$-division algebra with Brauer…

数论 · 数学 2020-02-28 Jeff Achter , Peter Norman

We consider the Erdos-Renyi random graph G(n,p) inside the critical window, that is when p=1/n+ lambda*n^{-4/3}, for some fixed lambda in R. Then, as a metric space with the graph distance rescaled by n^{-1/3}, the sequence of connected…

概率论 · 数学 2009-05-06 Louigi Addario-Berry , Nicolas Broutin , Christina Goldschmidt

Let $\pi$ be an irreducible unitary representation of a finitely generated nonabelian free group $\Gamma$; suppose $\pi$ is weakly contained in the regular representation. In 2001 the first and third authors conjectured that such a…

表示论 · 数学 2020-10-14 M. Gabriella Kuhn , Sandra Saliani , Tim Steger

The random reversal graph offers new perspectives, allowing to study the connectivity of genomes as well as their most likely distance as a function of the reversal rate. Our main result shows that the structure of the random reversal graph…

组合数学 · 数学 2010-03-04 Emma Y. Jin , Christian M. Reidys

A countable discrete group $\Gamma$ is said to have the relative ISR-property if for every non-trivial normal subgroup $N\trianglelefteq\Gamma$ and every von Neumann subalgebra $\mathcal{M}\subseteq L(\Gamma)$ invariant under conjugation by…

算子代数 · 数学 2026-04-07 Tattwamasi Amrutam

We prove that in various natural models of a random quotient of a group, depending on a density parameter, for each hyperbolic group there is some critical density under which a random quotient is still hyperbolic with high probability,…

群论 · 数学 2007-05-23 Yann Ollivier

A matrix is given in ``shredded'' form if we are presented with the multiset of rows and the multiset of columns, but not told which row is which or which column is which. The matrix is reconstructible if it is uniquely determined by this…

组合数学 · 数学 2024-01-11 Paul Balister , Gal Kronenberg , Alex Scott , Youri Tamitegama

We say that a countable discrete group $\Gamma$ satisfies the invariant von Neumann subalgebras rigidity (ISR) property if every $\Gamma$- invariant von Neumann subalgebra $\mathcal{M}$ in $L(\Gamma)$ is of the form $L(\Lambda)$ for some…

算子代数 · 数学 2022-12-06 Tattwamasi Amrutam , Yongle Jiang

We describe an extremal property of the hexagonal lattice $\Lambda \subset \mathbb{R}^2$. Let $p$ denote the circumcenter of its fundamental triangle (a so-called deep hole) and let $A_r$ denote the set of lattice points that are at…

度量几何 · 数学 2019-08-27 Markus Faulhuber , Stefan Steinerberger

The Gamma distribution is well-known and widely used in many signal processing and communications applications. In this letter, a simple and extremely efficient accept/reject algorithm is introduced for the generation of independent random…

统计计算 · 统计学 2013-06-27 Luca Martino , David Luengo