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

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

Estimating international trade status of countries from global liner shipping networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Xu, Mengqiao Pan, Qian Xia, Haoxiang Masuda, Naoki School of Economics and Management Dalian University of Technology No. 2 Linggong Road Ganjingzi District Dalian City Liaoning Province116024 China 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

Maritime shipping is a backbone of international trade and thus the world economy. Vessels travel from a port of one country to another on networks of ports to carry cargos, which contribute to countries’ international trade values. We hypothesize that ports that involve transshipment activities serve as a third-party middleman to mediate trade between two foreign countries and contribute to the corresponding country's status in international trade. We test this hypothesis using a port-level data set of global liner shipping services. We propose two indices that quantify the importance of countries in the global liner shipping network and show that they explain a large amount of variation in the international trade value and related measures of individual countries. These results support a long-standing view in maritime economics, which has yet been directly tested, that countries that are strongly integrated into the global maritime transportation network have enhanced access to global markets and trade opportunities. Copyright © 2020, The Authors. All rights reserved.

关键词： International trade

Transient crosslinking kinetics optimize gene cluster interactions

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Walker, Benjamin Taylor, Dane Lawrimore, Josh Hult, Caitlin Adalsteinsson, David Bloom, Kerry Gregory Forest, M. Department of Mathematics University of North Carolina at Chapel Hill Department of Mathematics University at Buffalo State University of New York Computational and Data Enabled Science and Engineering University at Buffalo State University of New York Department of Microbiology and Immunology University of Michigan Medical School Department of Chemical Engineering University of Michigan Departments of Applied Physical Sciences and Biomedical Engineering University of North Carolina at Chapel Hill Department of Biology University of North Carolina at Chapel Hill

Our understanding of how chromosomes structurally organize and dynamically interact has been revolutionized through the lens of long-chain polymer physics. Major protein contributors to chromosome structure and dynamics are condensin and cohesin that stochastically generate loops within and between chains, and entrap proximal strands of sister chromatids. In this paper, we explore the ability of transient, protein-mediated, gene-gene crosslinks to induce clusters of genes, thereby dynamic architecture, within the highly repeated ribosomal DNA that comprises the nucleolus of budding yeast. We implement three approaches: live cell microscopy;computational modeling of the full genome during G1 in budding yeast, exploring four decades of timescales for transient crosslinks between 5kbp domains (genes) in the nucleolus on Chromosome XII;and, temporal network models with automated community (cluster) detection algorithms applied to the full range of 4D modeling datasets. The data analysis tools detect and track gene clusters, their size, number, persistence time, and their plasticity (deformation). Of biological significance, our analysis reveals an optimal mean crosslink lifetime that promotes pairwise and cluster gene interactions through "flexible" clustering. In this state, large gene clusters self-assemble yet frequently interact (merge and separate), marked by gene exchanges between clusters, which in turn maximizes global gene interactions in the nucleolus. This regime stands between two limiting cases each with far less global gene interactions: with shorter crosslink lifetimes, "rigid" clustering emerges with clusters that interact infrequently;with longer crosslink lifetimes, there is a dissolution of clusters. These observations are compared with imaging experiments on a normal yeast strain and two condensin-modified mutant cell strains. We apply the same image analysis pipeline to the experimental and simulated datasets, providing support for the modeling pred

关键词： Genes

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

Modeling of Measurement Error in Financial Returns data

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Jasra, Ajay Maama, Mohamed Mijatović, Aleksandar School of Data Science The Chinese University of Hong Kong Shenzhen China 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 Department of Statistics University of Warwick United Kingdom

