English
Related papers

Related papers: Effective Impedance over Ordered Fields

200 papers

We study the tolerance to congestion failures in communication networks with scale-free topology. The traffic load carried by each damaged element in the network must be partly or totally redistributed among the remaining elements.…

Statistical Mechanics · Physics 2009-11-07 Y. Moreno , R. Pastor-Satorras , A. Vazquez , A. Vespignani

Being motivated by recent developments in the theory of complex networks, we examine the robustness of communication networks under intentional attack that takes down network nodes in a decreasing order of their nodal degrees. In this…

Networking and Internet Architecture · Computer Science 2007-05-23 Shi Xiao , Gaoxi Xiao

We propose a novel capacity model for complex networks against cascading failure. In this model, vertices with both higher loads and larger degrees should be paid more extra capacities, i.e. the allocation of extra capacity on vertex $i$…

Physics and Society · Physics 2008-04-03 Ping Li , Bing-Hong Wang , Han Sun , Pan Gao , Tao Zhou

Motivated by recent physics papers describing the formation of biological transport networks we study a discrete model proposed by Hu and Cai consisting of an energy consumption function constrained by a linear system on a graph. For the…

Analysis of PDEs · Mathematics 2019-08-21 Jan Haskovec , Lisa Maria Kreusser , Peter Markowich

Hierarchical latent class (HLC) models are tree-structured Bayesian networks where leaf nodes are observed while internal nodes are latent. There are no theoretically well justified model selection criteria for HLC models in particular and…

Artificial Intelligence · Computer Science 2011-07-04 T. Kocka , N. L. Zhang

How big is the risk that a few initial failures of nodes in a network amplify to large cascades that span a substantial share of all nodes? Predicting the final cascade size is critical to ensure the functioning of a system as a whole. Yet,…

Physics and Society · Physics 2018-02-12 Rebekka Burkholz , Hans J. Herrmann , Frank Schweitzer

Efficient operation of distribution grids in the smart-grid era is hindered by the limited presence of real-time nodal and line meters. In particular, this prevents the easy estimation of grid topology and associated line parameters that…

Systems and Control · Computer Science 2020-03-03 Sejun Park , Deepjyoti Deka , Scott Backhaus , Michael Chertkov

Finite 1-safe Petri nets, also called \emph{net systems}, are natural models of asynchronous concurrency. The event structure of a net system describes all its possible executions and their concurrent nature: two events may be causally…

Logic in Computer Science · Computer Science 2022-04-13 Hugo Gimbert

We propose a mechanism of superconductivity in which the order of the ground state does not arise from the usual Landau mechanism of spontaneous symmetry breaking but is rather of topological origin. The low-energy effective theory is…

High Energy Physics - Theory · Physics 2007-05-23 M. C. Diamantini , P. Sodano , C. A. Trugenberger

Many systems, ranging from engineering to medical to societal, can only be properly characterized by multiple interdependent networks whose normal functioning depends on one another. Failure of a fraction of nodes in one network may lead to…

Disordered Systems and Neural Networks · Physics 2015-05-13 Sergey V. Buldyrev , Roni Parshani , Gerald Paul , H. Eugene Stanley , Shlomo Havlin

We take advantage of the fact that in lambda phi ^4 problems a large field cutoff phi_max makes perturbative series converge toward values exponentially close to the exact values, to make optimal choices of phi_max. For perturbative series…

High Energy Physics - Theory · Physics 2009-11-10 B. Kessler , L. Li , Y. Meurice

We present analytic and numeric results for percolation in a network formed of interdependent spatially embedded networks. We show results for a treelike and a random regular network of networks each with $(i)$ unconstrained interdependent…

Physics and Society · Physics 2015-06-18 Louis M. Shekhtman , Yehiel Berezin , Michael M. Danziger , Shlomo Havlin

We explicitly compute the effective resistances between any two vertices of a ladder graph by using circuit reductions. Using our findings, we obtain explicit formulas for Kirchhoff index and admissible invariants of a ladder graph…

Combinatorics · Mathematics 2015-03-24 Zubeyir Cinkir

The fundamental and natural connection between the infinite constellation (IC) dimension and the best diversity order it can achieve is investigated in this paper. In the first part of this work we develop an upper bound on the diversity…

Information Theory · Computer Science 2015-03-19 Yair Yona , Meir Feder

This overview presents a collection of results from classical electrical network theory concerning properties of the network admittance matrix, and the relationship between electrical characteristics of the network and various mathematical…

History and Overview · Mathematics 2025-07-22 Anthony B. Morton

The power and communication networks are highly interdependent and form a part of the critical infrastructure of a country. Similarly, dependencies exist within the networks itself. It is essential to have a model which captures these…

Networking and Internet Architecture · Computer Science 2017-06-01 Joydeep Banerjee , Kaustav Basu , Arunabha Sen

A crucial question in analyzing a concurrent system is to determine its long-run behaviour, and in particular, whether there are irreversible choices in its evolution, leading into parts of the reachability space from which there is no…

Formal Languages and Automata Theory · Computer Science 2022-09-22 Giann Karlo Aguirre-Samboní , Stefan Haar , Loïc Paulevé , Stefan Schwoon , Nick Würdemann

The resistance between arbitrary nodes of infinite networks of resistors is studied when the network is perturbed by removing one bond from the perfect lattice. A connection is made between the resistance and the lattice Green's function of…

Disordered Systems and Neural Networks · Physics 2007-05-23 József Cserti , Gyula Dávid , Attila Piróth

Complex networks are at the core of an intense research activity. However, in most cases, intricate and costly measurement procedures are needed to explore their structure. In some cases, these measurements rely on link queries: given two…

Networking and Internet Architecture · Computer Science 2009-04-22 Fabien Tarissan , Matthieu Latapy , Christophe Prieur

The capacitance between any two arbitrary lattice sites in an infinite square lattice is studied when one bond is removed (i.e. perturbed). A connection is made between the capacitance and the Lattice Green's Function of the perturbed…

General Physics · Physics 2009-05-04 J. H. Asad , R. S. Hijjawi , A. J. Sakaji , J. M. Khalifeh