Related papers: Spectrum for first-order properties of random hype…
We propose the following model of a random graph on n vertices. Let F be a distribution in R_+^{n(n-1)/2} with a coordinate for every pair i$ with 1 \le i,j \le n. Then G_{F,p} is the distribution on graphs with n vertices obtained by…
This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…
In this paper we obtain bounds for the extreme entries of the principal eigenvector of hypergraphs; these bounds are computed using the spectral radius and some classical parameters such as maximum and minimum degrees. We also study…
Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
Let $M_n$ be a class of symmetric sparse random matrices, with independent entries $M_{ij} = \delta_{ij} \xi_{ij}$ for $i \leq j$. $\delta_{ij}$ are i.i.d. Bernoulli random variables taking the value $1$ with probability $p \geq…
Let A be a self-adjoint operator acting on a Hilbert space. The notion of second order spectrum of A relative to a given finite-dimensional subspace L has been studied recently in connection with the phenomenon of spectral pollution in the…
We carry the index theory for manifolds with boundary of B\"ar and Ballmann over to first order differential operators on metric graphs. This approach results in a short proof for the index of such operators. Then the self-adjoint…
Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…
Second order nonlinear eigenvalue problems are considered for which the spectrum is an interval. The boundary conditions are of Robin and Dirichlet type. The shape and the number of solutions are discussed by means of a phase plane…
We give the site-theoretic account of the spectral construction as first introduced by Coste. We provide a detailed examination of the geometric properties of the spectrum, in particular what classes of topoi it produces when applied to the…
We consider a non-relativistic quantum particle interacting with a singular potential supported by two parallel straight lines in the plane. We locate the essential spectrum under the hypothesis that the interaction asymptotically…
In this paper, we prove the first-order convergence law for the uniform attachment random graph with almost all vertices having the same degree. In the considered model, vertices and edges are introduced recursively: at time $m+1$ we start…
We analyze the spectral properties of the high-dimensional random geometric graph $G(n, d, p)$, formed by sampling $n$ i.i.d vectors $\{v_i\}_{i=1}^{n}$ uniformly on a $d$-dimensional unit sphere and connecting each pair $\{i,j\}$ whenever…
Objective: To characterize the irregularity of the spectrum of a signal, spectral entropy is a widely adopted measure. However, such a metric is invariant under any permutation of the estimations of the powers of individual frequency…
In this work, we develop a unified framework for establishing sharp threshold results for various Ramsey properties. To achieve this, we view such properties as non-colourability of auxiliary hypergraphs. Our main technical result gives…
A pattern of a sequence is a sequence of integer indices with each index describing the order of first occurrence of the respective symbol in the original sequence. In a recent paper, tight general bounds on the block entropy of patterns of…
We study upper bounds on Weierstrass primary factors and discuss their application in spectral theory. One of the main aims of this note is to draw attention to works of Blumenthal and Denjoy from 1910, but we also provide some new results…
The methods of non-homogeneous random graphs calibration are developed for social networks simulation. The graphs are calibrated by the degree distributions of the vertices and the edges. The mathematical foundation of the methods is formed…
For slowly evolving, discrete-time-dependent systems of difference equations (iterated maps), we believe the simplest means of demonstrating the validity of the averaging method at first order is by way of a lemma that we call Besjes'…