—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
This paper employs the network perspective to study patterns and structures of intraorganizational learning networks. The theoretical background draws from cognitive theories, the...
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Background: In recent years, an extensive characterization of network structures has been made in an effort to elucidate design principles of metabolic networks, providing valuabl...