scholarly journals Influence of individual nodes for continuous-time susceptible-infected-susceptible dynamics on synthetic and real-world networks

2021 ◽  
Vol 104 (1) ◽  
Author(s):  
Alfredo De Bellis ◽  
Romualdo Pastor-Satorras ◽  
Claudio Castellano
Author(s):  
Debarun Bhattacharjya ◽  
Dharmashankar Subramanian ◽  
Tian Gao

Many real-world domains involve co-evolving relationships between events, such as meals and exercise, and time-varying random variables, such as a patient's blood glucose levels. In this paper, we propose a general framework for modeling joint temporal dynamics involving continuous time transitions of discrete state variables and irregular arrivals of events over the timeline. We show how conditional Markov processes (as represented by continuous time Bayesian networks) and multivariate point processes (as represented by graphical event models) are among various processes that are covered by the framework. We introduce and compare two simple and interpretable yet practical joint models within the framework with relevant baselines on simulated and real-world datasets, using a graph search algorithm for learning. The experiments highlight the importance of jointly modeling event arrivals and state variable transitions to better fit joint temporal datasets, and the framework opens up possibilities for models involving even more complex dynamics whenever suitable.


2018 ◽  
Vol 45 (2) ◽  
pp. 156-168 ◽  
Author(s):  
Mahsa Seifikar ◽  
Saeed Farzi

Recently, social networks have provided an important platform to detect trends of real-world events. The trends of real-world events are detected by analysing flow of massive bulks of data in continuous time steps over various social media platforms. Today, many researchers have been interested in detecting social network trends, in order to analyse the gathered information for enabling users and organisations to satisfy their information need. This article is aimed at complete surveying the recent text-based trend detection approaches, which have been studied from three perspectives (algorithms, dimension and diversity of events). The advantages and disadvantages of the considered approaches have also been paraphrased separately to illustrate a comprehensive view of the previous works and open problems.


2020 ◽  
Vol 10 (1) ◽  
Author(s):  
F. Di Lauro ◽  
J.-C. Croix ◽  
M. Dashti ◽  
L. Berthouze ◽  
I. Z. Kiss

Abstract Using the continuous-time susceptible-infected-susceptible (SIS) model on networks, we investigate the problem of inferring the class of the underlying network when epidemic data is only available at population-level (i.e., the number of infected individuals at a finite set of discrete times of a single realisation of the epidemic), the only information likely to be available in real world settings. To tackle this, epidemics on networks are approximated by a Birth-and-Death process which keeps track of the number of infected nodes at population level. The rates of this surrogate model encode both the structure of the underlying network and disease dynamics. We use extensive simulations over Regular, Erdős–Rényi and Barabási–Albert networks to build network class-specific priors for these rates. We then use Bayesian model selection to recover the most likely underlying network class, based only on a single realisation of the epidemic. We show that the proposed methodology yields good results on both synthetic and real-world networks.


2021 ◽  
Vol 9 ◽  
Author(s):  
Werner Krauth

This review treats the mathematical and algorithmic foundations of non-reversible Markov chains in the context of event-chain Monte Carlo (ECMC), a continuous-time lifted Markov chain that employs the factorized Metropolis algorithm. It analyzes a number of model applications and then reviews the formulation as well as the performance of ECMC in key models in statistical physics. Finally, the review reports on an ongoing initiative to apply ECMC to the sampling problem in molecular simulation, i.e., to real-world models of peptides, proteins, and polymers in aqueous solution.


2021 ◽  
Author(s):  
Vinayak Gupta ◽  
Srikanta Bedathur

A large fraction of data generated via human activities such as online purchases, health records, spatial mobility etc. can be represented as continuous-time event sequences (CTES) i.e. sequences of discrete events over a continuous time. Learning neural models over CTES is a non-trivial task as it involves modeling the ever-increasing event timestamps, inter-event time gaps, event types, and the influences between different events within and across different sequences. Moreover, existing sequence modeling techniques consider a complete observation scenario i.e. the event sequence being modeled is completely observed with no missing events – an ideal setting that is rarely applicable in real-world applications. In this paper, we highlight our approach[8] for modeling CTES with intermittent observations. Buoyed by the recent success of neural marked temporal point processes (MTPP) for modeling the generative distribution of CTES, we provide a novel unsupervised model and inference method for learning MTPP in presence of event sequences with missing events. Specifically, we first model the generative processes of observed events and missing events using two MTPP, where the missing events are represented as latent random variables. Then, we devise an unsupervised training method that jointly learns both the MTPP using variational inference. Experiments across real-world datasets show that our modeling framework outperforms state-of-the-art techniques for future event prediction and imputation. This work appeared in AISTATS 2021.


