Learning Large-Scale Bayesian Networks with the sparsebn Package

Learning graphical models from data is an important problem with wide applications, ranging from genomics to the social sciences. Nowadays datasets often have upwards of thousands---sometimes tens or hundreds of thousands---of variables and far fewer samples. To meet this challenge, we have developed a new R package called sparsebn for learning the structure of large, sparse graphical models with a focus on Bayesian networks. While there are many existing software packages for this task, this package focuses on the unique setting of learning large networks from high-dimensional data, possibly with interventions. As such, the methods provided place a premium on scalability and consistency in a high-dimensional setting. Furthermore, in the presence of interventions, the methods implemented here achieve the goal of learning a causal network from data. Additionally, the sparsebn package is fully compatible with existing software packages for network analysis.Comment: To appear in the Journal of Statistical Software, 39 pages, 7 figure

Penalized Estimation of Directed Acyclic Graphs From Discrete Data

Bayesian networks, with structure given by a directed acyclic graph (DAG), are a popular class of graphical models. However, learning Bayesian networks from discrete or categorical data is particularly challenging, due to the large parameter space and the difficulty in searching for a sparse structure. In this article, we develop a maximum penalized likelihood method to tackle this problem. Instead of the commonly used multinomial distribution, we model the conditional distribution of a node given its parents by multi-logit regression, in which an edge is parameterized by a set of coefficient vectors with dummy variables encoding the levels of a node. To obtain a sparse DAG, a group norm penalty is employed, and a blockwise coordinate descent algorithm is developed to maximize the penalized likelihood subject to the acyclicity constraint of a DAG. When interventional data are available, our method constructs a causal network, in which a directed edge represents a causal relation. We apply our method to various simulated and real data sets. The results show that our method is very competitive, compared to many existing methods, in DAG estimation from both interventional and high-dimensional observational data.Comment: To appear in Statistics and Computin

THE DEVELOPMENT OF CCD RANGE FINDER

Application of a range finder in both indoor and outdoor settings shows that distance and subject information can be performed accurately. The range finder can measure the distance, show the performance and do the management task at the same time. It is adapted to any climate and can work in different conditions. It has the characteristics of being cheap, convenient, quick and accurate

Sparse Fr\'echet Sufficient Dimension Reduction with Graphical Structure Among Predictors

Fr\'echet regression has received considerable attention to model metric-space valued responses that are complex and non-Euclidean data, such as probability distributions and vectors on the unit sphere. However, existing Fr\'echet regression literature focuses on the classical setting where the predictor dimension is fixed, and the sample size goes to infinity. This paper proposes sparse Fr\'echet sufficient dimension reduction with graphical structure among high-dimensional Euclidean predictors. In particular, we propose a convex optimization problem that leverages the graphical information among predictors and avoids inverting the high-dimensional covariance matrix. We also provide the Alternating Direction Method of Multipliers (ADMM) algorithm to solve the optimization problem. Theoretically, the proposed method achieves subspace estimation and variable selection consistency under suitable conditions. Extensive simulations and a real data analysis are carried out to illustrate the finite-sample performance of the proposed method

Pattern formation and bifurcation analysis of delay induced fractional-order epidemic spreading on networks

The spontaneous emergence of ordered structures, known as Turing patterns, in complex networks is a phenomenon that holds potential applications across diverse scientific fields, including biology, chemistry, and physics. Here, we present a novel delayed fractional-order susceptible-infected-recovered-susceptible (SIRS) reaction-diffusion model functioning on a network, which is typically used to simulate disease transmission but can also model rumor propagation in social contexts. Our theoretical analysis establishes the Turing instability resulting from delay, and we support our conclusions through numerical experiments. We identify the unique impacts of delay, average network degree, and diffusion rate on pattern formation. The primary outcomes of our study are: (i) Delays cause system instability, mainly evidenced by periodic temporal fluctuations; (ii) The average network degree produces periodic oscillatory states in uneven spatial distributions; (iii) The combined influence of diffusion rate and delay results in irregular oscillations in both time and space. However, we also find that fractional-order can suppress the formation of spatiotemporal patterns. These findings are crucial for comprehending the impact of network structure on the dynamics of fractional-order systems.Comment: 23 pages, 9 figure