中文
相关论文

相关论文: Network Kriging

200 篇论文

Various approaches and measures from network analysis have been applied to granular and particulate networks to gain insights into their structural, transport, failure-propagation and other systems-level properties. In this article, we…

软凝聚态物质 · 物理学 2019-11-06 Silvia Nauer , Lucas Böttcher , Mason A. Porter

Influence maximization is the problem of finding the set of nodes of a network that maximizes the size of the outbreak of a spreading process occurring on the network. Solutions to this problem are important for strategic decisions in…

物理与社会 · 物理学 2019-10-23 Sirag Erkol , Claudio Castellano , Filippo Radicchi

High throughput is of particular interest in data center and HPC networks. Although myriad network topologies have been proposed, a broad head-to-head comparison across topologies and across traffic patterns is absent, and the right way to…

网络与互联网体系结构 · 计算机科学 2016-11-16 Sangeetha Abdu Jyothi , Ankit Singla , P. Brighten Godfrey , Alexandra Kolla

Network control refers to a very large and diverse set of problems including controllability of linear time-invariant dynamical systems, where the objective is to select an appropriate input to steer the network to a desired state. There…

数据结构与算法 · 计算机科学 2016-03-25 Mohamad Kazem Shirani Faradonbeh , Ambuj Tewari , George Michailidis

Complex networks are usually characterized in terms of their topological, spatial, or information-theoretic properties and combinations of the associated metrics are used to discriminate networks into different classes or categories.…

数据分析、统计与概率 · 物理学 2017-10-25 Marc Wiedermann , Jonathan F. Donges , Jürgen Kurths , Reik V. Donner

Internet is known to display a highly heterogeneous structure and complex fluctuations in its traffic dynamics. Congestion seems to be an inevitable result of user's behavior coupled to the network dynamics and it effects should be…

无序系统与神经网络 · 物理学 2009-11-10 Sergi Valverde , Ricard V. Sole

The recently-proposed generic Dijkstra algorithm finds shortest paths in networks with continuous and contiguous resources. While the algorithm was proposed in the context of optical networks (and is applicable to other networks with finite…

网络与互联网体系结构 · 计算机科学 2026-03-04 Ireneusz Szcześniak , Bożena Woźna-Szcześniak , Ireneusz Olszewski

Graph sampling via crawling has become increasingly popular and important in the study of measuring various characteristics of large scale complex networks. While powerful, it is known to be challenging when the graph is loosely connected…

社会与信息网络 · 计算机科学 2014-05-21 Junzhou Zhao , John C. S. Lui , Don Towsley , Pinghui Wang , Xiaohong Guan

This work investigates the prediction performance of the kriging predictors. We derive some error bounds for the prediction error in terms of non-asymptotic probability under the uniform metric and $L_p$ metrics when the spectral densities…

统计理论 · 数学 2020-09-09 Rui Tuo , Wenjia Wang

Cascading failures represent a fundamental threat to the integrity of complex systems, often precipitating a comprehensive collapse across diverse infrastructures and financial networks. This research articulates a robust and pragmatic…

适应与自组织系统 · 物理学 2024-06-28 Karan Singh , V. K. Chandrasekar , D. V. Senthilkumar

One popular method for dealing with large-scale data sets is sampling. For example, by using the empirical statistical leverage scores as an importance sampling distribution, the method of algorithmic leveraging samples and rescales…

统计方法学 · 统计学 2013-06-25 Ping Ma , Michael W. Mahoney , Bin Yu

The forthcoming 6G networks will embrace a new realm of AI-driven services that requires innovative network slicing strategies, namely slicing for AI, which involves the creation of customized network slices to meet Quality of service (QoS)…

网络与互联网体系结构 · 计算机科学 2024-11-06 Menna Helmy , Alaa Awad Abdellatif , Naram Mhaisen , Amr Mohamed , Aiman Erbad

We propose and investigate new complementary methodologies for estimating predictive variance networks in regression neural networks. We derive a locally aware mini-batching scheme that result in sparse robust gradients, and show how to…

机器学习 · 统计学 2019-11-05 Nicki S. Detlefsen , Martin Jørgensen , Søren Hauberg

Network slicing is a key technique in 5G and beyond for efficiently supporting diverse services. Many network slicing solutions rely on deep learning to manage complex and high-dimensional resource allocation problems. However, deep…

网络与互联网体系结构 · 计算机科学 2024-01-23 Tianlun Hu , Qi Liao , Qiang Liu , Antonio Massaro , Georg Carle

Inference and prediction of routes have become of interest over the past decade owing to a dramatic increase in package delivery and ride-sharing services. Given the underlying combinatorial structure and the incorporation of probabilities,…

计算机科学中的逻辑 · 计算机科学 2023-06-21 Suwei Yang , Victor C. Liang , Kuldeep S. Meel

Motif counting plays a crucial role in understanding the structural properties of networks. By computing motif frequencies, researchers can draw key insights into the structural properties of the underlying network. As networks become…

社会与信息网络 · 计算机科学 2025-03-26 Haozhe Yin , Kai Wang , Wenjie Zhang , Yizhang He , Ying Zhang , Xuemin Lin

We consider the problem of computing the capacity of a coded, multicast network over a small alphabet. We introduce a novel approach to this problem based on mixed integer programming. As an application of our approach, we recover, extend…

信息论 · 计算机科学 2022-12-15 Christopher Hojny , Altan B. Kilic , Alberto Ravagnani

Cyber networks are fundamental to many organization's infrastructure, and the size of cyber networks is increasing rapidly. Risk measurement of the entities/endpoints that make up the network via available knowledge about possible threats…

系统与控制 · 电气工程与系统科学 2025-01-29 Arda Bayer , David Maluf , Behnaam Aazhang

Data classification techniques partition the data or feature space into smaller sub-spaces, each corresponding to a specific class. To classify into subspaces, physical features e.g., distance and distributions are utilized. This approach…

机器学习 · 计算机科学 2025-03-11 Josimar Chire , Khalid Mahmood , Zhao Liang

An important tool in analyzing complex social and information networks is s-t simple path counting, which is known to be #P-complete. In this paper, we study efficient s-t simple path counting in directed graphs. For a given pair of…

社会与信息网络 · 计算机科学 2022-07-01 Mostafa Haghir Chehreghani