检索结果-内蒙古大学图书馆

SI-spreading-based network embedding in static and temporal networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhan, Xiu-Xiu Li, Ziyu Masuda, Naoki Holme, Petter Wang, Huijuan Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Mekelweg 4 Delft2628 CD Netherlands Department of Mathematics University at Buffalo State University of New York Buffalo New YorkNY14260-2900 United States Computational and Data-Enabled Science and Engineering Program University at Buffalo State University of New York Buffalo New YorkNY14260-2900 United States Institute of Innovative Research Tokyo Institute of Technology Yokohama226-8503 Japan

Link prediction can be used to extract missing information, identify spurious interactions as well as forecast network evolution. Network embedding is a methodology to assign coordinates to nodes in a low-dimensional vector space. By embedding nodes into vectors, the link prediction problem can be converted into a similarity comparison task. Nodes with similar embedding vectors are more likely to be connected. Classic network embedding algorithms are random-walk-based. They sample trajectory paths via random walks and generate node pairs from the trajectory paths. The node pair set is further used as the input for a Skip-Gram model, a representative language model that embeds nodes (which are regarded as words) into vectors. In the present study, we propose to replace random walk processes by a spreading process, namely the susceptible-infected (SI) model, to sample paths. Specifically, we propose two SI-spreading-based algorithms, SINE and TSINE, to embed static and temporal networks, respectively. The performance of our algorithms is evaluated by the missing link prediction task in comparison with state-of-the-art static and temporal network embedding algorithms. Results show that SINE and TSINE outperform the baselines across all six empirical datasets. We further find that the performance of SINE is mostly better than TSINE, suggesting that temporal information does not necessarily improve the embedding for missing link prediction. Moreover, we study the effect of the sampling size, quantified as the total length of the trajectory paths, on the performance of the embedding algorithms. The better performance of SINE and TSINE requires a smaller sampling size in comparison with the baseline algorithms. Hence, SI-spreading-based embedding tends to be more applicable to large-scale networks. Copyright © 2020, The Authors. All rights reserved.

关键词： Network embeddings

Critical mass effect in evolutionary games triggered by zealots

学校读者我要写书评

暂无评论

Physical Review Research 2020年第2期2卷 023305-023305页

作者： Alessio Cardillo Naoki Masuda Department of Engineering Mathematics University of Bristol Bristol BS8 1UB United Kingdom Department of Computer Science and Mathematics University Rovira i Virgili E-43007 Tarragona Spain GOTHAM Lab – Institute for Biocomputation and Physics of Complex Systems (BIFI) University of Zaragoza E-50018 Zaragoza Spain Department of Mathematics State University of New York at Buffalo Buffalo New York 14260-2900 USA Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo Buffalo New York 14260-5030 USA

Tiny perturbations may trigger large responses in systems near criticality, shifting them across equilibria. Committed minorities are suggested to be responsible for the emergence of collective behaviors in many physical, social, and biological systems. Using evolutionary game theory, we address the question whether a finite fraction of zealots can drive the system to large-scale coordination. We find that a tipping point exists in coordination games, whereas the same phenomenon depends on the selection pressure, update rule, and network structure in other types of games. Our study paves the way to understand social systems driven by the individuals' benefit in the presence of zealots, such as human vaccination behavior or cooperative transports in animal groups.

关键词： Patterns in complex systems Social systems

Opinion dynamics on tie-decay networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Sugishita, Kashin Porter, Mason A. Beguerisse-Díaz, Mariano Masuda, Naoki Department of Mathematics State University of New York at Buffalo BuffaloNY14260-2900 United States Department of Mathematics University of California Los AngelesCA90095 United States Mathematical Institute University of Oxford OxfordOX2 6GG United Kingdom Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo BuffaloNY14260-5030 United States Faculty of Science and Engineering Waseda University Tokyo169-8555 Japan

In social networks, interaction patterns typically change over time. We study opinion dynamics on tie-decay networks in which tie strength increases instantaneously when there is an interaction and decays exponentially between interactions. Specifically, we formulate continuous-time Laplacian dynamics and a discrete-time DeGroot model of opinion dynamics on these tie-decay networks, and we carry out numerical computations for the continuous-time Laplacian dynamics. We examine the speed of convergence by studying the spectral gaps of combinatorial Laplacian matrices of tie-decay networks. First, we compare the spectral gaps of the Laplacian matrices of tie-decay networks that we construct from empirical data with the spectral gaps for corresponding randomized and aggregate networks. We find that the spectral gaps for the empirical networks tend to be smaller than those for the randomized and aggregate networks. Second, we study the spectral gap as a function of the tie-decay rate and time. Intuitively, we expect small tie-decay rates to lead to fast convergence because the influence of each interaction between two nodes lasts longer for smaller decay rates. Moreover, as time progresses and more interactions occur, we expect eventual convergence. However, we demonstrate that the spectral gap need not decrease monotonically with respect to the decay rate or increase monotonically with respect to time. Our results highlight the importance of the interplay between the times that edges strengthen and decay in temporal networks. Copyright © 2020, The Authors. All rights reserved.

