Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Temporal network
open-in-new
<h2 id="applicability">Applicability</h2> <p>Time-varying networks are inherently dynamic, and used for modeling <a href="/facts/Complex_contagion/E7EsEMyD">spreading processes</a> on networks. Whether using time-varying networks will be worth the added complexity depends on the relative <a href="/facts/Orders_of_magnitude_(time)/bEovB6Tp">time scales</a> in question. Time-varying networks are most useful in describing systems where the spreading process on a network and the network itself evolve at similar timescales.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> </p><p>Let the characteristic timescale for the evolution of the network be t N {\displaystyle t_{N}} , and the characteristic timescale for the evolution of the spreading process be t P {\displaystyle t_{P}} . A process on a network will fall into one of three categories: </p> <ul><li>Static approximation – where t N ≫ t P {\displaystyle t_{N}\gg t_{P}} . The network evolves relatively slowly, so the dynamics of the process can be approximated using a static version of the network.</li> <li>Time-varying network – where t N ∼ t P {\displaystyle t_{N}\sim t_{P}} . The network and the process evolve at comparable timescales so the interplay between them becomes important.</li> <li>Annealed approximation – where t N ≪ t P {\displaystyle t_{N}\ll t_{P}} . The network evolves relatively rapidly, so the dynamics of the process can be approximated using a time averaged version of the network.</li></ul> <p>The flow of data over the internet is an example for the first case, where the network changes very little in the fraction of a second it takes for a <a href="/facts/Network_packet/xCYf8SJu">network packet</a> to traverse it.<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a> The spread of <a href="/facts/Sexually_transmitted_diseases/IYL1rxdI">sexually transmitted diseases</a> is an example of the second, where the prevalence of the disease spreads in direct correlation to the rate of evolution of the <a href="/facts/Sexual_network/BbpdIhQs">sexual contact network</a> itself.<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a> <a href="/facts/Behavioral_contagion/E0tGrQKW">Behavioral contagion</a> is an example of the third case, where behaviors spread through a population over the combined network of many day-to-day social interactions.<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a> </p> <h2 id="representations">Representations</h2> <p>There are three common representations for time-varying network data.<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a> </p> <ul><li>Contact sequences – if the duration of interactions are negligible, the network can be represented as a set C {\displaystyle C} of contacts ( i , j , t ) {\displaystyle (i,j,t)} where i {\displaystyle i} and j {\displaystyle j} are the nodes and t {\displaystyle t} the time of the interaction. Alternatively, it can be represented as an edge list E {\displaystyle E} where each edge e {\displaystyle e} is a pair of nodes and has a set of active times T e = { t 1 , … , t n } {\displaystyle T_{e}=\{t_{1},\ldots ,t_{n}\}} .</li> <li>Interval graphs – if the duration of interactions are non-negligible, T e {\displaystyle T_{e}} becomes a set of intervals over which the edge e {\displaystyle e} is active. T e = { ( t 1 , t 1 ′ ) , … , ( t n , t n ′ ) } {\displaystyle T_{e}=\{(t_{1},t_{1}'),\ldots ,(t_{n},t_{n}')\}} </li> <li>Snapshots – time-varying networks can also be represented as a series of static networks, one for each time step.</li></ul> <h2 id="properties">Properties</h2> <p>The measures used to characterize static networks are not immediately transferable to time-varying networks. See <a href="/facts/Path_(graph_theory)/WMsq21Nf">Path</a>, <a href="/facts/Connected_component_(graph_theory)/5owVSXtY">Connectedness</a>, <a href="/facts/Distance_(graph_theory)/EmQFKvqa">Distance</a>, <a href="/facts/Centrality/4n24KqLt">Centrality</a>. However, these network concepts have been adapted to apply to time-varying networks. </p> <h3>Time respecting paths</h3> <p>Time respecting paths are the sequences of links that can be traversed in a time-varying network under the constraint that the next link to be traversed is activated at some point after the current one. Like in a <a href="/facts/Directed_graph/YBdfQ0um">directed graph</a>, a path from i {\displaystyle i} to j {\displaystyle j} does not mean there is a path from j {\displaystyle j} to i {\displaystyle i} . In contrast to <a href="/facts/Path_(graph_theory)/WMsq21Nf">paths</a> in static and evolving networks, however, time respecting paths are also <a href="/facts/Intransitivity/eRDjvMDo">non-transitive</a>. That is to say, just because there is a path from i {\displaystyle i} to j {\displaystyle j} and from j {\displaystyle j} to k {\displaystyle k} does not mean that there is a path from i {\displaystyle i} to k {\displaystyle k} . Furthermore, time respecting paths are themselves time-varying, and are only valid paths during a specific time interval.<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a> </p> <h3>Reachability</h3> <p>While analogous to <a href="/facts/Connected_component_(graph_theory)/5owVSXtY">connectedness</a> in static networks, reachability is a time-varying property best defined for each node in the network. The <i>set of influence</i> of a node i {\displaystyle i} is the set of all nodes that can be reached from i {\displaystyle i} via time respecting paths, note that it is dependent on the start time t {\displaystyle t} . The <i>source set</i> of a node i {\displaystyle i} is the set of all nodes that can reach i {\displaystyle i} via time respecting paths within a given time interval. The <i>reachability ratio</i> can be defined as the average over all nodes i {\displaystyle i} of the fraction of nodes within the <i>set of influence</i> of i {\displaystyle i} .<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a> </p><p><a href="/facts/Connected_component_(graph_theory)/5owVSXtY">Connectedness</a> of an entire network is less conclusively defined, although some have been proposed. A component may be defined as strongly connected if there is a directed time respecting path connecting all nodes in the component in both directions. A component may be defined as weakly connected if there is an undirected time respecting path connecting all nodes in the component in both directions.<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a> Also, a component may be defined as transitively connected if <a href="/facts/Transitive_relation/9r90y50r">transitivity</a> holds for the subset of nodes in that component. </p> <h3>Causal fidelity</h3> <p>Causal fidelity quantifies the goodness of the static approximation of a temporal network. Such a static approximation is generated by aggregating the edges of a temporal network over time. The idea of causal fidelity is to compare the number of paths between all node pairs in the temporal network P t e m p {\displaystyle P_{temp}} (that is, all time respecting paths) with the number of paths P s t a t {\displaystyle P_{stat}} between all nodes in the static approximation of the network.<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a> The causal fidelity is then defined by </p> c = P t e m p P s t a t {\displaystyle c={\frac {P_{temp}}{P_{stat}}}} . <p>Since in P t e m p {\displaystyle P_{temp}} only time respecting paths are considered, P t e m p ≤ P s t a t {\displaystyle P_{temp}\leq P_{stat}} , and consequently 0 ≤ c ≤ 1 {\displaystyle 0\leq c\leq 1} . A high causal fidelity c ≈ 1 {\displaystyle c\approx 1} means that the considered temporal network is well approximated by its static (aggregated) counterpart. If c ≪ 1 {\displaystyle c\ll 1} , then most node pairs that are reachable in the static representation are not connected by time respecting paths in the temporal network. </p> <h3>Latency</h3> <p>Also called <i>temporal distance</i>, latency is the time-varying equivalent to <a href="/facts/Distance_(graph_theory)/EmQFKvqa">distance</a>. In a time-varying network any time respecting path has a <i>duration</i>, namely the time it takes to follow that path. The fastest such path between two nodes is the latency, note that it is also dependent on the start time. The latency from node i {\displaystyle i} to node j {\displaystyle j} beginning at time t {\displaystyle t} is denoted by λ i , t ( j ) {\displaystyle \lambda _{i,t}(j)} . </p> <h3>Centrality measures</h3> <p>Measuring centrality on time-varying networks involves a straightforward replacement of distance with latency.<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a> For discussions of the centrality measures on a static network see <a href="/facts/Centrality/4n24KqLt">Centrality</a>. </p> <ul><li>Closeness centrality is large for nodes i {\displaystyle i} that are close to all other nodes (i.e. have small latency λ i ( j ) {\displaystyle \lambda _{i}(j)} for all j {\displaystyle j} )</li></ul> C C ( i , t ) = N − 1 ∑ j ≠ i λ i , t ( j ) {\displaystyle C_{C}(i,t)={\frac {N-1}{\sum _{j\not =i}{\lambda _{i,t}(j)}}}} <ul><li>Betweenness centrality is large for nodes that are often a part of the smallest latency paths between other pairs of nodes. It is defined as the ratio of the number of smallest latency paths from j {\displaystyle j} and k {\displaystyle k} that pass through i {\displaystyle i} to the total number of smallest latency paths from j {\displaystyle j} and k {\displaystyle k} </li></ul> C B ( i , t ) = ∑ i ≠ j ≠ k ν i ( j , k ) ∑ i ≠ j ≠ k ν ( j , k ) {\displaystyle C_{B}(i,t)={\frac {\sum _{i\not =j\not =k}{\nu _{i}(j,k)}}{\sum _{i\not =j\not =k}{\nu _{(}j,k)}}}} The time-varying nature of latency, specifically that it will become infinity for all node pairs as the time approaches the end of the network interval used, makes an alternative measure of closeness useful. Efficiency uses instead the reciprocal of the latency, so the efficiency approaches zero instead of diverging. Higher values for efficiency correspond to more central nodes in the network. C E ( i , t ) = 1 N − 1 ∑ j ≠ i 1 λ i , t ( j ) {\displaystyle C_{E}(i,t)={\frac {1}{N-1}}\sum _{j\not =i}{\frac {1}{\lambda _{i,t}(j)}}} <h3>Temporal patterns</h3> <p>Time-varying network allow for analysis of explicit time dependent properties of the network. It is possible to extract recurring and persistent patterns of contact from time-varying data in many ways. This is an area of ongoing research. </p> <ul><li>Characteristic times of the system can be found by looking for distinct changes in a variable, such as the <i>reachability ratio</i>. For example, if one allows only a finite waiting time at all nodes in calculating latency, one can find interesting patterns in the resulting reachability ratio. For a mobile call network, the reachability ratio has been found to increase dramatically if one allows delays of at least two days, and for the airline network the same effect has been found at around 30 minutes.<a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a> Moreover, the characteristic time scale of a temporal network is given by the mode of the distribution of shortest path durations. This distribution can be calculated using the reachability between all node pairs in the network.<a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a></li> <li>Persistent patterns are ones that reoccur frequently in the system. They can be discovered by averaging over different Δ t {\displaystyle \Delta t} across the time interval of the system and looking for patterns that reoccur over a specified threshold.<a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a></li> <li>Motifs are specific temporal patterns that occur more often the expected in a system. The time-varying network of Facebook wall postings, for example, has higher frequency of chains, stars, and back and forth interactions that could be expected for a randomized network.<a class="footnote-ref" id="fnref:19" href="#fn:19"><sup>19</sup></a></li> <li>Egocentric Temporal motifs can be used to exploit temporal ego-networks. Due to their first-order complexity can be counted in large graphs in a reasonable execution time. For example, Longa et al. <a class="footnote-ref" id="fnref:20" href="#fn:20"><sup>20</sup></a> show how to use Egocentric Temporal Motifs for measuring distances among face-to-face interaction networks in different social contexts.</li> <li>Detecting missing links</li></ul> <h2 id="dynamics">Dynamics</h2> <p>Time-varying networks allow for the analysis of an entirely new dimension of dynamic processes on networks. In cases where the time scales of evolution of the network and the process are similar, the temporal structure of time-varying networks has a dramatic impact on the spread of the process over the network. </p> <h3>Burstiness</h3> <p>The time between two consecutive events, for an individual node or link, is called the <i>inter-event time</i>. The distribution of <i>inter-event times</i> of a growing number of important, real-world, time-varying networks have been found to be <a href="/facts/Burstiness/aVGszauw">bursty</a>, meaning inter-event times are very heterogeneous – they have a <a href="/facts/Heavy-tailed_distribution/BHLSHPku">heavy-tailed distribution</a>. This translates to a pattern of activation where activity comes in bursts separated by longer stretches of inactivity.<a class="footnote-ref" id="fnref:21" href="#fn:21"><sup>21</sup></a> </p><p>Burstiness of inter-event times can dramatically slow spreading processes on networks,<a class="footnote-ref" id="fnref:22" href="#fn:22"><sup>22</sup></a> which has implications for the spread of disease, information, ideas, and computer viruses. However, burstiness can also accelerate spreading processes, and other network properties also have an effect on spreading speed.<a class="footnote-ref" id="fnref:23" href="#fn:23"><sup>23</sup></a> Real-world time-varying networks may thus promote spreading processes despite having a bursty inter-event time distribution.<a class="footnote-ref" id="fnref:24" href="#fn:24"><sup>24</sup></a> </p><p><a href="/facts/Burstiness/aVGszauw">Burstiness</a> as an empirical quantity can be calculated for any sequence of inter-event times, τ {\displaystyle \tau } , by comparing the sequence to one generated by a <a href="/facts/Poisson_process/8uphjAUc">Poisson process</a>. The ratio of the <a href="/facts/Standard_deviation/qSug9BRl">standard deviation</a>, σ {\displaystyle \sigma } , to the <a href="/facts/Mean/swcEd4Pg">mean</a>, m {\displaystyle m} , of a Poisson process is 1. This measure compares σ τ / m τ {\displaystyle \sigma _{\tau }/m_{\tau }\ } to 1. </p> B = σ τ / m τ − 1 σ τ / m τ + 1 {\displaystyle B={\frac {\sigma _{\tau }/m_{\tau }\ -1}{\sigma _{\tau }/m_{\tau }\ +1}}} <p>Burstiness varies from −1 to 1. <i>B</i> = 1 indicates a maximally bursty sequence, <i>B</i> = 0 indicates a Poisson distribution, and <i>B</i> = −1 indicates a periodic sequence.<a class="footnote-ref" id="fnref:25" href="#fn:25"><sup>25</sup></a> </p> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/Complex_contagion/E7EsEMyD">Complex contagion</a></li> <li><a href="/facts/Complex_network/6zTa9z4e">Complex network</a></li> <li><a href="/facts/Epidemic_model/APq4DFha">Epidemic model</a></li> <li><a href="/facts/Directed_percolation/xvRnByH7">Directed percolation</a></li> <li><a href="/facts/Dynamic_network_analysis/vW3scuva">Dynamic network analysis</a></li> <li><a href="/facts/Exponential_random_graph_models/Mozypfpa">Exponential random graph models</a></li> <li><a href="/facts/Link-centric_preferential_attachment/hz1zDLkE">Link-centric preferential attachment</a></li> <li><a href="/facts/Scale-free_network/2ENlcjX3">Scale-free network</a></li> <li><a href="/facts/Percolation_theory/Bop4vG7u">Percolation theory</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Karsai, M.; Perra, N.; Vespignani, A. (2015). "Time-varying networks and the weakness of strong ties" (PDF). Sci. Rep. 4: 4001. arXiv:1303.5966. Bibcode:2014NatSR...4E4001K. doi:10.1038/srep04001. PMC 3918922. PMID 24510159. <a href="http://www.isi.it/wp-content/uploads/publication/document/srep04001_1393320752.pdf" target="_blank">http://www.isi.it/wp-content/uploads/publication/document/srep04001_1393320752.pdf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>J.-P. Eckmann, E. Moses, and D. Sergi. Entropy of dialogues creates coherent structures in e-mail traffic" Proc. Natl. Acad. Sci. USA 2004; 101:14333–14337. https://www.weizmann.ac.il/complex/EMoses/pdf/EntropyDialogues.pdf <a href="https://www.weizmann.ac.il/complex/EMoses/pdf/EntropyDialogues.pdf" target="_blank">https://www.weizmann.ac.il/complex/EMoses/pdf/EntropyDialogues.pdf</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Eagle, N.; Pentland, A. (2006). "Reality mining: sensing complex social systems". Pers Ubiquit Comput. 10 (4): 255–268. doi:10.1007/s00779-005-0046-3. S2CID 1766202. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Stehle, J.; Voirin, N.; Barrat, A.; Cattuto, C.; Colizza, V.; Isella, L.; Regis, C.; Pinton, J.-F.; Khanafer, N.; Vanhems, P. (2011). "Simulation of an SEIR infectious disease model on the dynamic contact network of conference attendees". BMC Medicine. 9: 87. arXiv:1108.4841. doi:10.1186/1741-7015-9-87. PMC 3162551. PMID 21771290. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3162551" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3162551</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Holme, P.; Saramäki, J. (2012). "Temporal Networks". Phys. Rep. 519 (3): 102. arXiv:1108.1780. Bibcode:2012PhR...519...97H. doi:10.1016/j.physrep.2012.03.001. S2CID 1920175. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Holme, P.; Saramäki, J. (2012). "Temporal Networks". Phys. Rep. 519 (3): 99–100. arXiv:1108.1780. Bibcode:2012PhR...519...97H. doi:10.1016/j.physrep.2012.03.001. S2CID 1920175. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>Pastor-Satorras, R., and Alessandro Vespignani. Evolution and Structure of the Internet: A Statistical Physics Approach. Cambridge, UK: Cambridge UP, 2004. <http://fizweb.elte.hu/download/Fizikus-MSc/Infokommunikacios-halozatok-modelljei/Evo-and-Struct-of-Internet.pdf> <a href="http://fizweb.elte.hu/download/Fizikus-MSc/Infokommunikacios-halozatok-modelljei/Evo-and-Struct-of-Internet.pdf" target="_blank">http://fizweb.elte.hu/download/Fizikus-MSc/Infokommunikacios-halozatok-modelljei/Evo-and-Struct-of-Internet.pdf</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>Masuda, N; Holme, P (2013). "Predicting and controlling infectious disease epidemics using temporal networks". F1000Prime Rep. 5: 6. doi:10.12703/P5-6. PMC 3590785. PMID 23513178. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3590785" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3590785</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>Thompson, Clive. "Are Your Friends Making You Fat?" The New York Times. The New York Times, 12 Sept. 2009. Web. <https://www.nytimes.com/2009/09/13/magazine/13contagion-t.html?pagewanted=all&_r=0> <a href="https://www.nytimes.com/2009/09/13/magazine/13contagion-t.html?pagewanted=all&_r=0" target="_blank">https://www.nytimes.com/2009/09/13/magazine/13contagion-t.html?pagewanted=all&_r=0</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>P. Holme, J. Saramäki. Temporal Networks. Phys. Rep. 519, 103–104; 10.1016/j.physrep.2012.03.001 (2012) <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>P. Holme, J. Saramäki. Temporal Networks. Phys. Rep. 519, 104–105; 10.1016/j.physrep.2012.03.001 (2012) <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>Holme, P. (2005). "Network reachability of real-world contact sequences". Phys Rev E. 71 (4): 046119. arXiv:cond-mat/0410313. Bibcode:2005PhRvE..71d6119H. doi:10.1103/physreve.71.046119. PMID 15903738. S2CID 13249467. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>V. Nicosia, J. Tang, M. Musolesi, G. Russo, C. Mascolo, and V. Latora. Components in time-varying graphs. e-print arXiv:1106.2134. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>Lentz, Hartmut H. K.; Selhorst, Thomas; Sokolov, Igor M. (2013-03-11). "Unfolding Accessibility Provides a Macroscopic Approach to Temporal Networks". Physical Review Letters. 110 (11). American Physical Society (APS): 118701. arXiv:1210.2283. Bibcode:2013PhRvL.110k8701L. doi:10.1103/physrevlett.110.118701. ISSN 0031-9007. PMID 25166583. S2CID 10932514. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>Grindrod, P.; Parsons, M. C.; Higham, D. J.; Estrada, E. (2011). "Communicability across evolving networks" (PDF). Phys. Rev. E. 81 (4): 046120. Bibcode:2011PhRvE..83d6120G. doi:10.1103/PhysRevE.83.046120. PMID 21599253. <a href="http://centaur.reading.ac.uk/19357/1/Coomunicability_accepted.pdf" target="_blank">http://centaur.reading.ac.uk/19357/1/Coomunicability_accepted.pdf</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> <li id="fn:16"><p>Pan, R. K.; Saramaki, J. (2011). "Path lengths, correlations, and centrality in temporal networks". Phys. Rev. E. 84 (1): 016105. arXiv:1101.5913. Bibcode:2011PhRvE..84a6105P. doi:10.1103/PhysRevE.84.016105. PMID 21867255. S2CID 9306683. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li> <li id="fn:17"><p>Lentz, Hartmut H. K.; Selhorst, Thomas; Sokolov, Igor M. (2013-03-11). "Unfolding Accessibility Provides a Macroscopic Approach to Temporal Networks". Physical Review Letters. 110 (11). American Physical Society (APS): 118701. arXiv:1210.2283. Bibcode:2013PhRvL.110k8701L. doi:10.1103/physrevlett.110.118701. ISSN 0031-9007. PMID 25166583. S2CID 10932514. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li> <li id="fn:18"><p>M. Lahiri and T. Y. Berger-Wolf. Mining periodic behavior in dynamic social networks. Eighth IEEE International Conference on Data Mining, 2008. http://compbio.cs.uic.edu/papers/LahiriBergerWolf_PeriodicBehavior08.pdf <a href="http://compbio.cs.uic.edu/papers/LahiriBergerWolf_PeriodicBehavior08.pdf" target="_blank">http://compbio.cs.uic.edu/papers/LahiriBergerWolf_PeriodicBehavior08.pdf</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li> <li id="fn:19"><p>Q. Zhao, Y. Tian, Q. He, N. Oliver, R. Jin, and W.-C. Lee.Communication motifs: A tool to characterize social communications. In Proceedings of the 19th ACM international conference on Information and knowledge management, page 1645, 2010. <a href="#fnref:19" class="footnote-back-ref">↩</a></p></li> <li id="fn:20"><p>A. Longa, G. Cencetti, B. Lepri and A. Passerini. An efficient procedure for mining egocentric temporal motifs. In Data Mining and Knowledge Discovery 36.1 (2022): 355-378 <a href="#fnref:20" class="footnote-back-ref">↩</a></p></li> <li id="fn:21"><p>Holme, P.; Saramäki, J. (2012). "Temporal Networks". Phys. Rep. 519 (3): 118–120. arXiv:1108.1780. Bibcode:2012PhR...519...97H. doi:10.1016/j.physrep.2012.03.001. S2CID 1920175. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></p></li> <li id="fn:22"><p>A. Vazquez, B. Racz, A. Lukacs, and A.-L. Barabasi. Impact of non-poissonian activity patterns on spreading processes" Phys. Rev. Lett. 98:158702, 2007. http://journals.aps.org/prl/abstract/10.1103/PhysRevLett.98.158702 <a href="http://journals.aps.org/prl/abstract/10.1103/PhysRevLett.98.158702" target="_blank">http://journals.aps.org/prl/abstract/10.1103/PhysRevLett.98.158702</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></p></li> <li id="fn:23"><p>Horváth, Dávid X; Kertész, János (2014-07-28). "Spreading dynamics on networks: the role of burstiness, topology and non-stationarity". New Journal of Physics. 16 (7): 073037. arXiv:1404.2468. Bibcode:2014NJPh...16g3037H. doi:10.1088/1367-2630/16/7/073037. ISSN 1367-2630. <a href="https://doi.org/10.1088%2F1367-2630%2F16%2F7%2F073037" target="_blank">https://doi.org/10.1088%2F1367-2630%2F16%2F7%2F073037</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></p></li> <li id="fn:24"><p>Gernat, Tim; Rao, Vikyath D.; Middendorf, Martin; Dankowicz, Harry; Goldenfeld, Nigel; Robinson, Gene E. (2018-02-13). "Automated monitoring of behavior reveals bursty interaction patterns and rapid spreading dynamics in honeybee social networks". Proceedings of the National Academy of Sciences. 115 (7): 1433–1438. Bibcode:2018PNAS..115.1433G. doi:10.1073/pnas.1713568115. ISSN 0027-8424. PMC 5816157. PMID 29378954. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5816157" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5816157</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></p></li> <li id="fn:25"><p>Goh, K.-I.; Barabasi, A.-L. (2008). "Burstiness and memory in complex systems" (PDF). EPL. 81 (4): 48002. arXiv:physics/0610233. Bibcode:2008EL.....8148002G. doi:10.1209/0295-5075/81/48002. S2CID 8352442. <a href="http://www.barabasilab.com/pubs/CCNR-ALB_Publications/200802-01_EPL-Burstiness/200802-01_EPL-Burstiness.pdf" target="_blank">http://www.barabasilab.com/pubs/CCNR-ALB_Publications/200802-01_EPL-Burstiness/200802-01_EPL-Burstiness.pdf</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></p></li> </ol>