English
Related papers

Related papers: The two-point resistance of fan networks

200 papers

We consider the problem of two-point resistance in a resistor network previously studied by one of us [F. Y. Wu, J. Phys. A {\bf 37}, 6653 (2004)]. By formulating the problem differently, we obtain a new expression for the two-point…

Statistical Mechanics · Physics 2015-06-17 N. Sh. Izmailian , R. Kenna , F. Y. Wu

The resistance between two nodes in general position on a fan network with n radial lines and m transverse lines is determined. Also a similar result of Izmailian, Kenna and Wu [7] for an $m\times n$ cobweb network is reproduced but the…

Statistical Mechanics · Physics 2014-10-01 J. W. Essam , Zhi-Zhong Tan , F. Y. Wu

The resistance between arbitrary two nodes in a resistor network is obtained in terms of the eigenvalues and eigenfunctions of the Laplacian matrix associated with the network. Explicit formulas for two-point resistances are deduced for…

Mathematical Physics · Physics 2009-11-10 F. Y. Wu

We consider the problem of two point resistance on an $m times n$ cobweb network with a 2r boundary which has never been solved before. Past efforts prior to 2014 researchers just only solved the cases with free boundary or null resistor…

Statistical Mechanics · Physics 2015-06-22 Zhi-Zhong Tan

An algorithm for the calculation of the resistance between two arbitrary nodes in an arbitrary distance-regular resistor network is provided, where the calculation is based on stratification introduced in \cite{js} and Stieltjes transform…

Statistical Mechanics · Physics 2007-05-23 M. A. Jafarizadeh , R. Sufiani , S. Jafarizadeh

We consider the problem of two-point resistance on an m x n cobweb network with a superconducting boundary, which is topologically equivalent to a geographic globe. We deduce a concise formula for the resistance between any two nodes on the…

Statistical Mechanics · Physics 2014-12-24 Zhi-Zhong Tan , J. W. Essam , F. Y. Wu

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…

Mathematical Physics · Physics 2014-11-10 John W. Essam , Nikolay Sh. Izmailyan , Ralph Kenna , Zhi-Zhong Tan

An explicit formula for the resistance between two nodes in a network with a non-symmetric Laplacian matrix L is obtained. This is of great advantage e.g. in electronic circuit fault analysis, where non-linear systems have to be solved…

Numerical Analysis · Mathematics 2019-08-02 Viera Cernanova , Juraj Brenkus

An m x n cobweb network consists of n radial lines emanating from a center and connected by $m$ concentric n-sided polygons. A conjecture of Tan, Zhou and Yang for the resistance from center to perimeter of the cobweb is proved by extending…

Statistical Mechanics · Physics 2013-12-25 J. W. Essam , Zhi-Zhong Tan , F. Y. Wu

Given a resistive electrical network, we would like to determine whether all the resistances (edges) in the network are working, and if not, identify which edge (or edges) are faulty. To make this determination, we are allowed to measure…

Optimization and Control · Mathematics 2026-02-17 Barbara Fiedorowicz , Amitabh Basu

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$…

Classical Physics · Physics 2020-12-30 Rajat Chandra Mishra , Himadri Barman

We consider the robust version of a multi-commodity network flow problem. The robustness is defined with respect to the deletion, or failure, of edges. While the flow problem itself is a polynomially-sized linear program, its robust version…

Optimization and Control · Mathematics 2025-04-25 Artyom Klyuchikov , Roland Hildebrand , Sergei Protasov , Alexander Rogozin , Alexei Chernov

The effective resistance between any two nodes in a perturbed resistor network is determined by removing multiple bonds from an infinite resistor lattice. We have developed an efficient method for calculating the Green operator of the…

Mathematical Physics · Physics 2025-11-25 József Cserti , Gyula Dávid

Networks are at the core of modeling many engineering contexts, mainly in the case of infrastructures and communication systems. The resilience of a network, which is the property of the system capable of absorbing external shocks, is then…

Social and Information Networks · Computer Science 2019-03-28 Roy Cerqueti , Giovanna Ferraro , Antonio Iovanella

This paper contains results relating currents and voltages in resistive networks to appropriate random trees or forests in those networks.

Probability · Mathematics 2012-01-17 Hariharan Narayanan

We consider the problem of robustness in large consensus networks that occur in many areas such as distributed optimization. Robustness, in this context, is the scaling of performance measures, e.g. H2-norm, as a function of network…

Systems and Control · Computer Science 2018-02-27 Tuhin Sarkar , Mardavij Roozbehani , Munther A. Dahleh

This work considers the robustness of uncertain consensus networks. The first set of results studies the stability properties of consensus networks with negative edge weights. We show that if either the negative weight edges form a cut in…

Optimization and Control · Mathematics 2015-03-03 Daniel Zelazo , Mathias Bürger

The effective resistance between a pair of nodes in a weighted undirected graph is defined as the potential difference induced between them when a unit current is injected at the first node and extracted at the second node, treating edge…

Optimization and Control · Mathematics 2017-08-25 Necdet Serhat Aybat , Mert Gurbuzbalaban

Let $G$ be a finite plane multigraph and $G'$ its dual. Each edge $e$ of $G$ is interpreted as a resistor of resistance $R_e$, and the dual edge $e'$ is assigned the dual resistance $R_{e'}:=1/R_e$. Then the equivalent resistance $r_e$ over…

Combinatorics · Mathematics 2018-05-04 Martina Furrer , Norbert Hungerbühler , Simon Jantschgi

In network flow problems, there is a well-known one-to-one relationship between extreme points of the feasibility region and trees in the associated undirected graph. The same is true for the dual differential problem. In this paper, we…

Combinatorics · Mathematics 2023-08-16 René Brandenberg , Paul Stursberg
‹ Prev 1 2 3 10 Next ›