关键词： Laplace transforms

Model reduction with memory and the machine learning of dynamical systems

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Ma, Chao Wang, Jianchun Weinan, E. Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States Department of Mechanics and Aerospace Engineering Southern University of Science and Technology Shenzhen518055 China Beijing Institute of Big Data Research Beijing100871 China

The well-known Mori-Zwanzig theory tells us that model reduction leads to memory effect. For a long time, modeling the memory effect accurately and efficiently has been an important but nearly impossible task in developing a good reduced model. In this work, we explore a natural analogy between recurrent neural networks and the Mori-Zwanzig formalism to establish a systematic approach for developing reduced models with memory. Two training models-a direct training model and a dynamically coupled training model-are proposed and compared. We apply these methods to the Kuramoto-Sivashinsky equation and the Navier-Stokes equation. Numerical experiments show that the proposed method can produce reduced model with good performance on both short-term prediction and long-term statistical properties. Copyright © 2018, The Authors. All rights reserved.

关键词： Recurrent neural networks

Critical mass effect in evolutionary games triggered by zealots

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Cardillo, Alessio Masuda, Naoki Department of Engineering Mathematics University of Bristol BristolBS8 1UB United Kingdom Department of Computer Science and Mathematics University Rovira i Virgili TarragonaE-43007 Spain University of Zaragoza ZaragozaE-50018 Spain Department of Mathematics University at Buffalo BuffaloNY14260-2900 United States Computational and Data-Enabled Science and Engineering Program University at Buffalo State University of New York BuffaloNY14260-5030 United States

Tiny perturbations may trigger large responses in systems near criticality, shifting them across equilibria. Committed minorities are suggested to be responsible for the emergence of collective behaviors in many physical, social, and biological systems. Using evolutionary game theory, we address the question whether a finite fraction of zealots can drive the system to large-scale coordination. We find that a tipping point exists in coordination games, whereas the same phenomenon depends on the selection pressure, update rule, and network structure in other types of games. Our study paves the way to understand social systems driven by the individuals’ benefit in presence of zealots, such as human vaccination behavior or cooperative transports in animal groups. Copyright © 2019, The Authors. All rights reserved.

关键词： Game theory

Temporal networks provide a unifying understanding of the evolution of cooperation

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Aming Meng, Yao Zhou, Lei Masuda, Naoki Wang, Long Center for Systems and Control College of Engineering Peking University Beijing100871 China Center for Multi-Agent Research Institute for Artificial Intelligence Peking University Beijing100871 China School of Automation Beijing Institute of Technology Beijing100081 China Department of Mathematics State University of New York at Buffalo BuffaloNY14260 United States Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo BuffaloNY14260 United States

Understanding the evolution of cooperation in structured populations represented by networks is a problem of long research interest, and a most fundamental and widespread property of social networks related to cooperation phenomena is that the node’s degree (i.e., number of edges connected to the node) is heterogeneously distributed. Previous results indicate that static heterogeneous (i.e., degree-heterogeneous) networks promote cooperation in stationarity compared to static regular (i.e., degree-homogeneous) networks if equilibrium dynamics starting from many cooperators and defectors is employed. However, the above conclusion reverses if we employ non-equilibrium stochastic processes to measure the fixation probability for cooperation, i.e., the probability that a single cooperator successfully invades a population. Here we resolve this conundrum by analyzing the fixation of cooperation on temporal (i.e., time-varying) networks. We theoretically prove and numerically confirm that on both synthetic and empirical networks, contrary to the case of static networks, temporal heterogeneous networks can promote cooperation more than temporal regular networks in terms of the fixation probability of cooperation. Given that the same conclusion is known for the equilibrium fraction of cooperators on temporal networks, the present results provide a unified understanding of the effect of temporal degree heterogeneity on promoting cooperation across two main analytical frameworks, i.e., equilibrium and non-equilibrium ones. Copyright © 2023, The Authors. All rights reserved.

关键词： Heterogeneous networks

Forecasting Vegetation Health in the MENA Region by Predicting Vegetation Indicators with Machine Learning Models

学校读者我要写书评

暂无评论

Forecasting Vegetation Health in the MENA Region by Predicti...

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： Sachi Perera Wenzhao Li Erik Linstead Hesham El-Askary Computational and Data Sciences Graduate Program Schmid College of Science and Technology Chapman University Orange CA USA Schmid College of Science and Technology Chapman University Orange CA USA Fowler School of Engineering Chapman University Orange CA USA Faculty of Science Alexandria University Alexandria Egypt

