Interfaces and the edge percolation map of random directed networks.

  title={Interfaces and the edge percolation map of random directed networks.},
  author={M. {\'A}ngeles Serrano and Paolo De Los Rios},
  journal={Physical Review E},
The traditional node percolation map of directed networks is reanalyzed in terms of edges. In the percolated phase, edges can mainly organize into five distinct giant connected components, interfaces bridging the communication of nodes in the strongly connected component and those in the in and out components. Formal equations for the relative sizes in the number of edges of these giant structures are derived for arbitrary joint degree distributions in the presence of local and two-point… Expand

Figures from this paper

Structural Efficiency of Percolated Landscapes in Flow Networks
This work defines quantitatively under minimal assumptions the structural efficiency of networks to determine how robust communication between the core and the peripheral components through interface edges could be and assesses that optimal topologies in terms of access to the core should look like “hairy balls” to minimize bottleneck effects and the sensitivity to failures. Expand
Robustness and Directed Structures in Ecological Flow Networks
Robustness of ecological flow networks under random failure of arcs is considered with respect to two different functionalities: coherence and circulation, and it is shown that realistic network structures have positive effect on robustness for coherence, whereas they have negative effect for circulation. Expand
Percolation on an isotropically directed lattice
We investigate percolation on a randomly directed lattice, an intermediate between standard percolation and directed percolation, focusing on the isotropic case in which bonds on opposite directionsExpand
Conservation laws for voter-like models on random directed networks
We study the voter model, under node and link update, and the related invasion process on a single strongly connected component of a directed network. We implement an analytical treatment in theExpand
A network model for field and quenched disorder effects in artificial spin ice
We have carried out a systematic study of the effects of field strength and quenched disorder on the driven dynamics of square artificial spin ice. We construct a network representation of theExpand
Disorder, Edge, and Field Protocol Effects in Athermal Dynamics of Artificial Spin Ice
Abstract Artificial spin ice consists of a lithographically defined array of Ising-like “macrospins,” whose interactions are frustrated by geometry. It has received a great deal of attention inExpand
Conflict and error prevention and detection in complex networks
Results show that for effective prevention and detection, the decentralized algorithm shall be used according to four performance measures: time, coverage ability, preventability, and damage, and if information transmission between agents is disrupted, the centralized algorithmshall be used to achieve better performance than the traditional algorithm. Expand
A framework of enroute air traffic conflict detection and resolution through complex network analysis
Analysis of the network structure of proposed design for automated conflict detection and resolution for the next generation air transportation system provides insight into the tradeoffs of alternative concepts of collaborative operations, including tradeoffs between expected conflicts, communications requirements, and vulnerability to targeted attack. Expand
Three differentially expressed miRNAs as potential biomarkers for lung adenocarcinoma prognosis.
  • W. Wang, B. Liu, +10 authors Y. Yang
  • Medicine, Biology
  • Combinatorial chemistry & high throughput screening
  • 2020
Three key miRNAs can be used as novel biomarkers for the prediction of prognosis of LUAD and are screened from survival analysis, which are significantly enriched in systemic lupus erythematosus pathways. Expand


Percolation in directed scale-free networks.
The percolation properties of directed scale-free networks with correlated in and out degree distributions are studied, derived from a phase diagram that indicates the existence of three regimes, determined by the values of the degree exponents. Expand
Generalized percolation in random directed networks.
  • M. Boguñá, M. Serrano
  • Mathematics, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
We develop a general theory for percolation in directed random networks with arbitrary two-point correlations and bidirectional edges--that is, edges pointing in both directions simultaneously. TheseExpand
Giant strongly connected component of directed networks.
It is explained that the giant strongly connected component may be less resilient to random damage than the giant weakly connected one and that the World Wide Web is a directed network. Expand
Anomalous percolation properties of growing networks.
The anomalous phase transition of the emergence of the giant connected component in scale-free networks growing under mechanism of preferential linking is described and exact results for the size and the distribution of vertices among connected components are obtained. Expand
Network robustness and fragility: percolation on random graphs.
This paper studies percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolators, bond percolations, and models in which occupation probabilities depend on vertex degree. Expand
Percolation and epidemic thresholds in clustered networks.
It is found that, although clustering in scale-free networks can strongly affect some percolating properties, such as the size and the resilience of the giant connected component, it cannot restore a finite percolation threshold. Expand
Statistical mechanics of complex networks
A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network. Expand
The topological relationship between the large-scale attributes and local interaction patterns of complex networks
It is shown that a network's large-scale topological organization and its local subgraph structure mutually define and predict each other, as confirmed by direct measurements in five well studied cellular networks. Expand
Random graphs with arbitrary degree distributions and their applications.
It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph. Expand
Epidemic spreading in correlated complex networks.
A dynamical model of epidemic spreading on complex networks in which there are explicit correlations among the node's connectivities finds an epidemic threshold inversely proportional to the largest eigenvalue of the connectivity matrix that gives the average number of links. Expand