We study the community detection and recovery problem in partially-labeled stochastic block models (SBM). We develop a fast linearized message-passing algorithm to reconstruct labels for SBM (with n nodes, k blocks, p, q intra and inter block connectivity) when δ proportion of node labels are revealed. The signal-to-noise ratio SNR(n,k, p, q,δ) is shown to characterize the fundamental limitatio...

In this paper, we have studied the notion of atomicity in message-passing distributed programs. The difference between the notion of atomicity in shared memory programs and messagepassing programs has been discussed in detail. Due to the nature of communication in messagepassing programs, the atomicity requirement in shared memory programs (serializability) does not guarantee the same level of ...

This article is motivated by soccer positional passing networks collected across multiple games. We refer to these data as replicated spatial passing networks—to accurately model such data it is necessary to take into account the spatial positions of the passer and receiver for each passing event. This spatial registration and replicates that occur across games represent key differences with us...

Cache side-channel attacks have been serious security threats to server computer systems, thus researchers proposed software-based defense approaches that can detect the attacks. Profiling-based detectors are lightweight detection solutions rely on hardware performance counters identify unique cache behaviors by The typically need set appropriate criteria differentiate between attack processes ...

‎Let $I$ denote an ideal of a Noetherian ring $R$‎. ‎The purpose of‎ ‎this article is to introduce the concepts of quintasymptotic‎ ‎sequences over $I$ and quintasymptotic cograde of $I$‎, ‎and to show that they play a role analogous to quintessential sequences‎ ‎over $I$ and quintessential cograde of $I$‎. ‎We show that‎, ‎if $R$ is‎ ‎local‎, ‎then the quintasymptotic cograde of $I$ is una...

Consider a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion where every node can pass on any of its received data to others. We are interested in how fast each node can receive the complete information, or equivalently, what the information rate arriving at each node is. Allowing a node to encode its received data be...