Author(s):  
Yuxuan Liang ◽  
Kun Ouyang ◽  
Hanshu Yan ◽  
Yiwei Wang ◽  
Zekun Tong ◽  
...  

Recent advances in location-acquisition techniques have generated massive spatial trajectory data. Recurrent Neural Networks (RNNs) are modern tools for modeling such trajectory data. After revisiting RNN-based methods for trajectory modeling, we expose two common critical drawbacks in the existing uses. First, RNNs are discrete-time models that only update the hidden states upon the arrival of new observations, which makes them an awkward fit for learning real-world trajectories with continuous-time dynamics. Second, real-world trajectories are never perfectly accurate due to unexpected sensor noise. Most RNN-based approaches are deterministic and thereby vulnerable to such noise. To tackle these challenges, we devise a novel method entitled TrajODE for more natural modeling of trajectories. It combines the continuous-time characteristic of Neural Ordinary Differential Equations (ODE) with the robustness of stochastic latent spaces. Extensive experiments on the task of trajectory classification demonstrate the superiority of our framework against the RNN counterparts.


2018 ◽  
Vol 55 (3) ◽  
pp. 900-919
Author(s):  
A. Garavaglia ◽  
R. van der Hofstad

Abstract Continuous-time branching processes (CTBPs) are powerful tools in random graph theory, but are not appropriate to describe real-world networks since they produce trees rather than (multi)graphs. In this paper we analyze collapsed branching processes (CBPs), obtained by a collapsing procedure on CTBPs, in order to define multigraphs where vertices have fixed out-degree m≥2. A key example consists of preferential attachment models (PAMs), as well as generalized PAMs where vertices are chosen according to their degree and age. We identify the degree distribution of CBPs, showing that it is closely related to the limiting distribution of the CTBP before collapsing. In particular, this is the first time that CTBPs are used to investigate the degree distribution of PAMs beyond the tree setting.


2019 ◽  
Vol 4 (1) ◽  
Author(s):  
Siddharth Pal ◽  
Feng Yu ◽  
Yitzchak Novick ◽  
Ananthram Swami ◽  
Amotz Bar-Noy

Abstract The friendship paradox is the observation that friends of individuals tend to have more friends or be more popular than the individuals themselves. In this work, we first study local metrics to capture the strength of the paradox and the direction of the paradox from the perspective of individual nodes, i.e., an indication of whether the individual is more or less popular than its friends. These local metrics are aggregated, and global metrics are proposed to express the phenomenon on a network-wide level. Theoretical results show that the defined metrics are well-behaved enough to capture the friendship paradox. We also theoretically analyze the behavior of the friendship paradox for popular network models in order to understand regimes where friendship paradox occurs. These theoretical findings are complemented by experimental results on both network models and real-world networks. By conducting a correlation study between the proposed metrics and degree assortativity, we experimentally demonstrate that the phenomenon of the friendship paradox is related to the well-known phenomenon of assortative mixing.


Author(s):  
Kostas Chlouverakis

This chapter describes the fundamental concepts of continuous-time chaotic dynamical systems so as to make the book self-contained and readable by fairly unfamiliar people with using simple chaotic systems and understanding their chaotic properties, but also by experts who desire to refine their knowledge regarding chaos theory. It will also define the sense in which a chaotic system is suitable for real-world applications such as encryption.


Author(s):  
Abdellah Benzaouia ◽  
Fouad Mesquine ◽  
Mohamed Benhayoun ◽  
Abdoulaziz Ben Braim

Continuous-time fractional linear systems with delays, asymmetrical bounds on control and non-negative states are considered. Hence, the stabilization problem is studied and solved. A direct Lyapunov–Krasovskii function is used leading to conditions in terms of a linear program (LP). Simulation difficulties and numerical problems raised by the use of the Mittag-Leffler expression are overcome. In fact, the obtained solution uses the fractional integration of the system dynamic. Illustrative examples are presented to show the effectiveness of the results. First, a numerical one is given to demonstrate the applicability of the obtained conditions. Second, an application on a real world example is provided to highlight the usefulness of the approach.


Sign in / Sign up

Export Citation Format

Share Document