相关论文: Nodal domains on quantum graphs

In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree…

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…

We show that using the concept of the two-dimensional level number N_{|} one can experimentally study of the nodal domains in a three-dimensional (3D) microwave chaotic rough billiard with the translational symmetry. Nodal domains are…

Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…

In this paper, we present a novel convolution theorem which encompasses the well known convolution theorem in (graph) signal processing as well as the one related to time-varying filters. Specifically, we show how a node-wise convolution…

We introduce the concept of boundaries of a complex network as the set of nodes at distance larger than the mean distance from a given node in the network. We study the statistical properties of the boundaries nodes of complex networks. We…

Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…

We describe some basic tools in the spectral theory of Schr\"odinger operator on metric graphs (also known as "quantum graph") by studying in detail some basic examples. The exposition is kept as elementary and accessible as possible. In…

In this paper we analyze the behavior of solutions of the Neumann problem posed in a thin domain of the type $R^\epsilon = \{(x_1,x_2) \in \R^2 \; | \; x_1 \in (0,1), \, - \, \epsilon \, b(x_1) < x_2 < \epsilon \, G(x_1,…

Temporal networks, i.e., networks in which the interactions among a set of elementary units change over time, can be modelled in terms of time-varying graphs, which are time-ordered sequences of graphs over a set of nodes. In such graphs,…

Let $(M,g)$ be a smooth compact Riemannian surface with no boundary. Given a smooth vector field $V$ with finitely many zeroes on $M$, we study the distribution of the number of tangencies to $V$ of the nodal components of random…

Using the spectral multiplicities of the standard torus, we endow the Laplace eigenspaces with Gaussian probability measures. This induces a notion of random Gaussian Laplace eigenfunctions on the torus ("arithmetic random waves"). We study…

We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…

In this paper we study a random graph with $N$ nodes, where node $j$ has degree $D_j$ and $\{D_j\}_{j=1}^N$ are i.i.d. with $\prob(D_j\leq x)=F(x)$. We assume that $1-F(x)\leq c x^{-\tau+1}$ for some $\tau>3$ and some constant $c>0$. This…

Exchangeable random graphs, which include some of the most widely studied network models, have emerged as the mainstay of statistical network analysis in recent years. Graphons, which are the central objects in graph limit theory, provide a…

Based on a large dataset containing thousands of real-world networks ranging from genetic, protein interaction, and metabolic networks to brain, language, ecology, and social networks we search for defining structural measures of the…

We are concerned with the analysis of a mean field type equation and its linearization, which is a nonlocal operator, for which we estimate the number of nodal domains for the radial eigenfunctions and the related uniqueness properties.

We investigate the measure of nodal sets for Robin and Neumann eigenfunctions in the domain and on the boundary of the domain. A polynomial upper bound for the interior nodal sets is obtained for Robin eigenfunctions in the smooth domain.…

We present experimental and numerical results for the long-range fluctuation properties in the spectra of quantum graphs with chaotic classical dynamics and preserved time-reversal invariance. Such systems are generally believed to provide…

In this paper we propose a domain adaptation algorithm designed for graph domains. Given a source graph with many labeled nodes and a target graph with few or no labeled nodes, we aim to estimate the target labels by making use of the…