English
Related papers

Related papers: GUE minors, maximal Brownian functionals and longe…

200 papers

The spectral moments of ensembles of sparse random block matrices are analytically evaluated in the limit of large order. The structure of the sparse matrix corresponds to the Erd\"os-Renyi random graph. The blocks are i.i.d. random…

Mathematical Physics · Physics 2022-04-13 Giovanni M. Cicuta , Mario Pernici

We extend recent results on the asymptotic eigenvalue distribution of the SYK model to the multivariate case and relate the limit of a dynamical version of the SYK model with the q-Brownian motion, a non-commutative deformation of classical…

Operator Algebras · Mathematics 2020-09-09 Miguel Pluma , Roland Speicher

The local tree-width of a graph G=(V,E) is the function ltw^G: N -> N that associates with every natural number r the maximal tree-width of an r-neighborhood in G. Our main graph theoretic result is a decomposition theorem for graphs with…

Combinatorics · Mathematics 2007-05-23 Martin Grohe

We study three families of labelled plane trees. In all these trees, the root is labelled 0, and the labels of two adjacent nodes differ by $0, 1$ or -1. One part of the paper is devoted to enumerative results. For each family, and for all…

Combinatorics · Mathematics 2008-05-05 Mireille Bousquet-Mélou

The paper deals with the expected maxima of continuous Gaussian processes $X = (X_t)_{t\ge 0}$ that are H\"older continuous in $L_2$-norm and/or satisfy the opposite inequality for the $L_2$-norms of their increments. Examples of such…

Probability · Mathematics 2015-08-04 Konstantin Borovkov , Yuliya Mishura , Alexander Novikov , Mikhail Zhitlukhin

We give alternate constructions of (i) the scaling limit of the uniform connected graphs with given fixed surplus, and (ii) the continuum random unicellular map (CRUM) of a given genus that start with a suitably tilted Brownian continuum…

Probability · Mathematics 2021-11-17 Grégory Miermont , Sanchayan Sen

It is proved that the limiting distribution of the length of the longest weakly increasing subsequence in an inhomogeneous random word is related to the distribution function for the eigenvalues of a certain direct sum of Gaussian unitary…

Combinatorics · Mathematics 2007-05-23 Alexander R. Its , Craig A. Tracy , Harold Widom

This article contains both a point process and a sequential description of the greatest convex minorant of Brownian motion on a finite interval. We use these descriptions to provide new analysis of various features of the convex minorant…

Probability · Mathematics 2010-11-16 Jim Pitman , Nathan Ross

We begin with a new analysis of formal words. Let w be a formal word in letters g_1,...,g_k. The word map associated with w maps the permutations s_1,...,s_k in S_n to the permutation obtained by replacing for each i, every occurrence of…

Combinatorics · Mathematics 2011-04-21 Nati Linial , Doron Puder

We study the Gaussian Unitary Ensemble (GUE) using noncommutative geometry and the homological framework of the Batalin-Vilkovisky (BV) formalism. Coefficients of the correlation functions in the GUE with respect to the rank $N$ are…

Mathematical Physics · Physics 2022-06-10 Owen Gwilliam , Alastair Hamilton , Mahmoud Zeinalian

We reformulate the matrix models of minimal superstrings as loop gas models on random surfaces. In the continuum limit, this leads to the identification of minimal superstrings with certain bosonic string theories, to all orders in the…

High Energy Physics - Theory · Physics 2009-11-10 Davide Gaiotto , Leonardo Rastelli , Tadashi Takayanagi

The principal results of this contribution are the weak and strong limits of maxima of contracted stationary Gaussian random sequences. Due to the random contraction we introduce a modified Berman condition which is sufficient for the weak…

Probability · Mathematics 2013-12-10 Enkelejd Hashorva , Zhichao Weng

We determine the long time behavior and the exact order of the tail probability for the maximal displacement of a branching Brownian motion in Euclidean space in terms of the principal eigenvalue of the associated Schr\"odinger type…

Probability · Mathematics 2020-07-14 Yasuhito Nishimori , Yuichi Shiozawa

The spectral radius $\rho(G)$ of a graph $G$ is the largest eigenvalue of its adjacency matrix $A(G)$. For a fixed integer $e\ge 1$, let $G^{min}_{n,n-e}$ be a graph with minimal spectral radius among all connected graphs on $n$ vertices…

Combinatorics · Mathematics 2011-10-12 Jingfen Lan , Linyuan Lu , Lingsheng Shi

We investigate the order of the variance of the optimal alignments score of two independent iid binary random words having the same length. The letters are equiprobable, but the scoring function is such that one letter has a larger score…

Probability · Mathematics 2016-06-17 Christian Houdré , Heinrich Matzinger

We consider the eigenvectors of the principal minor of dimension $n< N$ of the Dyson Brownian motion in $\mathbb{R}^{N}$ and investigate their asymptotic overlaps with the eigenvectors of the full matrix in the limit of large dimension. We…

Probability · Mathematics 2024-11-27 Elie Attal , Romain Allez

For a unimodular random graph $(G,\rho)$, we consider deformations of its intrinsic path metric by a (random) weighting of its vertices. This leads to the notion of the conformal growth exponent of $(G,\rho)$, which is the best asymptotic…

Probability · Mathematics 2020-06-02 James R. Lee

The Brownian separable permutons are a one-parameter family -- indexed by $p\in(0,1)$ -- of universal limits of random constrained permutations. We show that for each $p\in (0,1)$, there are explicit constants $1/2 < \alpha_*(p) \leq…

Probability · Mathematics 2024-01-04 Jacopo Borga , William Da Silva , Ewain Gwynne

We consider the maximum process of a random walk with additive independent noise in form of $\max_{i=1,\dots,n}(S_i+Y_i)$. The random walk may have dependent increments, but its sample path is assumed to converge weakly to a fractional…

Probability · Mathematics 2014-02-12 Yizao Wang

A regular graph $G = (V,E)$ is an $(\varepsilon,\gamma)$ small-set expander if for any set of vertices of fractional size at most $\varepsilon$, at least $\gamma$ of the edges that are adjacent to it go outside. In this paper, we give a…

Computational Complexity · Computer Science 2022-11-18 Mark Braverman , Dor Minzer