In this paper we consider the modeling of measurement error for fund returns data. In particular, given access to a time-series of discretely observed log-returns and the associated maximum over the observation period, we develop a stochastic model which models the true log-returns and maximum via a Lévy process and the data as a measurement error there-of. The main technical difficulty of trying to infer this model, for instance Bayesian parameter estimation, is that the joint transition density of the return and maximum is seldom known, nor can it be simulated exactly. Based upon the novel stick breaking representation of [12] we provide an approximation of the model. We develop a Markov chain Monte Carlo (MCMC) algorithm to sample from the Bayesian posterior of the approximated posterior and then extend this to a multilevel MCMC method which can reduce the computational cost to approximate posterior expectations, relative to ordinary MCMC. We implement our methodology on several applications including for real data. Copyright © 2024, The Authors. All rights reserved.

关键词： Markov chains

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

Higher-order rich-club phenomenon in collaborative research grant networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Nakajima, Kazuki Shudo, Kazuyuki Masuda, Naoki Department of Mathematical and Computing Science Tokyo Institute of Technology Meguro-ku Tokyo152-8552 Japan Department of Mathematics State University of New York at Buffalo Buffalo14260 United States Academic Center for Computing and Media Studies Kyoto University Sakyo-ku Kyoto606-8501 Japan Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo Buffalo14260 United States Faculty of Science and Engineering Waseda University Tokyo169-8555 Japan

Modern scientific work, including writing papers and submitting research grant proposals, increasingly involves researchers from different institutions. In grant collaborations, it is known that institutions involved in many collaborations tend to densely collaborate with each other, forming rich clubs. Here we investigate higher-order rich-club phenomena in networks of collaborative research grants among institutions and their associations with research impact. Using publicly available data from the National science Foundation in the US, we construct a bipartite network of institutions and collaborative grants, which distinguishes among the collaboration with different numbers of institutions. By extending the concept and algorithms of the rich club for dyadic networks to the case of bipartite networks, we find rich clubs both in the entire bipartite network and the bipartite subnetwork induced by the collaborative grants involving a given number of institutions up to five. We also find that the collaborative grants within rich clubs tend to be more productive in a per-dollar sense than the control. Our results highlight advantages of collaborative grants among the institutions in the rich clubs. Copyright © 2022, The Authors. All rights reserved.

关键词：

Advances of machine learning in molecular modeling and simulation

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Haghighatlari, Mojtaba Hachmann, Johannes Department of Chemical and Biological Engineering University at Buffalo State University of New York BuffaloNY14260 United States Computational and Data-Enabled Science and Engineering Graduate Program University at Buffalo State University of New York BuffaloNY14260 United States New York State Center of Excellence in Materials Informatics BuffaloNY14203 United States

In this review, we highlight recent developments in the application of machine learning for molecular modeling and simulation. After giving a brief overview of the foundations, components, and workflow of a typical supervised learning approach for chemical problems, we showcase areas and state-of-the-art examples of their deployment. In this context, we discuss how machine learning relates to, supports, and augments more traditional physics-based approaches in computational research. We conclude by outlining challenges and future research directions that need to be addressed in order to make machine learning a mainstream chemical engineering tool. Copyright © 2019, The Authors. All rights reserved.

关键词： Machine learning

Metrics for benchmarking and uncertainty quantification: Quality, applicability, and a path to best practices for machine learning in chemistry

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Vishwakarma, Gaurav Sonpal, Aditya Hachmann, Johannes Department of Chemical and Biological Engineering University at Buffalo State University of New York BuffaloNY14260 United States Computational and Data-Enabled Science and Engineering Graduate Program University at Buffalo State University of New York BuffaloNY14260 United States New York State Center of Excellence in Materials Informatics BuffaloNY14203 United States

This review aims to draw attention to two issues of concern when we set out to make machine learning work in the chemical and materials domain, i.e., statistical loss function metrics for the validation and benchmarking of data-derived models, and the uncertainty quantification of predictions made by them. They are often overlooked or underappreciated topics as chemists typically only have limited training in statistics. Aside from helping to assess the quality, reliability, and applicability of a given model, these metrics are also key to comparing the performance of different models and thus for developing guidelines and best practices for the successful application of machine learning in chemistry. Copyright © 2020, The Authors. All rights reserved.

关键词： Benchmarking