Distributed minimum spanning tree (MST) problem is one of the most central and fundamental problems in distributed graph algorithms. Garay et al. [GKP98, KP98] devised an algorithm with running time O(D + √ n · log∗ n), where D is the hop-diameter of the input nvertex m-edge graph, and with message complexity O(m+n). Peleg and Rubinovich [PR99] showed that the running time of the algorithm of [...

The skewness of the cross-sectional distribution of book-to-market ratios is shown to be an important state variable. It varies through time in correlation with the business cycle and with indicators of investor sentiment. When times are ‘good’ a tail of low book-to-market stocks causes a left skew in the distribution. In ‘bad’ times high book-to-market stocks make the distribution more symmetr...

We investigate the problem of determining a set S of k indistinguishable integers in the range [1, n]. The algorithm is allowed to query an integer q ∈ [1, n], and receive a response comparing this integer to an integer randomly chosen from S. The algorithm has no control over which element of S the query q is compared to. We show tight bounds for this problem. In particular, we show that in th...

In this paper, we study the problem of constructing a sorting circuit, network, or PRAM algorithm that is tolerant to faults. For the most part, we focus on fault patterns that are random, i.e., where the result of each comparison is independently faulty with probability upper-bounded by some constant. All previous fault-tolerant sorting circuits, networks, and parallel algorithms require (log ...

The WPI-NaCas-GLY antimicrobial film takes full advantage of the controlled release of active or antimicrobial agents as well as demonstrates a great potential for functioning as an alternative biodegradable polymer in practical applications. The moisture sorption kinetics of the film as an important carrier of active agents was investigated at various relative humidities (RH). The results indi...

We consider the convergence problem of autonomous mobile robots with inaccurate sensors, which may return the erroneous location of other robots. In this paper, we newly introduce a uniform error model, which is a restricted variant of the original observation-error model proposed by Cohen and Peleg [4]. The degree of an observation error is characterized by distance errors and angle errors. Wh...

A t-spanner of a graph G is a spanning subgraph H such that the distance between any two vertices in H is at most t times their distance in G. Spanners arise in the context of approximating the original graph with a sparse subgraph (Peleg, D., and Scha ffer, A. A. (1989), J. Graph. Theory 13 (1), 99 116). The MINIMUM t-SPANNER problem seeks to find a t-spanner with the minimum number of edges f...

This study considers the implications of corporate political activity and political risk on asset pricing. It is found that firms which operate an affiliated political action committee (PAC) outperform firms that do not. Among firms that operate a PAC, we find that those that spend relatively less on politics outperform those that spend more and that political risk is successfully hedged by fir...

Motivated by the distributed binary consensus algorithm in Perron et al. [(2009) UsingThree States for Binary Consensus on Complete Graphs. INFOCOM 2009, IEEE, April, pp. 2527–2535], we propose a distributed algorithm for the multivalued consensus problem. In the multivalued consensus problem, each node initially chooses from one of k available choices and the objective of all nodes is to find ...

We compared six computer-interpretable guideline models to understand their commonalities and differences. We sought to identify issues to be resolved if there were to be a consensus on a set of common components, while allowing research groups to continue their research on unique features. The models compared were Asbru, EON, GLIF, GUIDE, PRODIGY, and PROforma. Collaborators from each group th...