相关论文: The edge switch transformation in microwave networ…
Spectral embedding finds vector representations of the nodes of a network, based on the eigenvectors of a properly constructed matrix, and has found applications throughout science and technology. Many networks are multipartite, meaning…
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…
Diffraction patterns of electrons are believed to resemble those of electromagnetic waves (EMW). I performed a series of experiments invoked to show that the periodicity of peaks in the diffraction diagram of electrons is concerned with the…
Following an idea by Joyner et al. [EPL, 107 (2014) 50004] a microwave graph with antiunitary symmetry T obeying T^2=-1 has been realized. The Kramers doublets expected for such systems have been clearly identified and could be lifted by a…
We study experimentation under endogenous network interference. Interference patterns are mediated by an endogenous graph, where edges can be formed or eliminated as a result of treatment. We show that conventional estimators are biased in…
Spectral networks derived from multivariate time series data arise in many domains, from brain science to Earth science. Often, it is of interest to study how these networks change under different conditions. For instance, to better…
We consider the inverse problem for countable, locally finite electrical networks with edge weights in an arbitrary field. The electrical inverse problem seeks to determine the weights of the edges knowing only the potential and current…
The level of systemic risk in economic and financial systems is strongly determined by the structure of the underlying networks of interdependent entities that can propagate shocks and stresses. Since changes in network structure imply…
Spectral statistics of weakly-disordered triangular graphene flakes with zigzag edges are revisited. Earlier, we have found numerically that such systems may shown spectral fluctuations of GUE, signalling the time-reversal symmetry breaking…
When an electromagnetic (EM) wave is propagating in a medium whose properties are varied abruptly in time, the wave experiences refractions and reflections known as "time-refractions" and "time-reflections", both manifesting spectral…
Symmetry reduced three-disk and five-disk systems are studied in a microwave setup. Using harmonic inversion the distribution of the imaginary parts of the resonances is determined. With increasing opening of the systems, a spectral gap is…
This paper considers the graph signal processing problem of anomaly detection in time series of graphs. We examine two related, complementary inference tasks: the detection of anomalous graphs within a time series, and the detection of…
We study the spectrum of a random multigraph with a degree sequence ${\bf D}_n=(D_i)_{i=1}^n$ and average degree $1 \ll \omega_n \ll n$, generated by the configuration model, and also the spectrum of the analogous random simple graph. We…
Quantum graphs and their experimental counterparts, microwave networks, are ideally suited to study the spectral statistics of chaotic systems. The graph spectrum is obtained from the zeros of a secular determinant derived from energy and…
Peaks and troughs in the subsynchronous impedance spectrum of a distribution feeder may be a useful indication of oscillation risk, or more importantly lack of oscillation risk, if inverter-based resource (IBR) deployments are increased on…
One of the most important characteristics of a quantum graph is the average density of resonances, $\rho = \frac{\mathcal{L}}{\pi}$, where $\mathcal{L}$ denotes the length of the graph. This is a very robust measure. It does not depend on…
The way in which different types of dynamics unfold in complex networks is intrinsically related to the propagation of activation along nodes, which is strongly affected by the network connectivity. In this work we investigate to which…
We extend the N-Intertwined Mean-Field Approximation (NIMFA) for the Susceptible-Infectious-Susceptible (SIS) epidemiological process to time-varying networks. Processes on time-varying networks are often analysed under the assumption that…
In this paper we present a general procedure that allows for the reduction or expansion of any network (considered as a weighted graph). This procedure maintains the spectrum of the network's adjacency matrix up to a set of eigenvalues…
We consider sparse inhomogeneous Erd\H{o}s-R\'enyi random graph ensembles where edges are connected independently with probability $p_{ij}$. We assume that $p_{ij}= \varepsilon_N f(w_i, w_j)$ where $(w_i)_{i\ge 1}$ is a sequence of…