ISBN: (数字)9781728163741

ISBN: (纸本)9781728163758

Machine learning (ML) techniques can be applied to predict and monitor drought conditions due to climate change. Predicting future vegetation health indicators (such as EVI, NDVI, and LAI) is one approach to forecast drought events for hotspots (e.g. Middle East and North Africa (MENA) regions). Recently, ML models were implemented to predict EVI values using parameters such as land types, time series, historical vegetation indices, land surface temperature, soil moisture, evapotranspiration etc. In this work, we collected the MODIS atmospherically corrected surface spectral reflectance imagery with multiple vegetation related indices for modeling and evaluation of drought conditions in the MENA region. These models are built by a total of 4556 and 519 normalized samples for training and testing purposes, respectively and with 51820 samples used for model evaluation. Models such as multilinear regression, penalized regression models, support vector regression (SVR), neural network, instance-based learning K-nearest neighbor (KNN) and partial least squares were implemented to predict future values of EVI. The models show effective performance in predicting EVI values (R 2 > 0.95) in the testing and (R 2 > 0.93) in the evaluation process.

关键词： Vegetation mapping MODIS Atmospheric modeling Remote sensing Predictive models Training Support vector machines

Advancing the Use of Longitudinal Electronic Health Records: Tutorial for Uncovering Real-World Evidence in Chronic Disease Outcomes

学校读者我要写书评

暂无评论

Journal of medical Internet research 2025年 27卷 e71873页

作者： Feiqing Huang Jue Hou Ningxuan Zhou Kimberly Greco Chenyu Lin Sara Morini Sweet Jun Wen Lechen Shen Nicolas Gonzalez Sinian Zhang Katherine P Liao Tianrun Cai Zongqi Xia Florence T Bourgeois Tianxi Cai Department of Biostatistics Harvard T.H. Chan School of Public Health Boston MA United States. Harvard-MIT Center for Regulatory Science Harvard Medical School Boston MA United States. Division of Biostatistics and Health Data Science School of Public Health University of Minnesota Minneapolis MN United States. Department of Biomedical Informatics Harvard Medical School Boston MA United States. Department of Engineering University of Toronto Toronto ON Canada. Division of Rheumatology Inflammation and Immunity Brigham and Women's Hospital Boston MA United States. Department of Neurology University of Pittsburgh Pittsburgh PA United States. Computational Health Informatics Program (CHIP) Boston Children's Hospital Boston MA United States. Department of Pediatrics Harvard Medical School Boston MA United States.

Managing chronic diseases requires ongoing monitoring of disease activity and therapeutic responses to optimize treatment plans. With the growing availability of disease-modifying therapies, it is crucial to investigate comparative effectiveness and long-term outcomes beyond those available from randomized clinical trials. We introduce a comprehensive pipeline for generating reproducible and generalizable real-world evidence on disease outcomes by leveraging electronic health record data. The pipeline first generates scalable disease outcomes by linking electronic health record data with registry data containing a small sample of labeled outcomes. It then applies causal analysis using these scalable outcomes to evaluate therapies for chronic diseases. The implementation of the pipeline is illustrated in a case study based on multiple sclerosis. Our approach addresses challenges in real-world evidence generation for disease activity of chronic conditions, specifically the lack of direct observations on key outcomes and biases arising from imperfect or incomplete data. We present advanced machine learning techniques such as semisupervised and ensemble methods to impute missing outcome data, further incorporating steps for calibrated causal analyses and bias correction.

关键词： calibration causal inference chronic disease outcomes data imputation electronic health records longitudinal disease activity machine learning real-world evidence

Multilevel Monte Carlo for a class of Partially Observed Processes in Neuroscience

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Maama, Mohamed Jasra, Ajay Kamatani, Kengo Applied Mathematics and Computational Science Program Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia School of Data Science The Chinese University of Hong Kong CN Shenzhen China Institute of Statistical Mathematics Tokyo190-0014 Japan

In this paper we consider Bayesian parameter inference associated to a class of partially observed stochastic differential equations (SDE) driven by jump processes. Such type of models can be routinely found in applications, of which we focus upon the case of neuroscience. The data are assumed to be observed regularly in time and driven by the SDE model with unknown parameters. In practice the SDE may not have an analytically tractable solution and this leads naturally to a time-discretization. We adapt the multilevel Markov chain Monte Carlo method of [15], which works with a hierarchy of time discretizations and show empirically and theoretically that this is preferable to using one single time discretization. The improvement is in terms of the computational cost needed to obtain a pre-specified numerical error. Our approach is illustrated on models applied to examples of Bayesian inference problems using both simulated and real observed data from neuroscience. Copyright © 2023, The Authors. All rights reserved.

关键词： Stochastic systems