Related papers: Uniform estimates of nonlinear spectral gaps
The spectrum of a graph is closely related to many graph parameters. In particular, the spectral gap of a regular graph which is the difference between its valency and second eigenvalue, is widely seen an algebraic measure of connectivity…
We study the problem of passive imaging through convolutive channels. A scene is illuminated with an unknown, unstructured source, and the measured response is the convolution of this source with multiple channel responses, each of which is…
The present work describes the asymptotic local shape of a graph drawn uniformly at random from all connected simple planar graphs with n labelled vertices. We establish a novel uniform infinite planar graph (UIPG) as quenched limit in the…
In this paper we consider the relation between the spectrum and the number of short cycles in large graphs. Suppose $G_1, G_2, G_3, \ldots$ is a sequence of finite and connected graphs that share a common universal cover $T$ and such that…
We consider the random geometric graph on $n$ vertices drawn uniformly from a $d$--dimensional sphere. We focus on the sparse regime, when the expected degree is constant independent of $d$ and $n$. We show that, when $d$ is larger than $n$…
We are interested in the general question: to what extent are the spectral properties of a graph connected to the distance function? Our motivation is a concrete example of this question that is due to Steinerberger. We provide some…
Consider directed polymers in a random environment on the complete graph of size $N$. This model can be formulated as a product of i.i.d. $N\times N$ random matrices and its large time asymptotics is captured by Lyapunov exponents and the…
We present a general formulation to calculate the dynamic optical conductivity, beyond the linear response regime, of any electronic system whose quasiparticle dispersion is described by a two band model. Our phenomenological model is based…
In this paper we apply results on the asymptotic zero distribution of the Laguerre polynomials to discuss generalizations of the standard large $n$ limit in the non-hermitian Penner matrix model. In these generalizations $g_n n\to t$, but…
We consider exact and asymptotic solutions of the stationary cubic nonlinear Schr\"odinger equation (NLSE) on metric graphs. We focus on some basic example graphs. The asymptotic solutions are obtained using the canonical perturbation…
We consider the open string vacuum amplitude determining the interaction between a stack of N D3-branes and a single probe brane. When using light cone gauge, it is clear that the sum of planar diagrams (relevant in the large-N limit) is…
Let $\FF$ be an arbitrary field and $(\bm{G}_{n,d/n})_n$ be a sequence of sparse weighted Erd\H{o}s-R\'enyi random graphs on $n$ vertices with edge probability $d/n$, where weights from $\FF \setminus\{0\}$ are assigned to the edges…
We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…
In the context of nonparametric regression, we study conditions under which the consistency (and rates of convergence) of estimators built from discretely sampled curves can be derived from the consistency of estimators based on the…
For a fixed positive integer $t$, we consider the graph colouring problem in which edges at distance at most $t$ are given distinct colours. We obtain sharp lower bounds for the distance-$t$ chromatic index, the least number of colours…
Given a regular (connected) graph $\Gamma=(X,E)$ with adjacency matrix $A$, $d+1$ distinct eigenvalues, and diameter $D$, we give a characterization of when its distance matrix $A_D$ is a polynomial in $A$, in terms of the adjacency…
We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…
A special type of geometric situation in ensembles of non-intersecting paths occurs when the non-intersecting trajectories are required to be nonnegative so that the limit shape becomes tangential to the hard-edge $0$. The local fluctuation…
For any $\alpha\in (0,1)$ and any $n^{\alpha}\leq d\leq n/2$, we show that $\lambda(G)\leq C_\alpha \sqrt{d}$ with probability at least $1-\frac{1}{n}$, where $G$ is the uniform random $d$-regular graph on $n$ vertices, $\lambda(G)$ denotes…
Consider the matrix $A_{\mathcal{G}}$ chosen uniformly at random from the finite set of all $N$-dimensional matrices of zero main-diagonal and binary entries, having each row and column of $A_{\mathcal{G}}$ sum to $d$. That is, the…