Related papers: Nodal Statistics On Quantum Graphs
In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
This is a survey for the JDG 50th Anniversary conference of recent results on nodal sets of eigenfunctions of the Laplacian on a compact Riemannian manifold. In part the techniques are `local', i.e. only assuming eigenfunctions are defined…
In this paper, we present some novel and intriguing findings on the geometric structures of Laplacian eigenfunctions and their deep relationship to the quantitative behaviours of the eigenfunctions in two dimensions. We introduce a new…
We are interested in the distribution of the number of faces across all the $2-$cell embeddings of a graph, which is equivalent to the distribution of genus by Euler's formula. In order to study this distribution, we consider the local…
The Neumann points of an eigenfunction $f$ on a quantum (metric) graph are the interior zeros of $f'$. The Neumann domains of $f$ are the sub-graphs bounded by the Neumann points. Neumann points and Neumann domains are the counterparts of…
Directed possibly cyclic graphs have been proposed by Didelez (2000) and Nodelmann et al. (2002) in order to represent the dynamic dependencies among stochastic processes. These dependencies are based on a generalization of…
In this paper we generalise the results on eigenvalues and eigenvectors of unnormalized (combinatorial) Laplacian of two-dimensional grid presented by Edwards:2013 first to a grid graph of any dimension, and second also to other types of…
In one dimension, the theory of the $G$-normal distribution is well-developed, and many results from the classical setting have a nonlinear counterpart. Significant challenges remain in multiple dimensions, and some of what has already been…
We develop a topological lens on relational schema design by encoding functional dependencies (FDs) as simplices of an abstract simplicial complex. This dependency complex exposes multi-attribute interactions and enables homological…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
Ahanjideh, Akbari, Fakharan and Trevisan proposed a conjecture in [Linear Algebra Appl. 632 (2022) 1--14] on the distribution of the Laplacian eigenvalues of graphs: for any connected graph of order $n$ with diameter $d\ge 2$ that is not a…
We obtain lower bounds for the number of nodal domains of Hecke eigenfunctions on the sphere. Assuming the generalized Lindelof hypothesis we prove that the number of nodal domains of any Hecke eigenfunction grows with the eigenvalue of the…
We study how the problem of observables is fully resolved for background independent theories defined on finite graphs. We argue the correct analogue of coordinate independence is the invariance under changes of graph labels, a kind of…
Consider a random geometric 2-dimensional simplicial complex $X$ sampled as follows: first, sample $n$ vectors $\boldsymbol{u_1},\ldots,\boldsymbol{u_n}$ uniformly at random on $\mathbb{S}^{d-1}$; then, for each triple $i,j,k \in [n]$, add…
This paper continues the study of local detectability and observability requirements on components of distributed observers networks to ensure detectability properties of the network. First, we present a sketch of an elementary proof of the…
A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…
We obtain the limiting distribution of the nodal area of random Gaussian Laplace eigenfunctions on $\mathbb{T}^3= \mathbb{R}^3/ \mathbb{Z}^3$ ($3$-dimensional 'arithmetic random waves'). We prove that, as the multiplicity of the eigenspace…
We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…
In this paper, a new class of hemivariational inequalities is introduced. It concerns Laplace operator on locally finite graphs together with multivalued nonmonotone nonlinearities expressed in terms of Clarke's subdifferential. First of…