Related papers: Uniform estimates of nonlinear spectral gaps

Given a set $A$ of $n$ points (vertices) in general position in the plane, the \emph{complete geometric graph} $K_n[A]$ consists of all $\binom{n}{2}$ segments (edges) between the elements of $A$. It is known that the edge set of every…

Given feasible strongly regular graph parameters $(v,k,\lambda,\mu)$ and a non-negative integer $d$, we determine upper and lower bounds on the order of a $d$-regular induced subgraph of any strongly regular graph with parameters…

By rearrangements of waveguide arrays with gain and losses one can simulate transformations among parity-time (PT-) symmetric systems not affecting their pure real linear spectra. Subject to such transformations, however, the nonlinear…

In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on $[n]$ with $m$ edges, whenever $n$ and the nullity $m-n+1$ tend to infinity. Asymptotic formulae for the number of connected $r$-uniform…

We consider problems in which a simple path of fixed length, in an undirected graph, is to be shifted from a start position to a goal position by moves that add an edge to either end of the path and remove an edge from the other end. We…

Let $X$ be an orientable hyperbolic surface of genus $g\geq 2$ with a marked point $o$, and let $\Gamma$ be an orientable hyperbolic surface group isomorphic to $\pi_{1}(X,o)$. Consider the space $\text{Hom}(\Gamma,S_{n})$ which corresponds…

Non-Hermitian systems exhibit diverse graph patterns of energy spectra under open boundary conditions. Here we present an algebraic framework to comprehensively characterize the spectral geometry and graph topology of non-Bloch bands. Using…

In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix. We also apply these bounds to various matrices associated with a graph or a digraph, obtain some new results or known…

We study the richness of the ensemble of graphical structures (i.e., unlabeled graphs) of the one-dimensional random geometric graph model defined by $n$ nodes randomly scattered in $[0,1]$ that connect if they are within the connection…

We give necessary and sufficient conditions for a nonexpansive map on a finite dimensional normed space to have a nonempty, bounded set of fixed points. Among other results we show that if $f : V \rightarrow V$ is a nonexpansive map on a…

We investigate a periodic quantum graph in form of a square lattice with a general self-adjoint coupling at the vertices. We analyze the spectrum, in particular, its high-energy behaviour. Depending on the coupling type, bands and gaps have…

We consider the spectral action within the context of a 4-dimensional manifold with torsion and show that, in the vacuum case, the equations of motion reduce to Einstein's equations, securing the linear stability of the theory. To…

We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…

We show that the diameter D(G_n) of a random labelled connected planar graph with n vertices is equal to n^{1/4+o(1)}, in probability. More precisely there exists a constant c>0 such that the probability that D(G_n) lies in the interval…

In this paper, we present a sharp upper bound for the spectral radius of an $n$-vertex graph without $F$-minor for sufficient large $n$, where $F$ is obtained from the complete graph $K_r$ by deleting disjointed paths. Furthermore, the…

We study criteria which ensure that Gibbs states (often also called generalized vacuum states) on distance-regular graphs are positive. Our main criterion assumes that the graph can be embedded into a growing family of distance-regular…

We study how eigenvectors of random regular graphs behave when projected onto fixed directions. For a random $d$-regular graph with $N$ vertices, where the degree $d$ grows slowly with $N$, we prove that these projections follow…

Traditional graph centrality measures effectively quantify node importance but fail to capture the structural uniqueness of multi-scale connectivity patterns -- critical for understanding network resilience and function. This paper…

In this paper, we study the connectivity of a one-dimensional soft random geometric graph (RGG). The graph is generated by placing points at random on a bounded line segment and connecting pairs of points with a probability that depends on…

One-dimensional geometric random graphs are constructed by distributing $n$ nodes uniformly and independently on a unit interval and then assigning an undirected edge between any two nodes that have a distance at most $r_n$. These graphs…