16,681 research outputs found
An algorithm for reliability analysis of planar graphs
Includes bibliographical references (leaf 15).Funded in part by National Science Foundation. ECS-8316224by Daniel Bienstock
Concurrent Geometric Multicasting
We present MCFR, a multicasting concurrent face routing algorithm that uses
geometric routing to deliver a message from source to multiple targets. We
describe the algorithm's operation, prove it correct, estimate its performance
bounds and evaluate its performance using simulation. Our estimate shows that
MCFR is the first geometric multicast routing algorithm whose message delivery
latency is independent of network size and only proportional to the distance
between the source and the targets. Our simulation indicates that MCFR has
significantly better reliability than existing algorithms
Bond-Propagation Algorithm for Thermodynamic Functions in General 2D Ising Models
Recently, we developed and implemented the bond propagation algorithm for
calculating the partition function and correlation functions of random bond
Ising models in two dimensions. The algorithm is the fastest available for
calculating these quantities near the percolation threshold. In this paper, we
show how to extend the bond propagation algorithm to directly calculate
thermodynamic functions by applying the algorithm to derivatives of the
partition function, and we derive explicit expressions for this transformation.
We also discuss variations of the original bond propagation procedure within
the larger context of Y-Delta-Y-reducibility and discuss the relation of this
class of algorithm to other algorithms developed for Ising systems. We conclude
with a discussion on the outlook for applying similar algorithms to other
models.Comment: 12 pages, 10 figures; submitte
Spanning Trees and bootstrap reliability estimation in correlation based networks
We introduce a new technique to associate a spanning tree to the average
linkage cluster analysis. We term this tree as the Average Linkage Minimum
Spanning Tree. We also introduce a technique to associate a value of
reliability to links of correlation based graphs by using bootstrap replicas of
data. Both techniques are applied to the portfolio of the 300 most capitalized
stocks traded at New York Stock Exchange during the time period 2001-2003. We
show that the Average Linkage Minimum Spanning Tree recognizes economic sectors
and sub-sectors as communities in the network slightly better than the Minimum
Spanning Tree does. We also show that the average reliability of links in the
Minimum Spanning Tree is slightly greater than the average reliability of links
in the Average Linkage Minimum Spanning Tree.Comment: 17 pages, 3 figure
- …