We study the problem of reconstructing a hidden graph given access to a distance oracle. We design randomized algorithms for the following problems: reconstruction of a degree bounded graph with query complexity Õ(n); reconstruction of a degree bounded outerplanar graph with query complexity Õ(n); and near-optimal approximate reconstruction of a general graph.

In this paper, we study the problem of learning the structure of Markov Networks that permit efficient inference. We formulate structure learning as an optimization problem that maximizes the likelihood of the model such that the inference complexity on the resulting structure is bounded. The inference complexity is measured with respect to any chosen algorithm (either exact or approximate), or...

This paper formalizes the idea that firms can (partly) overcome the static costs associated with low contractibility by engaging in long-term relationships, but that the rigidity of these relationships may lead to strong dynamic ineffi ciencies. Specifically, we consider the repeated interaction between a final good producer and an intermediate input supplier. A pair producer/supplier can be a ...

In this paper, the artificial boundary method for Poisson problem in an infinite domain with a concave angle is investigated. The exact and approximate elliptical arc artificial boundary conditions are given. The finite element approximation is formulated in a bounded domain using the approximate artificial boundary condition and error estimates are obtained. Finally, some numerical examples sh...

Load Frequency Control (LFC) has received considerable attention during last decades. This paper proposes a new method for designing decentralized interaction estimators for interconnected large-scale systems and utilizes it to multi-area power systems. For each local area, a local estimator is designed to estimate the interactions of this area using only the local output measurements. In fact,...

This paper considers the stability of online learning algorithms and its implications for learnability (bounded regret). We introduce a novel quantity called forward regret that intuitively measures how good an online learning algorithm is if it is allowed a one-step look-ahead into the future. We show that given stability, bounded forward regret is equivalent to bounded regret. We also show th...

Let A be a Banach algebra with a bounded left approximate identity. The Cohen Factorization Theorem is used to prove several results concerning the representation theory of A.