Related papers: Asymptotic expansion of the multi-orientable rando…
We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…
We consider maximum rooted tree extension counts in random graphs, i.e., we consider M_n = \max_v X_v where X_v counts the number of copies of a given tree in G_{n,p} rooted at vertex v. We determine the asymptotics of M_n when the random…
We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…
We prove two estimates for the expectation of the exponential of a complex function of a random permutation or subset. Using this theory, we find asymptotic expressions for the expected number of copies and induced copies of a given graph…
We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal…
We consider time-inhomogeneous ODEs whose parameters are governed by an underlying ergodic Markov process. When this underlying process is accelerated by a factor $\varepsilon^{-1}$, an averaging phenomenon occurs and the solution of the…
Let ${X}_{k}=(x_{k1}, \cdots, x_{kp})', k=1,\cdots,n$, be a random sample of size $n$ coming from a $p$-dimensional population. For a fixed integer $m\geq 2$, consider a hypercubic random tensor $\mathbf{{T}}$ of $m$-th order and rank $n$…
Voiculescu's notion of asymptotic free independence applies to a wide range of random matrices, including those that are independent and unitarily invariant. In this work, we generalize this notion by considering random matrices with a…
In Gurau and Keppler 2022 (arXiv:2207.01993), a relation between orthogonal and symplectic tensor models with quartic interactions was proven. In this paper, we provide an alternative proof that extends to polynomial interactions of…
We study diffusion-type equations supported on structures that are randomly varying in time. After settling the issue of well-posedness, we focus on the asymptotic behavior of solutions: our main result gives sufficient conditions for…
Tensor models generalize matrix models and generate colored triangulations of pseudo-manifolds in dimensions $D\geq 3$. The free energies of some models have been recently shown to admit a double scaling limit, i.e. large tensor size $N$…
We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…
Observables in random tensor theory are polynomials in the entries of a tensor of rank $d$ which are invariant under $U(N)^d$. It is notoriously difficult to evaluate the expectations of such polynomials, even in the Gaussian distribution.…
This work considers the notion of random tensors and reviews some fundamental concepts in statistics when applied to a tensor based data or signal. In several engineering fields such as Communications, Signal Processing, Machine learning,…
Large real-life complex networks are often modeled by various random graph constructions and hundreds of further references therein. In many cases it is not at all clear how the modeling strength of differently generated random graph model…
Random growth models are fundamental objects in modern probability theory, have given rise to new mathematics, and have numerous applications, including tumor growth and fluid flow in porous media. In this article, we introduce some of the…
Tensor models are generalization of matrix models, and are studied as models of quantum gravity. It is shown that the symmetry of the rank-three tensor models is generated by a hierarchy of n-ary algebras starting from the usual commutator,…
The asymptotic expansion of the massive scalar field propagator on a n-dimensional lattice is derived. The method used is based on the evaluation of the asymptotic expansion of the modified Bessel function $I_{\nu}(\nu^{2} \beta)$ as the…
This Master's thesis examines the properties of large degree vertices in random recursive directed acyclic graphs (RRDAGs), a generalization of the well-studied random recursive tree (RRT) model. Using a novel adaptation of Kingman's…
The parametric complexity is the key quantity in the minimum description length (MDL) approach to statistical model selection. Rissanen and others have shown that the parametric complexity of a statistical model approaches a simple function…