Related papers: Directed extended-range percolation
Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…
First principle network models are crucial to make sense of the intricate topology of real complex networks. While modeling efforts have been quite successful in undirected networks, generative models for networks with asymmetric…
Percolation theory concerns the emergence of connected clusters that percolate through a networked system. Previous studies ignored the effect that a node outside the percolating cluster may actively induce its inside neighbours to exit the…
Constructions of directed configuration graphs based on a given bi-degree distribution were introduced in random graph theory some years ago. These constructions lead to graphs where the degrees of two nodes belonging to the same edge are…
We study directed rigidity percolation (equivalent to directed bootstrap percolation) on three different lattices: square, triangular, and augmented triangular. The first two of these display a first-order transition at p=1, while the…
Coordination in distributed systems is often hampered by communication latency, which degrades performance. Quantum entanglement offers fundamentally stronger correlations than classically achievable without communication. Crucially, these…
The directed bond percolation is a paradigmatic model in nonequilibrium statistical physics. It captures essential physical information on the nature of continuous phase transition between active and absorbing states. In this paper, we…
The distribution of entanglement between the nodes of a quantum network plays a fundamental role in quantum information applications. In this work, we investigate the dynamics of a network of qubits where each edge corresponds to an…
By employing the methods of renormalized field theory we show that the percolation behavior of random resistor-diode networks near the multicritical line belongs to the universality class of isotropic percolation. We construct a mesoscopic…
We introduce a new measure of complexity (called spectral complexity) for directed graphs. We start with splitting of the directed graph into its recurrent and non-recurrent parts. We define the spectral complexity metric in terms of the…
We study the relation between the directed polymer and the directed percolation models, for the case of a disordered energy landscape where the energies are taken from bimodal distribution. We find that at the critical concentration of the…
We examine two properties of complex networks, the robustness against targeted node removal (attack) and the transport efficiency in terms of degree correlation in node connection by numerical evaluation of exact analytic expressions. We…
Deep learning models have gained great success in many real-world applications. However, most existing networks are typically designed in heuristic manners, thus lack of rigorous mathematical principles and derivations. Several recent…
This study examines the robustness of I2P, a well-regarded anonymous and decentralized peer-to-peer network designed to ensure anonymity, confidentiality, and circumvention of censorship. Unlike its more widely researched counterpart, TOR,…
We consider random resistor networks with nodes given by a point process on $\mathbb{R}^d$ and with random conductances. The length range of the electrical filaments can be unbounded. We assume that the randomness is stationary and ergodic…
Most real-world complex systems can be modelled by coupled networks with multiple layers. How and to what extent the pattern of couplings between network layers may influence the interlaced structure and function of coupled networks are not…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. Assuming that the nodes of the wireless network are distributed as a…
Epidemics have so far been mostly studied in undirected networks. However, many real-world networks, such as the social network Twitter and the WWW networks, upon which information, emotion or malware spreads, are shown to be directed…
We present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their primary applications, these decompositions allow us to achieve…
We proposed a method called residual edge-betweenness gradient (REBG) to enhance synchronizability of networks by assignment of link direction while keeping network topology and link weight unchanged. Direction assignment has been shown to…