Limit theorems for additive functionals of some self-similar Gaussian processes
M Hong, H Liu, F Xu - The Annals of Applied Probability, 2024 - projecteuclid.org
Under certain mild conditions, limit theorems for additive functionals of some d-dimensional
self-similar Gaussian processes are obtained. These limit theorems work for general …
self-similar Gaussian processes are obtained. These limit theorems work for general …
On computing large temporal (unilateral) connected components
IL Costa, R Lopes, A Marino, A Silva - International Workshop on …, 2023 - Springer
A temporal (directed) graph is a graph whose edges are available only at specific times
during its lifetime, τ. Paths are sequences of adjacent edges whose appearing times are …
during its lifetime, τ. Paths are sequences of adjacent edges whose appearing times are …
Increasing paths in random temporal graphs
We consider random temporal graphs, a version of the classical Erdős–Rényi random graph
G (n, p) where additionally, each edge has a distinct random time stamp, and connectivity is …
G (n, p) where additionally, each edge has a distinct random time stamp, and connectivity is …
On computing large temporal (unilateral) connected components
C Isnard, L Raul, A Marino… - Journal of Computer …, 2024 - flore.unifi.it
A temporal (directed) graph is one where edges are available only at specific times during
its lifetime, τ. Paths in these graphs are sequences of adjacent edges whose appearing …
its lifetime, τ. Paths in these graphs are sequences of adjacent edges whose appearing …
Rumors with changing credibility
Randomized rumor spreading processes diffuse information on an undirected graph and
have been widely studied. In this work, we present a generic framework for analyzing a …
have been widely studied. In this work, we present a generic framework for analyzing a …
On computing large temporal (unilateral) connected components
IL Costa, R Lopes, A Marino, A Silva - Journal of Computer and System …, 2024 - Elsevier
A temporal (directed) graph is one where edges are available only at specific times during
its lifetime, τ. Paths in these graphs are sequences of adjacent edges whose appearing …
its lifetime, τ. Paths in these graphs are sequences of adjacent edges whose appearing …
A Novel Method for Vertex Clustering in Dynamic Networks
DV Dabke, O Dorabiala - … Conference on Complex Networks and Their …, 2023 - Springer
In this paper, we introduce spatiotemporal graph k-means (STG k M), a novel, unsupervised
method to cluster vertices within a dynamic network. Drawing inspiration from traditional k …
method to cluster vertices within a dynamic network. Drawing inspiration from traditional k …
Algorithmic and structural aspects of temporal graphs
M Renken - 2023 - depositonce.tu-berlin.de
This thesis studies selected structural and algorithmic aspects of temporal graphs, which are
graphs whose edges are present only at specific points in time. Temporal graphs are well …
graphs whose edges are present only at specific points in time. Temporal graphs are well …
[PDF][PDF] Increasing paths in the temporal stochastic block model Discrete Mathematics Days 2024
S Burova, G Lugosi, G Perarnau - Discrete Mathematics Days …, 2024 - dmd2024.web.uah.es
We study random temporal graphs, in the context of the Stochastic Block Model. Temporal
graphs naturally model time-dependent propagation processes, for instance social …
graphs naturally model time-dependent propagation processes, for instance social …