English
Related papers

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

200 papers

We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degree sequence is non-increasing with respect to an ordering of…

Combinatorics · Mathematics 2008-10-07 Tuerker Biyikoglu , Josef Leydold

When the limiting compensator of a sequence of martingales is continuous, we obtain a weak convergence theorem for the martingales; the limiting process can be written as a Brownian motion evaluated at the compensator and we find sufficient…

Probability · Mathematics 2024-01-22 Bruno Rémillard , Jean Vaillancourt

Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…

Probability · Mathematics 2012-10-24 David A. Croydon

This paper investigates the behaviour of the spectrum of generally correlated Gaussian random matrices whose columns are zero-mean independent vectors but have different correlations, under the specific regime where the number of their…

Information Theory · Computer Science 2014-12-30 Abla Kammoun , M. S. Alouini

The nature of the alignment with gaps corresponding to a longest common subsequence (LCS) of two independent iid random sequences drawn from a finite alphabet is investigated. It is shown that such an optimal alignment typically matches…

Probability · Mathematics 2016-04-22 C. Houdré , H. Matzinger

It is now believed that the limiting distribution function of the largest eigenvalue in the three classic random matrix models GOE, GUE and GSE describe new universal limit laws for a wide variety of processes arising in mathematical…

Mathematical Physics · Physics 2007-05-23 Craig A. Tracy , Harold Widom

Spectral embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently,…

Probability · Mathematics 2018-09-10 Russell Lyons , Shayan Oveis Gharan

This paper is interested in independent sets (or equivalently, cliques) in uniform random cographs. We also study their permutation analogs, namely, increasing subsequences in uniform random separable permutations. First, we prove that,…

I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees…

Disordered Systems and Neural Networks · Physics 2016-05-04 A C C Coolen

We review several results related to the problem of a quantum particle in a random environment. In an introductory part, we recall how several functionals of the Brownian motion arise in the study of electronic transport in weakly…

Disordered Systems and Neural Networks · Physics 2007-05-23 Alain Comtet , Jean Desbois , Christophe Texier

This paper is the first part of our survey on various results about the distribution of exponential type Brownian functionals defined as an integral over time of geometric Brownian motion. Several related topics are also mentioned.

Probability · Mathematics 2007-05-23 Hiroyuki Matsumoto , Marc Yor

We discuss subordination of random compact R-trees. We focus on the case of the Brownian tree, where the subordination function is given by the past maximum process of Brownian motion indexed by the tree. In that particular case, the…

Probability · Mathematics 2016-05-25 Jean-François Le Gall

We investigate the limiting distribution of geometric Brownian motion conditional on its running maximum taking large values. We show that the conditional distribution of the geometric Brownian motion converges after a suitable…

Probability · Mathematics 2025-05-14 Ze-An Ng

We study the color patterns that, for $n$ sufficiently large, are unavoidable in $2$-colorings of the edges of a complete graph $K_n$ with respect to $\min \{e(R), e(B)\}$, where $e(R)$ and $e(B)$ are the numbers of red and, respectively,…

Combinatorics · Mathematics 2023-06-08 Yair Caro , Adriana Hansberg , Amanda Montejano

The microscopic spectral correlations of the Dirac operator in Yang-Mills theories coupled to fermions in (2+1) dimensions can be related to three universality classes of Random Matrix Theory. In the microscopic limit the Orthogonal…

High Energy Physics - Theory · Physics 2009-10-31 Christian Hilmoine , Rune Niclasen

We study random k-lifts of large, but otherwise arbitrary graphs G. We prove that, with high probability, all eigenvalues of the adjacency matrix of the lift that are not eigenvalues of G are of the order (D ln (kn))^{1/2}, where D is the…

Combinatorics · Mathematics 2011-09-07 Roberto Imbuzeiro Oliveira

This paper is the second of a series devoted to the study of the dynamics of the spectrum of large random matrices. We study general extensions of the partial differential equation arising to characterize the limit spectral measure of the…

Analysis of PDEs · Mathematics 2024-03-20 Charles Bertucci , Jean-Michel Lasry , Pierre Louis Lions

We study three instances of log-correlated processes on the interval: the logarithm of the Gaussian unitary ensemble (GUE) characteristic polynomial, the Gaussian log-correlated potential in presence of edge charges, and the Fractional…

Mathematical Physics · Physics 2016-06-14 Yan V. Fyodorov , Pierre Le Doussal

We consider global fluctuations of the spectrum of the GUE. Using results on the linear statistics of such matrices as well as variance bounds on the eigenvalues, we show that under a suitable scaling, global fluctuations of the spectrum…

Probability · Mathematics 2015-10-21 Christian Webb

A strict bramble of a graph $G$ is a collection of pairwise-intersecting connected subgraphs of $G.$ The order of a strict bramble ${\cal B}$ is the minimum size of a set of vertices intersecting all sets of ${\cal B}.$ The strict bramble…

Combinatorics · Mathematics 2024-04-11 Emmanouil Lardas , Evangelos Protopapas , Dimitrios M. Thilikos , Dimitris Zoros
‹ Prev 1 3 4 5 6 7 10 Next ›