English
Related papers

Related papers: Large-scale Rook Placements

200 papers

What are the general principles that allow proper growth of a tissue or an organ? A growing leaf is an example of such a system: it increases its area by orders of magnitude, maintaining a proper (usually flat) shape. How can this be…

Tissues and Organs · Quantitative Biology 2020-05-13 S. Armon , M. Moshe , E. Sharon

We define a new variant of Rabinowitz Floer homology that is particularly well suited to studying the growth rate of leaf-wise intersections. We prove that for closed manifolds $M$ whose loop space is "complicated", if $\Sigma$ is a…

Symplectic Geometry · Mathematics 2011-01-26 Leonardo Macarini , Will J. Merry , Gabriel P. Paternain

To each sequence $(a_n)$ of positive real numbers we associate a growing sequence $(T_n)$ of continuous trees built recursively by gluing at step $n$ a segment of length $a_n$ on a uniform point of the pre-existing tree, starting from a…

Probability · Mathematics 2016-06-22 Bénédicte Haas

We consider a model of interface growth in two dimensions, given by a height function on the sites of the one--dimensional integer lattice. According to the discrete time update rule, the height above the site $x$ increases to the height…

Probability · Mathematics 2007-05-23 Janko Gravner , Craig A. Tracy , Harold Widom

Let ($X,Y)$ be a random vector with distribution function $F(x,y),$ and $(X_{1},Y_{1}),(X_{2},Y_{2}),...,(X_{n},Y_{n})$ are independent copies of ($X,Y).$ Let $X_{i:n}$ be the $i$th order statistics constructed from the sample…

Statistics Theory · Mathematics 2011-09-08 Ismihan Bairamov

We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…

Combinatorics · Mathematics 2020-01-07 Carlos Hoppen , Giovane Mansan

We study the growing patterns in the rotor-router model formed by adding $N$ walkers at the center of a $L \times L$ two-dimensional square lattice, starting with a periodic background of arrows, and relaxing to a stable configuration. The…

Statistical Mechanics · Physics 2015-06-18 Rahul Dandekar , Deepak Dhar

Permutations avoiding all patterns of a given shape (in the sense of Robinson-Schensted-Knuth) are considered. We show that the shapes of all such permutations are contained in a suitable thick hook, and deduce an exponential growth rate…

Combinatorics · Mathematics 2007-05-23 Ron M. Adin , Yuval Roichman

We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…

Functional Analysis · Mathematics 2026-04-15 Jie Shi

This paper studies the limits of a spatial random field generated by uniformly scattered random sets, as the density $\lambda$ of the sets grows to infinity and the mean volume $\rho$ of the sets tends to zero. Assuming that the volume…

Probability · Mathematics 2011-11-10 Ingemar Kaj , Lasse Leskelä , Ilkka Norros , Volker Schmidt

We show that random Cayley graphs of finite simple (or semisimple) groups of Lie type of fixed rank are expanders. The proofs are based on the Bourgain-Gamburd method and on the main result of our companion paper, establishing strongly…

Group Theory · Mathematics 2014-02-10 Emmanuel Breuillard , Ben Green , Robert Guralnick , Terence Tao

Let $X$ be a random variable with distribution function $F,$ and $X_{1},X_{2},...,X_{n}$ are independent copies of $X.$ Consider the order statistics $X_{i:n},$ $i=1,2,...,n$ and denote $F_{i:n}(x)=P\{X_{i:n}\leq x\}.$ Using majorization…

Statistics Theory · Mathematics 2011-09-02 Ismihan Bairamov

Random skew plane partitions of large size distributed according to an appropriately scaled Schur process develop limit shapes. In the present work we consider the limit of large random skew plane partitions where the inner boundary…

Mathematical Physics · Physics 2015-05-14 Cedric Boutillier , Sevak Mkrtchyan , Nicolai Reshetikhin , Peter Tingley

We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the…

Discrete Mathematics · Computer Science 2014-10-24 Abbas Mehrabian

Let $G=(V,E)$ be a finite graph. For $v\in V$ we denote by $G_v$ the subgraph of $G$ that is induced by $v$'s neighbor set. We say that $G$ is $(a,b)$-regular for $a>b>0$ integers, if $G$ is $a$-regular and $G_v$ is $b$-regular for every…

Combinatorics · Mathematics 2019-08-29 Michael Chapman , Nati Linial , Yuval Peled

We investigate asymptotic probabilistic phenomena arising from the application of the Schensted row insertion algorithm, a key component of the Robinson-Schensted-Knuth (RSK) correspondence, to random inputs. Our analysis centers on a…

Probability · Mathematics 2025-09-10 Mikołaj Marciniak , Piotr Śniady

We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities…

Probability · Mathematics 2025-10-07 Jacopo Borga , Sourav Chatterjee , Persi Diaconis

In this paper, we consider the $(L,1)$ state-dependent reflecting random walk (RW) on the half line, which is a RW allowing jumps to the left at a maxial size $L$. For this model, we provide an explicit criterion for (positive) recurrence…

Probability · Mathematics 2012-12-03 Wenming Hong , Ke Zhou , Yiqiang Q. Zhao

The spread of infectious disease in a human community or the proliferation of fake news on social media can be modeled as a randomly growing tree-shaped graph. The history of the random growth process is often unobserved but contains…

Probability · Mathematics 2021-01-15 Harry Crane , Min Xu

We study the shape of the Young diagram \lambda associated via the Robinson-Schensted-Knuth algorithm to a random permutation in S_n such that the length of the longest decreasing subsequence is not bigger than a fixed number d; in other…

Combinatorics · Mathematics 2007-05-23 Piotr Sniady