Related papers: Effect of a static phase transition on searching d…
This paper presents an analysis of a temporal network that describes the social connections of a large-scale (~ 30,000) sample of online social network users, inhabitants of a fixed city. We tested how the main network formation…
Many man-made networks support each other to provide efficient services and resources to the customers, despite that this support produces a strong interdependency between the individual networks. Thus an initial failure of a fraction $1-p$…
In temporal networks, where nodes interact via sequences of temporary events, information or resources can only flow through paths that follow the time-ordering of events. Such temporal paths play a crucial role in dynamic processes.…
We study a system composed from two interdependent networks A and B, where a fraction of the nodes in network A depends on the nodes of network B and a fraction of the nodes in network B depends on the nodes of network A. Due to the…
We study the cascading failures in a system composed of two interdependent square lattice networks A and B placed on the same Cartesian plane, where each node in network A depends on a node in network B randomly chosen within a certain…
We study the effectiveness of using multiple phases for maximizing the extent of information diffusion through a social network, and present insights while considering various aspects. In particular, we focus on the independent cascade…
The majority of dynamical studies in power systems focus on the high voltage transmission grids where models consider large generators interacting with crude aggregations of individual small loads. However, new phenomena have been observed…
We numerically study bootstrap percolation on Kleinberg's spatial networks, in which the probability density function of a node to have a long-range link at distance $r$ scales as $P(r)\sim r^{\alpha}$. Setting the ratio of the size of the…
We present a novel framework for understanding node target search in systems organized as hierarchical networks-within-networks. Our work generalizes traditional search models on complex networks, where the mean-first passage time is…
Selecting the optimal subset from all vertices as seeds to maximize the influence in a social network has been a task of interest. Various methods have been proposed to select the optimal vertices in a static network, however, they are…
In this work we introduce a topological method for the search of fixed points and periodic points for continuous maps defined on generalized rectangles in finite dimensional Euclidean spaces. We name our technique "Stretching Along the…
Dynamical phase transitions (DPTs) characterize critical changes in system behavior occurring at finite times, providing a lens to study nonequilibrium phenomena beyond conventional equilibrium physics. While extensively studied in quantum…
Stability is an important characteristic of network models that has implications for other desirable aspects such as controllability. The stability of a Boolean network depends on various factors, such as the topology of its wiring diagram…
The "power of choice" has been shown to radically alter the behavior of a number of randomized algorithms. Here we explore the effects of choice on models of tree and network growth. In our models each new node has k randomly chosen…
We study, via combinatorial enumeration, the probability of k-hop connection between two nodes in a wireless multi-hop network. This addresses the difficulty of providing an exact formula for the scaling of hop counts with Euclidean…
Complex networks have emerged as a simple yet powerful framework to represent and analyze a wide range of complex systems. The problem of ranking the nodes and the edges in complex networks is critical for a broad range of real-world…
This paper considers optimization problems over networks where agents have individual objectives to meet, or individual parameter vectors to estimate, subject to subspace constraints that require the objectives across the network to lie in…
Target search by active agents in rugged energy landscapes has remained a challenge because standard enhanced sampling methods do not apply to irreversible dynamics. We overcome this non-equilibrium rare-event problem by developing an…
A network as a substrate for dynamic processes may have its own dynamics. We propose a model for networks which evolve together with diffusing particles through a coupled dynamics, and investigate emerging structural property. The model…
We propose the $K$-selective percolation process as a model for the iterative removals of nodes with the specific intermediate degree in complex networks. In the model, a random node with degree $K$ is deactivated one by one until no more…