Related papers: Modeling the Small-World Phenomenon with Road Netw…
Connections in complex networks are inherently fluctuating over time and exhibit more dimensionality than analysis based on standard static graph measures can capture. Here, we introduce the concepts of temporal paths and distance in…
A simple and accurate relationship is demonstrated that links the average shortest path, nodes, and edges in a complex network. This relationship takes advantage of the concept of link density and shows a large improvement in fitting…
A regular lattice in which the sites can have long range connections at a distance l with a probabilty $P(l) \sim l^{-\delta}$, in addition to the short range nearest neighbour connections, shows small-world behaviour for $0 \le \delta <…
A fundamental problem in the study of complex networks is to provide quantitative measures of correlation and information flow between different parts of a system. To this end, several notions of communicability have been introduced and…
Probabilistic message-passing algorithms are developed for routing transmissions in multi-wavelength optical communication networks, under node and edge-disjoint routing constraints and for various objective functions. Global routing…
Advances in public transit modeling and smart card technologies can reveal detailed contact patterns of passengers. A natural way to represent such contact patterns is in the form of networks. In this paper we utilize known contact patterns…
Both small world models of random networks with occasional long range connections and gossip processes with occasional long range transmission of information have similar characteristic behaviour. The long range elements appreciably reduce…
The quantum internet is a rapidly developing technological reality, yet, it remains unclear what kind of quantum network structures might emerge. Since indirect quantum communication is already feasible and preserves absolute security of…
We introduce a minimal model of small-world growing network generated by attaching to edges. The produced network is a plane graph which exists in real-life world. We obtain the analytic results of degree distribution decaying exponentially…
Hybrid networks, i.e., networks that leverage different means of communication, become ever more widespread. To allow theoretical study of such networks, [Augustine et al., SODA'20] introduced the $\mathsf{HYBRID}$ model, which is based on…
With the widespread use of mobile computing devices in contemporary society, our trajectories in the physical space and virtual world are increasingly closely connected. Using the anonymous smartphone data of $1 \times 10^5$ users in 30…
Routing information through networks is a universal phenomenon in both natural and manmade complex systems. When each node has full knowledge of the global network connectivity, finding short communication paths is merely a matter of…
We propose a model of mobile agents to construct social networks, based on a system of moving particles by keeping track of the collisions during their permanence in the system. We reproduce not only the degree distribution, clustering…
Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are,…
Existing theories of migration either focus on micro- or macroscopic behavior of populations; that is, either the average behavior of entire population is modeled directly, or decisions of individuals are modeled directly. In this work, we…
In this work we investigate the betweenness centrality in geographical networks and its relationship with network communities. We show that vertices with large betweenness define what we call characteristic betweenness paths in both modeled…
Milgram empirically showed that people knowing only connections to their friends could locate any person in the U.S. in a few steps. Later research showed that social network topology enables a node aware of its full routing to find an…
A new complex network model is proposed which is founded on growth with new connections being established proportionally to the current dynamical activity of each node, which can be understood as a generalization of the Barabasi-Albert…
What is the underlying mechanism leading to power-law degree distributions of many natural and artificial networks is still at issue. We consider that scale-free networks emerges from self-organizing process, and such a evolving model is…
A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…