English
Related papers

Related papers: On the accurate computation of expected modularity…

200 papers

Recent work on weighted model counting has been very successfully applied to the problem of probabilistic inference in Bayesian networks. The probability distribution is encoded into a Boolean normal form and compiled to a target language,…

Artificial Intelligence · Computer Science 2016-10-19 Giso H. Dal , Peter J. F. Lucas

Reliable probability estimation is of crucial importance in many real-world applications where there is inherent (aleatoric) uncertainty. Probability-estimation models are trained on observed outcomes (e.g. whether it has rained or not, or…

Community detection is one of the pivotal tools for discovering the structure of complex networks. Majority of community detection methods rely on optimization of certain quality functions characterizing the proposed community structure.…

Social and Information Networks · Computer Science 2017-12-15 Stanislav Sobolevsky , Alexander Belyi , Carlo Ratti

We consider the goal of predicting how complex networks respond to chronic (press) perturbations when characterizations of their network topology and interaction strengths are associated with uncertainty. Our primary result is the…

Populations and Evolution · Quantitative Biology 2016-10-26 David Koslicki , Mark Novak

In this article, we proposed a new probability distribution named as power Maxwell distribution (PMaD). It is another extension of Maxwell distribution (MaD) which would lead more flexibility to analyze the data with non-monotone failure…

Applications · Statistics 2018-07-04 Abhimanyu Singh Yadav , Hassan S. Bakouch , Sanjay Kumar Singh , Umesh Singh

In recent years the belief network has been used increasingly to model systems in Al that must perform uncertain inference. The development of efficient algorithms for probabilistic inference in belief networks has been a focus of much…

Artificial Intelligence · Computer Science 2013-03-08 Peter Che , Richard E. Neapolitan , James Kenevan , Martha Evens

We propose a slightly revised Miller-Hagberg (MH) algorithm that efficiently generates a random network from a given expected degree sequence. The revision was to replace the approximated edge probability between a pair of nodes with a…

Discrete Mathematics · Computer Science 2017-11-21 Hiroki Sayama

Consider a set of terminal nodes K that belong to a network whose nodes are connected by links that fail independently with known probabilities. We introduce a method for estimating any performability measure that depends on the hop…

Networking and Internet Architecture · Computer Science 2013-03-22 Pablo Sartor , Franco Robledo

Probabilistic programs encode stochastic models as ordinary-looking programs with primitives for sampling numbers from predefined distributions and conditioning. Their applications include, among many others, machine learning and modeling…

Formal Languages and Automata Theory · Computer Science 2025-12-16 Dominik Geißler , Tobias Winkler

Real-time quantification of residential building energy flexibility is needed to enable a cost-efficient operation of active distribution grids. A promising means is to use the so-called flexibility envelope concept to represent the…

Systems and Control · Electrical Eng. & Systems 2024-04-16 Nami Hekmat , Hanmin Cai , Thierry Zufferey , Gabriela Hug , Philipp Heer

The growing popularity of online social networks has provided researchers with access to large amount of social network data. This, coupled with the ever increasing computation speed, storage capacity and data mining capabilities, led to…

Computers and Society · Computer Science 2008-12-18 Rumi Ghosh , Kristina Lerman

Inverse probability weighting (IPW) is widely used in many areas when data are subject to unrepresentativeness, missingness, or selection bias. An inevitable challenge with the use of IPW is that the IPW estimator can be remarkably unstable…

Methodology · Statistics 2021-11-29 Yukun Liu , Yan Fan

Network calculus is a min-plus system theory for performance evaluation of queuing networks. Its elegance stems from intuitive convolution formulas for concatenation of deterministic servers. Recent research dispenses with the worst-case…

Information Theory · Computer Science 2009-09-29 Markus Fidler

We propose a novel modular debiasing technique applicable to any discrete random source, addressing the fundamental challenge of reliably extracting high-quality randomness from inherently imperfect physical processes. The method involves…

Data Analysis, Statistics and Probability · Physics 2025-05-12 Eduardo Gueron

Modularity, first proposed by [Newman and Girvan, 2004], is one of the most popular ways to quantify the significance of community structure in complex networks. It can serve as both a standard benchmark to compare different community…

Social and Information Networks · Computer Science 2022-02-14 Qian Wang , Yongkang Guo , Zhihuan Huang , Yuqing Kong

Identifying the obstacle space is crucial for path planning. However, generating an accurate obstacle space remains a significant challenge due to various sources of uncertainty, including motion, behavior, and perception limitations. Even…

Robotics · Computer Science 2025-09-30 Jun Xiang , Jun Chen

Replicated network data are increasingly available in many research fields. In connectomic applications, inter-connections among brain regions are collected for each patient under study, motivating statistical models which can flexibly…

Methodology · Statistics 2018-09-11 Daniele Durante , David B. Dunson , Joshua T. Vogelstein

Uncertainty analysis in the form of probabilistic forecasting can significantly improve decision making processes in the smart power grid for better integrating renewable energy sources such as wind. Whereas point forecasting provides a…

Machine Learning · Statistics 2017-10-05 Kostas Hatalis , Alberto J. Lamadrid , Katya Scheinberg , Shalinee Kishore

Nodes in real-world networks are repeatedly observed to form dense clusters, often referred to as communities. Methods to detect these groups of nodes usually maximize an objective function, which implicitly contains the definition of a…

Physics and Society · Physics 2015-09-10 V. A. Traag , R. Aldecoa , J-C. Delvenne

Real world networks are often subject to severe uncertainties which need to be addressed by any reliable prescriptive model. In the context of the maximum flow problem subject to arc failure, robust models have gained particular attention.…

Discrete Mathematics · Computer Science 2017-05-24 Fabian Mies , Britta Peis , Andreas Wierz
‹ Prev 1 3 4 5 6 7 10 Next ›