Connectivity-based time centrality in time-varying graphs

نویسندگان

چکیده

Abstract Time-varying graphs (TVGs) enable the study and understanding of dynamics many real-world networked systems. The notion centrality in TVG scenarios generally refers to metrics that assess relative importance nodes over time evolution a complex dynamic network. In contrast, Time Centrality, which evaluates instants networks, is still little explored. Indeed, few works on Centrality base their findings diffusion processes, for example, identifying best instant start dissemination message envisaging more efficient given expected network dynamics. this work, we from connectivity perspective. context, propose two connectivity-based identify most important first metric Degree that, analogously node degree centrality, computes number connections each has. second metric, PageRank searches receive largest accumulated since they are considered weights at instant. To validate metrics, model public multimodal transport considering as an aspect node. We then apply proposed analyse results Our show can different

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connectivity in time-graphs

Dynamic networks are characterized by topologies that varywith time and are represented by time-graphs. The notion of connectivity in time-graphs is fundamentally different from that in static graphs. End-to-end connectivity is achieved opportunistically by the store–carry-forward paradigm if the network is so sparse that source–destination pairs are usually not connected by complete paths. In ...

متن کامل

Components in time-varying graphs

Real complex systems are inherently time-varying. Thanks to new communication systems and novel technologies, today it is possible to produce and analyze social and biological networks with detailed information on the time of occurrence and duration of each link. However, standard graph metrics introduced so far in complex network theory are mainly suited for static graphs, i.e., graphs in whic...

متن کامل

Efficient Centrality Monitoring for Time-Evolving Graphs

The goal of this work is to identify the nodes that have the smallest sum of distances to other nodes (the lowest closeness centrality nodes) in graphs that evolve over time. Previous approaches to this problem find the lowest centrality nodes efficiently at the expense of exactness. The main motivation of this paper is to answer, in the affirmative, the question, ‘Is it possible to improve the...

متن کامل

Expressivity of Time-Varying Graphs

Time-varying graphs model in a natural way infrastructureless highly dynamic systems, such as wireless ad-hoc mobile networks, robotic swarms, vehicular networks, etc. In these systems, a path from a node to another might still exist over time, rendering computing possible, even though at no time the path exists in its entirety. Some of these systems allow waiting (i.e., provide the nodes with ...

متن کامل

Estimating Time Varying Undirected Graphs

Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using l1 penalization methods. However, current methods assume that the data are independent and identically distributed. If the distribution, and hence the graph, evolves over time then the data are not longer identically distributed. In this paper, we show how to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Complex Networks

سال: 2021

ISSN: ['2051-1310', '2051-1329']

DOI: https://doi.org/10.1093/comnet/cnaa048