Results 41 to 50 of about 381,739 (304)
Phase Transitions in the Kinetic Ising Model on the Temporal Directed Random Regular Graph
Frontiers in Physics, 2017 We investigate a kinetic Ising model with the Metropolis algorithm on the temporal directed random q-regular graph. We introduce a rewiring time τ as a parameter of the model and show that there is a critical τ = τ* above which the model exhibits ...
Grzegorz Marcjasz +1 more
doaj +1 more source
Embedding and Trajectories of Temporal Networks
IEEE Access, 2023 Temporal network data are increasingly available in various domains, and often represent highly complex systems with intricate structural and temporal evolutions. Due to the difficulty of processing such complex data, it may be useful to coarse grain temporal network data into a numeric trajectory embedded in a low-dimensional space. We refer to such a
Chanon Thongprayoon +2 more
openaire +3 more sources
CoRR, 2015 8 pages, 3 figures, presented at the 2004 conference on Neural Information Processing Systems. in Advances in Neural Information Processing Systems 17 (proceedings of the 2004 conference), Saul, L. K., Weiss, Y., and Bottou, L. (Eds)
Richard S. Sutton, Brian Tanner
openaire +3 more sources
Journal of Statistical Software, 2020 Many real-world systems are profitably described as complex networks that grow over time. Preferential attachment and node fitness are two simple growth mechanisms that not only explain certain structural properties commonly observed in real-world ...
Thong Pham +2 more
doaj +1 more source
Community Detection for Temporal Weighted Bipartite Networks
, 2023 Community detection of temporal (time-evolving) bipartite networks is challenging because it can be performed either on the temporal bipartite network, or on various projected networks, composed of only one type of nodes, via diverse community detection ...
Fernández Robledo, O. (author) +3 more
core +1 more source
CoRR, 2015 Simple Temporal Networks (STNs) provide a powerful and general tool for representing conjunctions of maximum delay constraints over ordered pairs of temporal variables. In this paper we introduce Hyper Temporal Networks (HyTNs), a strict generalization of STNs, to overcome the limitation of considering only conjunctions of constraints but maintaining a
COMIN, CARLO +2 more
openaire +2 more sources
Random walk centrality for temporal networks
New Journal of Physics, 2014 Nodes can be ranked according to their relative importance within a network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based on random walks,
Luis E C Rocha, Naoki Masuda
doaj +1 more source
Research on K-truss Community Search Algorithm for Temporal Networks
Jisuanji kexue yu tansuo, 2020 In applications such as communication network, collaboration network and social network analysis, time stamps are usually included on the edge. However, most previous studies focus on identifying communities in networks without time information.
XU Lantian, LI Ronghua, WANG Guoren, WANG Biao
doaj +1 more source
Temporal Effects in the Growth of Networks [PDF]
Physical Review Letters, 2011 We show that to explain the growth of the citation network by preferential attachment (PA), one has to accept that individual nodes exhibit heterogeneous fitness values that decay with time. While previous PA-based models assumed either heterogeneity or decay in isolation, we propose a simple analytically treatable model that combines these two factors.
MEDO M, CIMINI G, GUALDI S
openaire +6 more sources
Effects of memory on spreading processes in non-Markovian temporal networks
New Journal of Physics, 2019 Many biological, social and man-made systems are better described in terms of temporal networks, i.e. networks whose links are only present at certain points in time, rather than by static ones. In particular, it has been found that non-Markovianity is a
Oliver E Williams +2 more
doaj +1 more source