English
Related papers

Related papers: Asymptotic independence for random permutations fr…

200 papers

For a variety of pattern-avoiding classes, we describe the limiting distribution for the number of fixed points for involutions chosen uniformly at random from that class. In particular we consider monotone patterns of arbitrary length as…

Combinatorics · Mathematics 2023-06-22 Samuel Miner , Douglas Rizzolo , Erik Slivken

The diffusion equation \partial_t\phi = \nabla^2\phi is considered, with initial condition \phi( _x_ ,0) a gaussian random variable with zero mean. Using a simple approximate theory we show that the probability p_n(t_1,t_2) that \phi( _x_…

Condensed Matter · Physics 2009-10-28 Satya N. Majumdar , Clement Sire , Alan J. Bray , Stephen J. Cornell

Let $\Gamma$ be a nonelementary hyperbolic group with a word metric $d$ and $\partial\Gamma$ its hyperbolic boundary equipped with a visual metric $d_a$ for some parameter $a>1$. Fix a superexponential symmetric probability $\mu$ on…

Probability · Mathematics 2020-07-28 Vladas Sidoravicius , Longmin Wang , Kainan Xiang

We prove that if $X = X_1 \times \dots \times X_n$ is a product of hyperbolic Riemann surfaces of finite type and $Y = \Omega/\Gamma$ is a complex manifold, where $\Omega$ is a bounded simply-connected domain in $\mathbb{C}^m$, then the…

Complex Variables · Mathematics 2016-12-19 Divakaran Divakaran , Jaikrishnan Janardhanan

Let $H$ be a permutation group on a set $\Lambda$, which is permutationally isomorphic to a finite alternating or symmetric group $A_n$ or $S_n$ acting on the $k$-element subsets of points from $\{1,\ldots,n\}$, for some arbitrary but fixed…

Group Theory · Mathematics 2015-05-06 Steve Linton , Alice C. Niemeyer , Cheryl E. Praeger

Let $\Gamma$ be an arbitrary $\mathbb{Z}^n$-periodic metric graph, which does not coincide with a line. We consider the Hamiltonian $\mathcal{H}_\varepsilon$ on $\Gamma$ with the action $-\varepsilon^{-1}{\mathrm{d}^2/\mathrm{d} x^2}$ on…

Spectral Theory · Mathematics 2020-05-26 Andrii Khrabustovskyi

Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the…

Number Theory · Mathematics 2026-05-29 Jan-Hendrik Evertse , Kálmán Győry , Lajos Hajdu , Florian Luca , László Remete

Let X be a symmetric space of noncompact type and \Gamma a lattice in the isometry group of X. We study the distribution of orbits of \Gamma acting on the symmetric space X and its geometric boundary X(\infty). More precisely, for any y in…

Dynamical Systems · Mathematics 2007-05-23 Alexander Gorodnik , Hee Oh

We look at geometric limits of large random non-uniform permutations. We mainly consider two theories for limits of permutations: permuton limits, introduced by Hoppen, Kohayakawa, Moreira, Rath, and Sampaio to define a notion of scaling…

Probability · Mathematics 2021-07-22 Jacopo Borga

Following our previous work on copula-based nonsymmetric bivariate dependence measures, we propose a new set of conditions on nonsymmetric multivariate dependence measures which characterize both independence and complete dependence of one…

Methodology · Statistics 2015-12-04 Hui Li

In this article we prove existence of the asymptotic capacity of the range of random walks on free products of graphs. In particular, we will show that the asymptotic capacity of the range is almost surely constant and strictly positive.…

Probability · Mathematics 2024-02-05 Lorenz A. Gilch

A joint limit theorem for the point process of the off-diagonal entries of a sample covariance matrix $\mathbf{S}$, constructed from $n$ observations of a $p$-dimensional random vector with iid components, and the Frobenius norm of…

Probability · Mathematics 2023-02-28 Johannes Heiny , Carolin Kleemann

In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete. 1. Given a permutation group G=<S>, subgroup of $S_n$, and a parameter $k$, find a permutation $\pi$ in G such that…

Computational Complexity · Computer Science 2013-01-18 Vikraman Arvind

We extend the polynomial method of Chen--Garza-Vargas--Tropp--van Handel and Magee--Puder--van Handel for operator-norm bounds in random permutation models to the setting where torsion is present. The main new feature is that asymptotic…

Spectral Theory · Mathematics 2026-02-13 Marco Barbieri , Urban Jezernik

Let $(M,\omega)$ be a geometrically bounded symplectic manifold, $N\subseteq M$ a closed, regular (i.e. "fibering") coisotropic submanifold, and $\phi:M\to M$ a Hamiltonian diffeomorphism. The main result of this article is that the number…

Symplectic Geometry · Mathematics 2012-09-04 Fabian Ziltener

By generalizing the path method, we show that nonlinear spectral gaps of a finite connected graph are uniformly bounded from below by a positive constant which is independent of the target metric space. We apply our result to an $r$-ball…

Metric Geometry · Mathematics 2015-06-16 Takefumi Kondo , Tetsu Toyoda

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

Combinatorics · Mathematics 2008-01-29 Joshua Cooper , Andrew Petrarca

Let $X_1,\ldots,X_n$ be independent random points in the closed unit ball of $\mathbb{R}^d$. Assume that each $X_i$ has a beta distribution with parameter $\beta_i \ge -1$: if $\beta_i>-1$, then $X_i$ has Lebesgue density proportional to…

Probability · Mathematics 2026-05-01 Zakhar Kabluchko , Philipp Schange

In this paper, we derive the asymptotic distribution of the number of copies of a fixed graph $H$ in a random graph $G_n$ sampled from a sparse graphon model. Specifically, we provide a refined analysis that separates the contributions of…

Let $\mathcal I_n$ and $\mathcal J_n$ denote the set of involutions and fixed-point free involutions of $\{1, \dots, n\}$, respectively, and let $\text{des}(\pi)$ denote the number of descents of the permutation $\pi$. We prove a conjecture…

Combinatorics · Mathematics 2019-02-19 Danielle Wang