Related papers: Resistance values under transformations in regular…
We investigate the behavior of two dimensional resistor networks, with finite sizes and different kinds (rectangular, hexagonal, and triangular) of lattice geometry. We construct the network by having a network-element repeat itself $L_x$…
We consider a class of strongly edge-reinforced random walks, where the corresponding reinforcement weight function is nondecreasing. It is known, from Limic and Tarr\`{e}s [Ann. Probab. (2007), to appear], that the attracting edge emerges…
We introduce and investigate a new notion of resilience in graph spanners. Let $S$ be a spanner of a graph $G$. Roughly speaking, we say that a spanner $S$ is resilient if all its point-to-point distances are resilient to edge failures.…
Consider an electrical circuit $G$ each directed edge $e$ of which is a semiconductor with a monomial conductance function $y_e^* = f_e(y_e) = y_e^s / \mu_e^r$ if $y_e \geq 0$ and $y_e^* = 0$ if $y_e \leq 0$. Here $e$ is a directed edge,…
We applied tensor network contraction algorithms to compute the hard-core lattice gas model, i.e., the enumeration of independent sets on grid graphs. We observed the influence of surface effect and parity effect on the enumeration (and…
To quantify the fundamental evolution of time-varying networks, and detect abnormal behavior, one needs a notion of temporal difference that captures significant organizational changes between two successive instants. In this work, we…
The large size of multiscale, distribution and transmission, power grids hinder fast system-wide estimation and real-time control and optimization of operations. This paper studies graph reduction methods of power grids that are favorable…
We study the sub-grid scale characteristics of a vorticity-transport-based approach for large-eddy simulations. In particular, we consider a multi-dimensional upwind scheme for the vorticity transport equations and establish its properties…
This paper investigates the conformal isometry hypothesis as a potential explanation for the hexagonal periodic patterns in grid cell response maps. We posit that grid cell activities form a high-dimensional vector in neural space, encoding…
In certain instances an electric network transforms in natural ways by the addition or removal of an edge. This can have interesting consequences for random walks, in light of the known relationships between electric resistance and random…
Grid cells, discovered more than a decade ago [5], are neurons in the brain of mammals that fire when the animal is located near certain specific points in its familiar terrain. Intriguingly, these points form, for a single cell, a…
We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…
Effective resistance, which originates from the field of circuits analysis, is an important graph distance in spectral graph theory. It has found numerous applications in various areas, such as graph data mining, spectral graph…
A graph $H$ is an \emph{isometric} subgraph of $G$ if $d_H(u,v)= d_G(u,v)$, for every pair~$u,v\in V(H)$. A graph is \emph{distance preserving} if it has an isometric subgraph of every possible order. A graph is \emph{sequentially distance…
This article introduces and studies a new class of graphs motivated by discrete curvature. We call a graph resistance nonnegative if there exists a distribution on its spanning trees such that every vertex has expected degree at most two in…
The notion of resistance distance, introduced by Klein and Randi\'c, has become a fundamental concept in spectral graph theory and network analysis, as it captures both the structural and electrical properties of a graph. The associated…
In this paper, we study exponential random graph models subject to certain constraints. We obtain some general results about the asymptotic structure of the model. We show that there exists non-trivial regions in the phase plane where the…
We study cumulants of numbers of $q$-step walks on Erd\"os-R\'enyi-type random graphs of long-range percolation radius model in the limit when the number of vertices $N$, concentration $c$, and the interaction radius $R$ tend to infinity.…
Graph neural networks are experiencing a surge of popularity within the machine learning community due to their ability to adapt to non-Euclidean domains and instil inductive biases. Despite this, their stability, i.e., their robustness to…
We analyze the asymptotic number and typical structure of claw-free graphs at constant edge densities. The first of our main results is a formula for the asymptotics of the logarithm of the number of claw-free graphs of edge density $\gamma…