Related papers: Calculating two-point resistances in distance-regu…
Zero-one biochemical reaction networks play key roles in cell signalling such as signalling pathways regulated by protein phosphorylation. Multistability of reaction networks is a crucial dynamics feature enabling decision-making in cells.…
A resistance network is a connected graph $(G,c)$. The conductance function $c_{xy}$ weights the edges, which are then interpreted as conductors of possibly varying strengths. The Dirichlet energy form $\mathcal E$ produces a Hilbert space…
The goal of this note is to improve on the currently available bounds for Stieltjes constants using the method of steepest descent applied by Coffey and Knessl to approximate Stieltjes constants.
Let $G$ be a connected graph with $V(G)=\{1,\dotsc,n\}$. Then the resistance distance between any two vertices $i$ and $j$ is given by $r_{ij}:=l_{ii}^{\dag} + l_{jj}^{\dag}-2 l_{ij}^{\dag}$, where $l_{ij}^\dag$ is the $(i,j)^{\rm th}$…
Effective resistances are ubiquitous in graph algorithms and network analysis. In this work, we study sublinear time algorithms to approximate the effective resistance of an adjacent pair $s$ and $t$. We consider the classical adjacency…
An exact solution is presented for the resistance of an orifice in a 2D membrane separating two infinitely large conductive reservoirs and obstructed by an infinitely long cylinder. The solution is obtained by constructing a curvilinear…
Networked systems that occur in various domains, such as the power grid, the brain, and opinion networks, are known to obey conservation laws. For instance, electric networks obey Kirchoff's laws, and social networks display opinion…
The verification problem for neural networks is verifying whether a neural network will suffer from adversarial samples, or approximating the maximal allowed scale of adversarial perturbation that can be endured. While most prior work…
This paper investigates a change-point estimation problem in the context of high-dimensional Markov Random Field models. Change-points represent a key feature in many dynamically evolving network structures. The change-point estimate is…
We study a ridge estimator for the high-dimensional two-way fixed effect regression model with a sparse bipartite network. We develop concentration inequalities showing that when the ridge parameters increase as the log of the network size,…
The problem of robustly reconstructing a large number from its erroneous remainders with respect to several moduli, namely the robust remaindering problem, may occur in many applications including phase unwrapping, frequency detection from…
The theory for the onset of spin density wave order in a metal in two dimensions flows to strong coupling, with strong interactions not only at the `hot spots', but on the entire Fermi surface. We advocate the computation of DC transport in…
For a graph $G=(V,E)$, assigning each edge $e\in E$ a weight of a dual number $w(e)=1+\widehat{a}_{e}\varepsilon$, the weighted graph $G^{w}=(V,E,w)$ is called a dual number weighted graph, where $-\widehat{a}_{e}$ can be regarded as the…
We study the critical behavior of various geometrical and transport properties of percolation in 6 dimensions. By employing field theory and renormalization group methods we analyze fluctuation induced logarithmic corrections to scaling up…
An approach by Stephen is used to investigate the critical properties of randomly diluted resistor networks near the percolation threshold by means of renormalized field theory. We reformulate an existing field theory by Harris and…
Steady state is an essential concept in reaction networks. Its stability reflects fundamental characteristics of several biological phenomena such as cellular signal transduction and gene expression. Because biochemical reactions occur at…
Advances in modern technology have enabled the simultaneous recording of neural spiking activity, which statistically can be represented by a multivariate point process. We characterise the second order structure of this process via the…
This work develops a novel approach toward performance guarantees for all links in arbitrarily large wireless networks. It introduces a spatial network calculus, consisting of spatial regulation properties for stationary point processes and…
This letter presents a unified analytical framework for internodal distance distributions in 2D and 3D wireless networks, with nodes confined to concentric circular or spherical regions. Four deployment scenarios are considered, covering…
In this paper, we study a survivable network design problem on directed graphs, 2-Connected Directed Steiner Tree (2-DST): given an $n$-vertex weighted directed graph, a root $r$, and a set of $h$ terminals $S$, find a min-cost subgraph $H$…