相关论文: Average resistance of toroidal graphs

Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…

This paper deals with three graph characteristics related to graph covering named the (vertex, edge, and total, resp.) H-irregularity strength of a graph G admitting H-covering. Those are the minimum values of positive integer k such that G…

In this paper, we propose a perturbation framework to measure the robustness of graph properties. Although there are already perturbation methods proposed to tackle this problem, they are limited by the fact that the strength of the…

For a connected graph $G$, its resistance distance matrix is denoted by $R(G)$. A graph is called resistance regular if all the row (or column) sums of $R(G)$ are equal. We provide a necessary and sufficient condition for a simple connected…

In this paper we show that the $d$-dimensional algebraic connectivity of an arbitrary graph $G$ is bounded above by its $1$-dimensional algebraic connectivity, i.e., $a_d(G) \leq a_1(G)$, where $a_1(G)$ corresponds the well-studied second…

In this work, we study the equivalence of various robustness properties of toric ideals of weighted oriented graphs. For any weighted oriented graph $D$, if its toric ideal $I_D$ is generalized robust (or weakly robust), then we show that…

In graph signal processing, data samples are associated to vertices on a graph, while edge weights represent similarities between those samples. We propose a convex optimization problem to learn sparse well connected graphs from data. We…

We consider random Gaussian eigenfunctions of the Laplacian on the standard torus, and investigate the number of nodal intersections against a line segment. The expected intersection number, against any smooth curve, is universally…

We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…

Let $G$ be a strongly connected and balanced directed graph. The Laplacian matrix of $G$ is then the matrix (not necessarily symmetric) $L:=D-A$, where $A$ is the adjacency matrix of $G$ and $D$ is the diagonal matrix such that the row sums…

Considerable progress has recently been made in the development of techniques to exactly determine two-point resistances in networks of various topologies. In particular, two types of method have emerged. One is based on potentials and the…

We demonstrate that topological constraints do not only dictate the geometric part of the superfluid stiffness, but can also govern the total superfluid stiffness. By introducing a general adiabatic approach for superfluid responses, we…

The performance of distributed averaging depends heavily on the underlying topology. In various fields, including compressed sensing, multi-party computation, and abstract graph theory, graphs may be expected to be free of short cycles,…

For an increasing monotone graph property $\mP$ the \emph{local resilience} of a graph $G$ with respect to $\mP$ is the minimal $r$ for which there exists of a subgraph $H\subseteq G$ with all degrees at most $r$ such that the removal of…

We investigate Gaussian Laplacian eigenfunctions (Arithmetic Random Waves) on the three-dimensional standard flat torus, in particular the asymptotic distribution of the nodal intersection length against a fixed regular reference surface.…

Let $r(u,v)$ be the resistance distance between two vertices $u, v$ of a simple graph $G$, which is the effective resistance between the vertices in the corresponding electrical network constructed from $G$ by replacing each edge of $G$…

Given a finite, simple, connected graph $G=(V,E)$ with $|V|=n$, we consider the associated graph Laplacian matrix $L = D - A$ with eigenvalues $0 = \lambda_1 < \lambda_2 \leq \dots \leq \lambda_n$. One can also consider the same graph…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree…

The logarithm of the number of Eulerian orientations, normalised by the number of vertices, is known as the residual entropy in studies of ice-type models on graphs. The spanning tree entropy depends similarly on the number of spanning…