相关论文: Kron reduction of nonlinear networks

We connect Braided Ribbon Networks to the states of loop quantum gravity. Using this connection we present the reduced link as an invariant which captures information from the embedding of the spin-networks. We also present a means of…

Directed graphs are widely used in modelling of nonsymmetric relations in various sciences and engineering disciplines. We discuss invariants of strongly connected directed graphs - minimal number of vertices or edges necessary to remove to…

Network Diversion is a graph problem that has been extensively studied in both the network-analysis and operations-research communities as a measure of how robust a network is against adversarial disruption. This problem is especially well…

The interference imposes a significant negative impact on the performance of wireless networks. With the continuous deployment of larger and more sophisticated wireless networks, reducing interference in such networks is quickly being…

Can one reduce the size of a graph without significantly altering its basic properties? The graph reduction problem is hereby approached from the perspective of restricted spectral approximation, a modification of the spectral similarity…

We present a systematic and detailed study of the robustness of directed networks under random and targeted removal of links. We work with a set of network models of random and scale free type, generated with specific features of clustering…

We consider linear elimination of variables in steady state equations of a chemical reaction network. Particular subsets of variables corresponding to sets of so-called reactant-noninteracting species, are introduced. The steady state…

The problem of achieving consensus in a network of connected systems arises in many science and engineering applications. In contrast to previous works, we focus on the system reactivity, i.e., the initial amplification of the norm of the…

We propose to study transformations on graphs, and more generally structures, by looking at how the cut-rank (as introduced by Oum) of subsets is affected when going from the input structure to the output structure. We consider…

Random graph models are playing an increasingly important role in various fields ranging from social networks, telecommunication systems, to physiologic and biological networks. Within this landscape, the random Kronecker graph model,…

As graph data becomes more ubiquitous, the need for robust inferential graph algorithms to operate in these complex data domains is crucial. In many cases of interest, inference is further complicated by the presence of adversarial data…

Barrett et al studied resistance labels of electrical circuits whose underlying graphs when embedded in the Cartesian plane has the form of an $n$-grid, $n$ rows of upright triangles. Proofs in Barrett introduced a row-reduction algorithm…

The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the…

Nonlinear spintronics, which combines nonlinear dynamics and spintronics, opens a new route for controlling spins and spin dynamics beyond conventional spintronics based on linear responses. Strongly correlated electron systems, which can…

Reconstructing the states of the nodes of a dynamical network is a problem of fundamental importance in the study of neuronal and genetic networks. An underlying related problem is that of observability, i.e., identifying the conditions…

We study the robustness of complex networks subject to edge removal. Several network models and removing strategies are simulated. Rather than the existence of the giant component, we use total connectedness as the criterion of breakdown.…

Networks are a useful representation for data on connections between units of interests, but the observed connections are often noisy and/or include missing values. One common approach to network analysis is to treat the network as a…

A k-connected graph such that deleting any edge / deleting any vertex / contracting any edge results in a graph which is not k-connected is called minimally / critically / contraction-critically k-connected. These three classes play a…

This paper studies the relation between node deletion and algebraic connectivity for graphs with a hierarchical structure represented by layers. To capture this structure, the concepts of layered path graph and its (sub)graph cone are…

Kohn's theory of Drude conductivity, established in a many-body framework, addresses even systems with disorder and correlation, besides the ordinary band metals (i.e. crystalline systems of independent electrons). Kohn's theory is here…