Related papers: Component Spectrum of Large Sparse Uniformly Rando…
In this work, we investigate the spectrum of singularities of random stable trees with parameter $\gamma\in(1,2)$. We consider for that purpose the scaling exponents derived from two natural measures on stable trees: the local time $\ell^a$…
We equip the polytope of $n\times n$ Markov matrices with the normalized trace of the Lebesgue measure of $\mathbb{R}^{n^2}$. This probability space provides random Markov matrices, with i.i.d. rows following the Dirichlet distribution of…
Appropriately normalized square random Vandermonde matrices based on independent random variables with uniform distribution on the unit circle are studied. It is shown that as the matrix sizes increases without bound, with respect to the…
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…
Let P_{n,m} denote the graph taken uniformly at random from the set of all planar graphs on {1,2,..., n} with exactly m(n) edges. We use counting arguments to investigate the probability that P_{n,m} will contain given components and…
We construct new irreducible components in the discrete automorphic spectrum of symplectic groups. The construction lifts a cuspidal automorphic representation of $\mathrm{GL}_{2n}$ with a linear period to an irreducible component of the…
We study the spectrum of an asymmetric random matrix with block structured variances. The rows and columns of the random square matrix are divided into $D$ partitions with arbitrary size (linear in $N$). The parameters of the model are the…
We study asymptotics of representations of the unitary groups U(n) in the limit as n tends to infinity and we show that in many aspects they behave like large random matrices. In particular, we prove that the highest weight of a random…
A thorough discussion of the statistical ensemble of scale-free connected random tree graphs is presented. Methods borrowed from field theory are used to define the ensemble and to study analytically its properties. The ensemble is…
A locally uniform random permutation is generated by sampling $n$ points independently from some absolutely continuous distribution $\rho$ on the plane and interpreting them as a permutation by the rule that $i$ maps to $j$ if the $i$th…
The structure of the hadron spectrum is discussed in connection with the main phenomena of nonperturbative QCD: confinement and chiral symmetry breaking (CSB). For the higher part of the spectrum ($M \ge 2 GeV$) spin and chiral effects are…
We investigate the statistical properties of the complexness parameter which characterizes uniquely complexness (biorthogonality) of resonance eigenstates of open chaotic systems. Specifying to the regime of isolated resonances, we apply…
We consider operator-valued polynomials in Gaussian Unitary Ensemble random matrices and we show that its $L^p$-norm can be upper bounded, up to an asymptotically small error, by the operator norm of the same polynomial evaluated in free…
We study the inhomogeneous random graphs in the subcritical case. We derive an exact formula for the size of the largest connected component scaled to $\log n$ where $n$ is the size of the graph. This generalizes the recent result for the…
The collection of $d \times N$ complex matrices with prescribed column norms and prescribed (nonzero) singular values forms a compact algebraic variety, which we refer to as a frame space. Elements of frame spaces -- i.e., frames -- are…
If we pick $n$ random points uniformly in $[0,1]^d$ and connect each point to its $k-$nearest neighbors, then it is well known that there exists a giant connected component with high probability. We prove that in $[0,1]^d$ it suffices to…
We investigate the giant component formed via high-dimensional paths in the multi-parameter random simplicial complex (MRSC) model. For a $d$-dimensional simplicial complex, we define $d$-dimensional connectivity through incidence between…
We introduce a complex-plane generalization of the consecutive level-spacing distribution, used to distinguish regular from chaotic quantum spectra. Our approach features the distribution of complex-valued ratios between nearest- and…
We consider quantum systems with a chaotic classical limit that depend on an external parameter, and study correlations between the spectra at different parameter values. In particular, we consider the parametric spectral form factor…
Standard approaches to probabilistic reasoning require that one possesses an explicit model of the distribution in question. But, the empirical learning of models of probability distributions from partial observations is a problem for which…