{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1360004236128351872.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1140/epjb/e2016-60498-7"}},{"identifier":{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1140/epjb/e2016-60498-7"}},{"identifier":{"@type":"DOI","@value":"10.48550/arxiv.1506.07032"}}],"resourceType":"学術雑誌論文(journal article)","dc:title":[{"@value":"Coverage centralities for temporal networks"}],"description":[{"notation":[{"@value":"Structure of real networked systems, such as social relationship, can be modeled as temporal networks in which each edge appears only at the prescribed time. Understanding the structure of temporal networks requires quantifying the importance of a temporal vertex, which is a pair of vertex index and time. In this paper, we define two centrality measures of a temporal vertex based on the fastest temporal paths which use the temporal vertex. The definition is free from parameters and robust against the change in time scale on which we focus. In addition, we can efficiently compute these centrality values for all temporal vertices. Using the two centrality measures, we reveal that distributions of these centrality values of real-world temporal networks are heterogeneous. For various datasets, we also demonstrate that a majority of the highly central temporal vertices are located within a narrow time window around a particular time. In other words, there is a bottleneck time at which most information sent in the temporal network passes through a small number of temporal vertices, which suggests an important role of these temporal vertices in spreading phenomena."}]},{"notation":[{"@value":"13 pages, 10 figures"}]}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1410282680937348098","@type":"Researcher","personIdentifier":[{"@type":"NRID","@value":"9000006819502"},{"@type":"NRID","@value":"9000376938426"},{"@type":"NRID","@value":"9000351488459"},{"@type":"NRID","@value":"9000397669729"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/ttakaguchi"}],"foaf:name":[{"@value":"Taro Takaguchi"}]},{"@id":"https://cir.nii.ac.jp/crid/1380004236128351755","@type":"Researcher","foaf:name":[{"@value":"Yosuke Yano"}]},{"@id":"https://cir.nii.ac.jp/crid/1420845751152100224","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"50636967"},{"@type":"NRID","@value":"1000050636967"},{"@type":"NRID","@value":"9000242864860"},{"@type":"NRID","@value":"9000006475300"},{"@type":"NRID","@value":"9000347162362"},{"@type":"NRID","@value":"9000242140602"},{"@type":"NRID","@value":"9000006930948"},{"@type":"NRID","@value":"9000107322598"},{"@type":"NRID","@value":"9000017552465"},{"@type":"NRID","@value":"9000243753453"},{"@type":"NRID","@value":"9000304694582"},{"@type":"NRID","@value":"9000311776777"},{"@type":"NRID","@value":"9000248956881"},{"@type":"NRID","@value":"9000017682842"},{"@type":"NRID","@value":"9000242374911"},{"@type":"NRID","@value":"9000296673812"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/yyoshida"}],"foaf:name":[{"@value":"Yuichi Yoshida"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"14346028"},{"@type":"EISSN","@value":"14346036"}],"prism:publicationName":[{"@value":"The European Physical Journal B"}],"dc:publisher":[{"@value":"Springer Science and Business Media LLC"}],"prism:publicationDate":"2016-02","prism:volume":"89","prism:number":"2"},"reviewed":"false","dcterms:accessRights":"http://purl.org/coar/access_right/c_abf2","url":[{"@id":"http://link.springer.com/content/pdf/10.1140/epjb/e2016-60498-7"}],"createdAt":"2016-02-04","modifiedAt":"2025-06-01","foaf:topic":[{"@id":"https://cir.nii.ac.jp/all?q=Social%20and%20Information%20Networks%20(cs.SI)","dc:title":"Social and Information Networks (cs.SI)"},{"@id":"https://cir.nii.ac.jp/all?q=FOS:%20Computer%20and%20information%20sciences","dc:title":"FOS: Computer and information sciences"},{"@id":"https://cir.nii.ac.jp/all?q=Physics%20-%20Physics%20and%20Society","dc:title":"Physics - Physics and Society"},{"@id":"https://cir.nii.ac.jp/all?q=FOS:%20Physical%20sciences","dc:title":"FOS: Physical sciences"},{"@id":"https://cir.nii.ac.jp/all?q=Computer%20Science%20-%20Social%20and%20Information%20Networks","dc:title":"Computer Science - Social and Information Networks"},{"@id":"https://cir.nii.ac.jp/all?q=Physics%20and%20Society%20(physics.soc-ph)","dc:title":"Physics and Society (physics.soc-ph)"},{"@id":"https://cir.nii.ac.jp/all?q=Condensed%20Matter%20Physics","dc:title":"Condensed Matter Physics"},{"@id":"https://cir.nii.ac.jp/all?q=Electronic,%20Optical%20and%20Magnetic%20Materials","dc:title":"Electronic, Optical and Magnetic Materials"}],"project":[{"@id":"https://cir.nii.ac.jp/crid/1040282257291158144","@type":"Project","projectIdentifier":[{"@type":"KAKEN","@value":"26730009"},{"@type":"JGN","@value":"JP26730009"},{"@type":"URI","@value":"https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-26730009/"}],"notation":[{"@language":"ja","@value":"充足可能な制約充足問題に対する近似アルゴリズムの研究"},{"@language":"en","@value":"Research on Approximation Algorithms for Satisfiable Constraint Satisfaction Problems"}]}],"relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360002217451775104","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Importance of individual events in temporal networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1360002218619627520","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths"}]},{"@id":"https://cir.nii.ac.jp/crid/1360004237129201536","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Predicting and controlling infectious disease epidemics using temporal networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1360011143621819008","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"An improved algorithm for transitive closure on acyclic digraphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1360011144003054336","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Community detection in directed acyclic graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1360011144032176768","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"GRAIL"}]},{"@id":"https://cir.nii.ac.jp/crid/1360011144502257536","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Temporal networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1360011144647195520","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Probability Inequalities for Sums of Bounded Random Variables"}]},{"@id":"https://cir.nii.ac.jp/crid/1360011145177647104","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Exploiting Temporal Network Structures of Human Interaction to Effectively Immunize Populations"}]},{"@id":"https://cir.nii.ac.jp/crid/1360011146343100288","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Matching Organizational Structure and Social Network Extracted from Email Communication"}]},{"@id":"https://cir.nii.ac.jp/crid/1360292619098006912","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Temporal distance metrics for social network analysis"}]},{"@id":"https://cir.nii.ac.jp/crid/1360292620347541504","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Betweenness in time dependent networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1360292620611646080","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Immunization strategies for epidemic processes in time-varying contact networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1360292620785602432","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Clustering in weighted networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1360292621132832000","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Estimating Potential Infection Transmission Routes in Hospital Wards Using Wearable Proximity Sensors"}]},{"@id":"https://cir.nii.ac.jp/crid/1360292621554054656","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Temporal node centrality in complex networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1360565168574224000","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches"}]},{"@id":"https://cir.nii.ac.jp/crid/1360574095673615488","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Graph Reachability Queries: A Survey"}]},{"@id":"https://cir.nii.ac.jp/crid/1360846641785061632","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A network-based dynamical ranking system for competitive sports"}]},{"@id":"https://cir.nii.ac.jp/crid/1360855568677898880","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Causality-driven slow-down and speed-up of diffusion in non-Markovian temporal networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1360855569417439488","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Complex networks: Structure and dynamics"}]},{"@id":"https://cir.nii.ac.jp/crid/1360855570413979776","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1360855571075092608","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1360855571204660480","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Random walk centrality for temporal networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1361137043803150464","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A memory efficient reachability data structure through bit vector compression"}]},{"@id":"https://cir.nii.ac.jp/crid/1361137044093746176","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Error and attack vulnerability of temporal networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1361137044576560512","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"The architecture of complex weighted networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1361137046017839360","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Communicability in temporal networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1361981468798487296","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Dynamical Processes on Complex Networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1361981469264106752","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Evaluating Temporal Robustness of Mobile Networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1361981469279372416","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A Matrix Iteration for Dynamic Network Summaries"}]},{"@id":"https://cir.nii.ac.jp/crid/1362825893541331840","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Emergence of Communities in Weighted Networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1362825894736682624","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Path lengths, correlations, and centrality in temporal networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1362825894846254976","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"The Structure and Function of Complex Networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1362825894931970688","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Statistical mechanics of complex networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1363107368367111808","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Graph Metrics for Temporal Networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1363107369459786496","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"What's in a crowd? Analysis of face-to-face behavioral networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1363107369915284096","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles"}]},{"@id":"https://cir.nii.ac.jp/crid/1363107370731067776","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Small-world behavior in time-varying graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1363107371182033024","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Connectivity and inference problems for temporal networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1363107371207021824","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Epidemic processes in complex networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1363388844040475008","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Approximating Betweenness Centrality"}]},{"@id":"https://cir.nii.ac.jp/crid/1363670319507229184","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Reachability and Distance Queries via 2-Hop Labels"}]},{"@id":"https://cir.nii.ac.jp/crid/1363951794659377024","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Betweenness Preference: Quantifying Correlations in the Topological Dynamics of Temporal Networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1364233268210648832","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Communicability across evolving networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1364233270969642496","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Temporal graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1364233270973348352","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Path problems in temporal graphs"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1140/epjb/e2016-60498-7"},{"@type":"KAKEN","@value":"PRODUCT-20325622"},{"@type":"OPENAIRE","@value":"doi_dedup___::7f7f776a77af7aeb11913ae5c3e0a526"}]}