相关论文: Average resistance of toroidal graphs
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to…
This paper extends the definitions of effective resistance and effective conductance to characterize the overall relation (positive coupling or antagonism) between any two disjoint sets of nodes in a signed graph. It generalizes the…
We introduce and study a generalization of conformal rigidity for graphs. A graph is $k$-conformally rigid if the uniform edge weights simultaneously maximize the sum of the $k$ smallest nontrivial Laplacian eigenvalues and minimize the sum…
We investigate the concept of effective resistance in connection graphs, expanding its traditional application from undirected graphs. We propose a robust definition of effective resistance in connection graphs by focusing on the duality of…
Cascading failures are one of the main reasons for blackouts in electrical power grids. Stable power supply requires a robust design of the power grid topology. Currently, the impact of the grid structure on the grid robustness is mainly…
It has been recently proposed that the natural connectivity can be used to characterize efficiently the robustness of complex networks. The natural connectivity quantifies the redundancy of alternative routes in the network by evaluating…
Effective resistance (ER) is an attractive way to interrogate the structure of graphs. It is an alternative to computing the eigenvectors of the graph Laplacian. One attractive application of ER is to point clouds, i.e. graphs whose…
Local changes in the topology of electricity grids can cause overloads far away from the disturbance, making the prediction of the robustness against changes in the topology - for example caused by power outages or grid extensions - a…
Given an increasing graph property $\mathcal{P}$, a graph $G$ is $\alpha$-resilient with respect to $\mathcal{P}$ if, for every spanning subgraph $H\subseteq G$ where each vertex keeps more than a $(1-\alpha)$-proportion of its neighbours,…
Cascading failures are one of the main reasons for blackouts in power transmission grids. The topology of a power grid, together with its operative state determine, for the most part, the robustness of the power grid against cascading…
As a result of the interaction of rapid development and competition in information technologies, the reliability of a network and how solid it remains is important. It is called the hat vulnerability of the network to measure the endurance…
The intrinsic resistance peak (ridge) structures were recently found to appear in the carrier density dependence plot of the resistance of the AB-stacked multilayer graphene with even numbers of layers.The ridges are due to topological…
Effective resistance is an important metric that measures the similarity of two vertices in a graph. It has found applications in graph clustering, recommendation systems and network reliability, among others. In spite of the importance of…
The metric dimension (MD) of a graph is a combinatorial notion capturing the minimum number of landmark nodes needed to distinguish every pair of nodes in the graph based on graph distance. We study how much the MD can increase if we add a…
Consider a rooted infinite Galton-Watson tree with mean offspring number $m>1$, and a collection of i.i.d. positive random variables $\xi_e$ indexed by all the edges in the tree. We assign the resistance $m^d \xi_e$ to each edge $e$ at…
The \emph{resistance matrix} of a simple connected graph $G$ is denoted by $R$, and is defined by $R =(r_{ij})$, where $r_{ij}$ is the resistance distance between the vertices $i$ and $j$ of $G$. In this paper, we consider the resistance…
Adversarial attacks to graph analytics are gaining increased attention. To date, two lines of countermeasures have been proposed to resist various graph adversarial attacks from the perspectives of either graph per se or graph neural…
A bar-joint framework $(G,p)$ in Euclidean $d$-space is rigid if the only edge-length-preserving continuous motions arise from isometries of $\mathbb{R}^d$. In the generic case, rigidity is determined by the generic $d$-dimensional rigidity…
This article discusses a geometric perspective on the well-known fact in graph theory that the effective resistance is a metric on the nodes of a graph. The classical proofs of this fact make use of ideas from electrical circuits or random…
Cascading failures are the typical reasons of black- outs in power grids. The grid topology plays an important role in determining the dynamics of cascading failures in power grids. Measures for vulnerability analysis are crucial to assure…