


default search action
IEEE Transactions on Network Science and Engineering, Volume 1
Volume 1, Number 1, January - June 2014
- Mung Chiang:
IEEE TNSE Inaugural Issue Editorial. 1 - Ali Jadbabaie:
IEEE Transactions on Network Science and Engineering. 2-9 - Emmanuel Abbe, Afonso S. Bandeira, Annina Bracher, Amit Singer
:
Decoding Binary Node Labels from Censored Edge Measurements: Phase Transition and Efficient Recovery. 10-22 - David Mateos-Nunez, Jorge Cortés
:
Distributed Online Convex Optimization Over Jointly Connected Digraphs. 23-37 - Fan Chung:
A Brief Survey of PageRank Algorithms. 38-42 - Joohwan Kim, Arash Ghayoori, R. Srikant:
All-to-All Communication in Random Regular Directed Graphs. 43-52 - Ketan Savla, Giacomo Como
, Munther A. Dahleh:
Robust Network Routing under Cascading Failures. 53-66
Volume 1, Number 2, July - December 2014
- Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis:
An Efficient Curing Policy for Epidemics on Graphs. 67-75 - Renaud Lambiotte
, Jean-Charles Delvenne, Mauricio Barahona
:
Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks. 76-90 - Zahra Aminzare, Eduardo D. Sontag:
Synchronization of Diffusively-Connected Nonlinear Systems: Results Based on Contractions with Respect to General Norms. 91-106

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.