中文
相关论文

相关论文: Random groups and Property (T): \.Zuk's theorem re…

200 篇论文

The decision problem of perfect matchings in uniform hypergraphs is famously an NP-complete problem. It has been shown by Keevash--Knox--Mycroft [STOC, 2013] that for every $\varepsilon>0$, such decision problem restricted to $k$-uniform…

组合数学 · 数学 2025-10-23 Jie Han , Jingwen Zhao

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

组合数学 · 数学 2026-05-29 Demetres Christofides , Klas Markström , Christina Savvidou

This paper considers the problem of defining distributions over graphical structures. We propose an extension of the hyper Markov properties of Dawid and Lauritzen [Ann. Statist. 21 (1993) 1272-1317], which we term structural Markov…

统计理论 · 数学 2020-04-28 Simon Byrne , A. Philip Dawid

We introduce a relative notion of the 'big images and preimages'-property for random topological Markov chains. This then implies that a relative version of the Ruelle-Perron-Frobenius theorem holds with respect to summable and locally…

动力系统 · 数学 2013-12-30 Manuel Stadlbauer

An $r$-uniform graph $G$ is dense if and only if every proper subgraph $G'$ of $G$ satisfies $\lambda (G') < \lambda (G)$, where $\lambda (G)$ is the Lagrangian of a hypergraph $G$. In 1980's, Sidorenko showed that $\pi(F)$, the Tur\'an…

组合数学 · 数学 2017-01-24 Biao Wu , Yuejian Peng

The Razumov-Stroganov conjecture relates the ground-state coefficients in the even-length dense O(1) loop model to the enumeration of fully-packed loop configuration on the square, with alternating boundary conditions, refined according to…

组合数学 · 数学 2010-03-18 Luigi Cantini , Andrea Sportiello

We consider the following three properties for countable discrete groups $\Gamma$: (1) $\Gamma$ has an infinite subgroup with relative property (T), (2) the group von Neumann algebra $L\Gamma$ has a diffuse von Neumann subalgebra with…

群论 · 数学 2018-02-27 Ionut Chifan , Adrian Ioana

Every homomorphism from finite index subgroups of a universal lattices to mapping class groups of orientable surfaces (possibly with punctures), or to outer automorphism groups of finitely generated nonabelian free groups must have finite…

群论 · 数学 2011-06-21 Masato Mimura

Let $G$ be a connected algebraic semisimple real Lie group with finite center and no compact factors, and let $\Gamma$ be a Zariski dense discrete subgroup of $G$. We show that $\Gamma$ contains free, finitely generated subsemigroups whose…

群论 · 数学 2025-11-11 Aleksander Skenderi

In the binomial $\ell$-gonal model for random groups, where the random relations all have fixed length $\ell\geq 3$ and the number of generators goes to infinity, we establish a double threshold near density $d=\frac{1}{\ell}$ where the…

群论 · 数学 2025-05-13 Emily Clement , John M. Mackay

A new class of groups, the locally finitely determined groups of local similarities on compact ultrametric spaces, is introduced and it is proved that groups in this class have the Haagerup property (that is, they are a-T-menable in the…

群论 · 数学 2012-06-12 Bruce Hughes

We consider a model of a random height function with long-range constraints on a discrete segment. This model was suggested by Benjamini, Yadin and Yehudayoff and is a generalization of simple random walk. The random function is uniformly…

概率论 · 数学 2017-03-14 Ron Peled , Yinon Spinka

In this paper, the improvement about the generalized Kolmogorov-type three series theorem, in the case of NQD random variables, is obtained by different method. Furthermore, the generalized Kolmogorov-type three series theorem is…

概率论 · 数学 2014-02-14 Shi Jianhua , Chen Xiaoping

We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…

无序系统与神经网络 · 物理学 2009-11-10 Sebastian Risau-Gusman

We consider random polynomials with independent identically distributed coefficients with a fixed law. Assuming the Riemann hypothesis for Dedekind zeta functions, we prove that such polynomials are irreducible and their Galois groups…

数论 · 数学 2022-08-25 Emmanuel Breuillard , Péter P. Varjú

We present a new approach to showing that random graphs are nearly optimal expanders. This approach is based on recent deep results in combinatorial group theory. It applies to both regular and irregular random graphs. Let G be a random…

组合数学 · 数学 2015-08-24 Doron Puder

For a graph $G$, denote by $t(G)$ (resp. $b(G)$) the maximum size of a triangle-free (resp. bipartite) subgraph of $G$. Of course $t(G) \geq b(G)$ for any $G$, and a classic result of Mantel from 1907 (the first case of Tur\'an's Theorem)…

概率论 · 数学 2012-06-06 Bobby DeMarco , Jeff Kahn

We show that with high probability the random graph $G_{n, 1/2}$ has an induced subgraph of linear size, all of whose degrees are congruent to $r\pmod q$ for any fixed $r$ and $q\geq 2$. More generally, the same is true for any fixed…

组合数学 · 数学 2021-07-16 Asaf Ferber , Liam Hardiman , Michael Krivelevich

Any Zariski dense countable subgroup of $SL(d,R)$ is shown to carry a non-degenerate finitely supported symmetric random walk such that its harmonic measure on the flag space is singular. The main ingredients of the proof are: (1) a new…

概率论 · 数学 2008-07-08 Vadim A. Kaimanovich , Vincent Le Prince

We consider a family $\{T_N:N \geq 1 \}$ of interval maps as generalizations of the Gauss transformation. For the continued fraction expansion arising from $T_N$, we solve its Gauss-Kuzmin-type problem by applying the theory of random…

数论 · 数学 2016-07-19 Dan Lascu
‹ 上一页 1 8 9 10 下一页 ›