Related papers: Transient dynamics for sequence processing neural …
Spreading phenomena on networks are essential for the collective dynamics of various natural and technological systems, from information spreading in gene regulatory networks to neural circuits or from epidemics to supply networks…
Despite great effort spent measuring topological features of large networks like the Internet, it was recently argued that sampling based on taking paths through the network (e.g., traceroutes) introduces a fundamental bias in the observed…
The goal of is to study how increased variability in the degree distribution impacts the global connectivity properties of a large network. We approach this question by modeling the network as a uniform random graph with a given degree…
We study the degree distribution of a randomly chosen vertex in a duplication--divergence graph, under a variety of different generalizations of the basic model of Bhan, Galas and Dewey (2002) and V\'azquez, Flammini, Maritan and Vespignani…
We consider a general class of preferential attachment schemes evolving by a reinforcement rule with respect to certain sublinear weights. In these schemes, which grow a random network, the sequence of degree distributions is an object of…
We present a simple model of network growth and solve it by writing down the dynamic equations for its macroscopic characteristics like the degree distribution and degree correlations. This allows us to study carefully the percolation…
We study the biased random walk process in random uncorrelated networks with arbitrary degree distributions. In our model, the bias is defined by the preferential transition probability, which, in recent years, has been commonly used to…
The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (almost) any wanted degree…
We study the spreading dynamics on graphs with a power law degree distribution p_k ~ k^-gamma with 2<gamma<3, as an example of a branching process with diverging reproductive number. We provide evidence that the divergence of the second…
This paper introduces a method to generate hierarchically modular networks with prescribed node degree list and proposes a metric to measure network modularity based on the notion of edge distance. The generated networks are used as test…
This paper presents an analytical framework to model fault-tolerance in unstructured peer-to-peer overlays, represented as complex networks. We define a distributed protocol peers execute for managing the overlay and reacting to node…
Degree distributions of many real networks are known to follow the Mandelbrot law, which can be considered as an extension of the power law and is determined by not only the power-law exponent, but also the shifting coefficient. Although…
We present the mathematical analysis of generalized complex contagions in clustered multiplex networks for susceptible-infected-recovered (SIR)-like dynamics. The model is intended to understand diffusion of influence, or any other…
The numerical controllability transition makes the success of control can be achieved by increasing the number of driver nodes to a certain point. Motivated by the fact that the degree correlation has vast role in the dynamics on networks,…
A family of models of growing hypergraphs with preferential rules of new linking is introduced and studied. The model hypergraphs evolve via the hyperedge-based growth as well as the node-based one, thus generalizing the…
In this paper, we propose an evolving network model growing fast in units of module, based on the analysis of the evolution characteristics in real complex networks. Each module is a small-world network containing several interconnected…
We analyze how the transient dynamics of large dynamical systems in the vicinity of a stationary point, modeled by a set of randomly coupled linear differential equations, depends on the network topology. We characterize the transient…
Epidemics on complex networks is a widely investigated topic in the last few years, mainly due to the last pandemic events. Usually, real contact networks are dynamic, hence much effort has been invested in studying epidemics on evolving…
It was experimentally observed that the majority of real-world networks follow power law degree distribution. The aim of this paper is to study the algorithmic complexity of such "typical" networks. The contribution of this work is twofold.…
Deep neural networks are strongly over-parameterized, often containing far more weights than required for their task. Although such redundancy can aid optimization, it leads to inefficient deployment and high computational cost, motivating…