Related papers: Smeared phase transitions in percolation on real c…
Complex networks obtained from the real-world networks are often characterized by incompleteness and noise, consequences of limited sampling as well as artifacts in the acquisition process. Because the characterization, analysis and…
Complex network theory provides an elegant and powerful framework to statistically investigate different types of systems such as society, brain or the structure of local and long-range dynamical interrelationships in the climate system.…
The static properties of the fundamental model for epidemics of diseases allowing immunity (susceptible-infected-removed model) are known to be derivable by an exact mapping to bond percolation. Yet when performing numerical simulations of…
Carrying digital information in traditional copper wires is becoming a major issue in electronic circuits. Optical connections such as fiber optics offers unprecedented transfer capacity, but the mismatch between the optical wavelength and…
This paper investigates the use of a networked system ($e.g.$, swarm of robots, smart grid, sensor network) to monitor a time-varying phenomenon of interest in the presence of communication and computation latency. Recent advances in edge…
We consider propagation models that describe the spreading of an attribute, called "damage", through the nodes of a random network. In some systems, the average fraction of nodes that remain undamaged vanishes in the large system limit, a…
Disordered metasurfaces provide a versatile platform for harnessing near- and far-field scattered light. Most research has focused on either particulate topologies composed of individual, well-identified metaatoms or, to a lesser extent,…
Complex networks has been a hot topic of research over the past several years over crossing many disciplines, starting from mathematics and computer science and ending by the social and biological sciences. Random graphs were studied to…
It is widely believed that information spread on social media is a percolation process, with parallels to phase transitions in theoretical physics. However, evidence for this hypothesis is limited, as phase transitions have not been…
We model filtration of a feed solution, containing both small and large foulant particles, by a membrane filter. The membrane interior is modeled as a network of pores, allowing for the simultaneous adsorption of small particles and sieving…
Recently, new results on percolation of interdependent networks have shown that the percolation transition can be first order. In this paper we show that, when considering antagonistic interactions between interacting networks, the…
Quantum networks are composed of nodes which can send and receive quantum states by exchanging photons. Their goal is to facilitate quantum communication between any nodes, something which can be used to send secret messages in a secure…
The organization of interactions in complex systems can be described by networks connecting different units. These graphs are useful representations of the local and global complexity of the underlying systems. The origin of their…
For ordinary (independent) percolation on a large class of lattices it is well known that below the critical percolation parameter $p_c$ the cluster size distribution has exponential decay and that power-law behavior of this distribution…
We consider the task of detecting a salient cluster in a sensor network, that is, an undirected graph with a random variable attached to each node. Motivated by recent research in environmental statistics and the drive to compete with the…
The diffusion and bootstrap percolation models were studied in regular random and Erd\H{o}s-R\'{e}nyi networks using the modified Newman-Ziff algorithms. We calculated the percolation threshold and the order parameter of the percolation…
We present, as a very general method, an effective field theory to analyze models defined over small-world networks. Even if the exactness of the method is limited to the paramagnetic regions and to some special limits, it gives the exact…
K-clique percolation is an overlapping community finding algorithm which extracts particular structures, comprised of overlapping cliques, from complex networks. While it is conceptually straightforward, and can be elegantly expressed using…
Although classifying topological quantum phases have attracted great interests, the absence of local order parameter generically makes it challenging to detect a topological phase transition from experimental data. Recent advances in…
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…