Share This Author
Target control of complex networks
An alternate ‘k-walk’ theory for directed tree networks is developed, and it is rigorously proved that one node can control a set of target nodes if the path length to each target node is unique.
Explosive Percolation in Random Networks
It is shown that incorporating a limited amount of choice in the classic Erdös-Rényi network formation model causes its percolation transition to become discontinuous.
Latent social structure in open source projects
- C. Bird, David S. Pattison, R. D’Souza, V. Filkov, Premkumar T. Devanbu
- EngineeringSIGSOFT '08/FSE-16
- 9 November 2008
These results show that subcommunities do indeed spontaneously arise within these projects as the projects evolve, and could well hold important lessons for how commercial software teams might be organized.
Suppressing cascades of load in interdependent networks
- C. Brummitt, R. D’Souza, E. Leicht
- Computer ScienceProceedings of the National Academy of Sciences
- 22 June 2011
The Bak–Tang–Wiesenfeld sandpile model is studied on modular random graphs and on graphs based on actual, interdependent power grids and it is shown that asymmetric capacity among interdependent networks affects the optimal connectivity that each prefers and may lead to an arms race for greater capacity.
Dual ecological measures of focus in software development
- Daryl Posnett, R. D’Souza, Premkumar T. Devanbu, V. Filkov
- Computer Science35th International Conference on Software…
- 1 May 2013
This work analogizes the developer-artifact contribution network to a predator-prey food web, and draws upon ideas from ecology to produce a novel, and conceptually unified view of measuring focus and ownership, which are theoretically well-founded and yield novel predictive, conceptual, and actionable value in software projects.
Coupled catastrophes: sudden shifts cascade and hop among interdependent systems
- C. Brummitt, George L. Barnett, R. D’Souza
- EconomicsJournal of The Royal Society Interface
- 15 October 2014
It is found that although protests tend to spread locally, they also seem to ‘hop' over countries, like in the stylized model; this result highlights a new class of temporal motifs in longitudinal network datasets.
Resilience and rewiring of the passenger airline networks in the United States.
- Daniel R. Wuellner, S. Roy, R. D’Souza
- Computer SciencePhysical review. E, Statistical, nonlinear, and…
- 7 January 2009
This work analyzes the individual structures of the seven largest passenger carriers in the USA and finds that networks with dense interconnectivity, as quantified by large k cores for high values of k, are extremely resilient to both targeted removal of airports and random removal of flight paths.
Measuring performance of ad hoc networks using timescales for information flow
- R. D’Souza, S. Ramanathan, D. Lang
- Computer ScienceIEEE INFOCOM . Twenty-second Annual Joint…
- 9 July 2003
A decentralized adaptive power algorithm is introduced, that uses only information local to each device, for building ad hoc networks, and is shown to perform significantly better by all metrics when compared with a standard, constant power, algorithm.
Percolation on interacting networks
A mathematical framework based on generating functions for analyzing a system of L interacting networks given the connectivity within and between networks is developed and it is shown that the percolation threshold in an individual network can be significantly lowered once "hidden" connections to other networks are considered.
Anomalous critical and supercritical phenomena in explosive percolation
The transition to widespread connectivity in networks is aptly described by concepts borrowed from percolation theory. Attempts to delay the transition with small interventions lead to explosive…