English
Related papers

Related papers: Reliability of MST identification in correlation-b…

200 papers

Structural reliability evaluation for composites constitutes a fundamentally high-dimensional multiscale problem, as microscale material uncertainties must propagate to the macroscale and can be quantified as high-dimensional random fields.…

Computational Engineering, Finance, and Science · Computer Science 2026-04-22 Aryan Tyagi , Alex de Beer , Tiangang Cui , Jan N. Fuhg

In the context of algorithm theory, various studies have been conducted on spanning trees with desirable properties. In this paper, we consider the \textsc{Minimum Cover Spanning Tree} problem (MCST for short). Given a graph $G$ and a…

Data Structures and Algorithms · Computer Science 2025-12-01 Toranosuke Kokai , Akira Suzuki , Takahiro Suzuki , Yuma Tamura , Xiao Zhou

The fractal dimension of minimal spanning trees on percolation clusters is estimated for dimensions $d$ up to $d=5$. A robust analysis technique is developed for correlated data, as seen in such trees. This should be a robust method…

Disordered Systems and Neural Networks · Physics 2013-09-24 Sean M. Sweeney , A. Alan Middleton

The false discovery rate (FDR) and the false non-discovery rate (FNR), defined as the expected false discovery proportion (FDP) and the false non-discovery proportion (FNP), are the most popular benchmarks for multiple testing. Despite the…

Statistics Theory · Mathematics 2025-09-03 Yutong Nie , Yihong Wu

Providing an analytical solution for the problem of finding Fastest Distributed Consensus (FDC) is one of the challenging problems in the field of sensor networks. Here in this work we present analytical solution for the problem of fastest…

Information Theory · Computer Science 2010-09-28 Saber Jafarizadeh

The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree $T$ for graph $G=(V,E)$ with $n$ vertices, such that the maximum degree $d$ of $T$ is the smallest among all spanning trees of $G$. In this paper,…

Data Structures and Algorithms · Computer Science 2018-06-12 Michael Dinitz , Magnús M. Halldórsson , Calvin Newport

There has been recent interest in extending the ideas of False Discovery Rates (FDR) to variable selection in regression settings. Traditionally the FDR in these settings has been defined in terms of the coefficients of the full regression…

Methodology · Statistics 2013-02-12 Max Grazier G'Sell , Trevor Hastie , Robert Tibshirani

Maximum Probability Framework, powered by Maximum Probability Theorem, is a recent theoretical development in artificial intelligence, aiming to formally define probabilistic models, guiding development of objective functions, and…

Machine Learning · Computer Science 2022-09-08 Amir Emad Marvasti , Ehsan Emad Marvasti , Ulas Bagci

Distributionally robust supervised learning (DRSL) is emerging as a key paradigm for building reliable machine learning systems for real-world applications -- reflecting the need for classifiers and predictive models that are robust to the…

Machine Learning · Computer Science 2022-01-26 Yaodong Yu , Tianyi Lin , Eric Mazumdar , Michael I. Jordan

Distribution network reconfiguration (DNR) has proved to be an economical and effective way to improve the reliability of distribution systems. As optimal network configuration depends on system operating states (e.g., loads at each node),…

Systems and Control · Electrical Eng. & Systems 2023-05-03 Mukesh Gautam , Narayan Bhusal , Mohammed Benidris

Distributionally robust stochastic optimization (DRSO) is an approach to optimization under uncertainty in which, instead of assuming that there is a known true underlying probability distribution, one hedges against a chosen set of…

Optimization and Control · Mathematics 2022-05-03 Rui Gao , Anton J. Kleywegt

Decision trees partition the feature space using hard binary thresholds, assigning identical confidence to instances far from a decision boundary and to those directly on it. We introduce ternary decision trees, which augment each split…

Machine Learning · Computer Science 2026-05-22 William Smits

With the development and widespread use of wireless devices in recent years (mobile phones, Internet of Things, Wi-Fi), the electromagnetic spectrum has become extremely crowded. In order to counter security threats posed by rogue or…

Signal Processing · Electrical Eng. & Systems 2017-11-09 K. Youssef , Louis-S. Bouchard , K. Z. Haigh , H. Krovi , J. Silovsky , C. P. Vander Valk

The performance of machine learning (ML) models critically depends on the quality and representativeness of the training data. In applications with multiple heterogeneous data generating sources, standard ML methods often learn spurious…

We study the multi-level Steiner tree problem: a generalization of the Steiner tree problem in graphs where terminals $T$ require varying priority, level, or quality of service. In this problem, we seek to find a minimum cost tree…

Data Structures and Algorithms · Computer Science 2020-05-18 Reyan Ahmed , Faryad Darabi Sahneh , Keaton Hamm , Stephen Kobourov , Richard Spence

For many applications it is critical to know the uncertainty of a neural network's predictions. While a variety of neural network parameter estimation methods have been proposed for uncertainty estimation, they have not been rigorously…

Machine Learning · Computer Science 2019-12-05 Nabeel Seedat , Christopher Kanan

The percolation threshold is an important measure to determine the inherent rigidity of large networks. Predictors of the percolation threshold for large networks are computationally intense to run, hence it is a necessity to develop…

This paper studies the robust optimal operation of distribution networks (DNs) under renewable generation and load demand uncertainties, seeking an improved trade-off between robustness and economic performance. Building upon information…

Systems and Control · Electrical Eng. & Systems 2026-04-28 Zhisheng Xiong , Dimitris Boskos , Bo Zeng , Peter Palensky , Pedro P. Vergara

Motivation: Accurate estimation of false discovery rate (FDR) of spectral identification is a central problem in mass spectrometry-based proteomics. Over the past two decades, target decoy approaches (TDAs) and decoy-free approaches (DFAs),…

Quantitative Methods · Quantitative Biology 2020-09-18 Yisu Peng , Shantanu Jain , Yong Fuga Li , Michal Gregus , Alexander R. Ivanov , Olga Vitek , Predrag Radivojac

Motivated by applications in clustering and synthetic data generation, we consider the problem of releasing a minimum spanning tree (MST) under edge-weight differential privacy constraints where a graph topology $G=(V,E)$ with $n$ vertices…

Data Structures and Algorithms · Computer Science 2024-08-14 Rasmus Pagh , Lukas Retschmeier