An introduction to temporal graphs: An algorithmic perspective
O Michail - Internet Mathematics, 2016 - Taylor & Francis
A temporal graph is, informally speaking, a graph that changes with time. When time is
discrete and only the relationships between the participating entities may change and not …
discrete and only the relationships between the participating entities may change and not …
Flooding time in edge-markovian dynamic graphs
We introduce stochastic time-dependency in evolving graphs: starting from an arbitrary initial
edge probability distribution, at every time step, every edge changes its state (existing or not) …
edge probability distribution, at every time step, every edge changes its state (existing or not) …
Information spreading in stationary markovian evolving graphs
Markovian evolving graphs are dynamic-graph models where the links among a fixed set of
nodes change during time according to an arbitrary Markovian rule. They are extremely …
nodes change during time according to an arbitrary Markovian rule. They are extremely …
Parsimonious flooding in dynamic graphs
An edge-Markovian process with birth-rate p and death-rate q generates sequences of
graphs (G 0, G 1, G 2,…) with the same node set [n] such that Gt is obtained from G t− 1 as …
graphs (G 0, G 1, G 2,…) with the same node set [n] such that Gt is obtained from G t− 1 as …
An introduction to temporal graphs: An algorithmic perspective
O Michail - … , Probability, Networks, and Games: Scientific Papers …, 2015 - Springer
A temporal graph is, informally speaking, a graph that changes with time. When time is
discrete and only the relationships between the participating entities may change and not …
discrete and only the relationships between the participating entities may change and not …
Dynamic graph properties of mobile networks under levy walk mobility
The performance of many algorithms in dynamic networks depends on the properties of the
underlying graph representing the network. Since such a graph is inherently time-varying …
underlying graph representing the network. Since such a graph is inherently time-varying …
Modeling and analysis of time-varying graphs
We live in a world increasingly dominated by networks--communications, social, information,
biological etc. A central attribute of many of these networks is that they are dynamic, that is …
biological etc. A central attribute of many of these networks is that they are dynamic, that is …
Random walks on evolving graphs with recurring topologies
O Denysyuk, L Rodrigues - International Symposium on Distributed …, 2014 - Springer
In this paper we consider dynamic networks that can change over time. Often, such networks
have a repetitive pattern despite constant and otherwise unpredictable changes. Based on …
have a repetitive pattern despite constant and otherwise unpredictable changes. Based on …
[HTML][HTML] Cover time in edge-uniform stochastically-evolving graphs
We define a general model of stochastically-evolving graphs, namely the edge-uniform
stochastically-evolving graphs. In this model, each possible edge of an underlying general …
stochastically-evolving graphs. In this model, each possible edge of an underlying general …
Efficient mean shift belief propagation for vision tracking
A mechanism for efficient mean-shift belief propagation (MSBP) is introduced. The novelty of
our work is to use mean-shift to perform nonparametric mode-seeking on belief surfaces …
our work is to use mean-shift to perform nonparametric mode-seeking on belief surfaces …