Results 191 to 200 of about 44,866 (226)

Detecting Arbitrary Planted Subgraphs in Random Graphs

Annual Conference Computational Learning Theory
The problems of detecting and recovering planted structures/subgraphs in Erd\H{o}s-R\'{e}nyi random graphs, have received significant attention over the past three decades, leading to many exciting results and mathematical techniques. However, prior work
Dor Elimelech, Wasim Huleihel
semanticscholar   +1 more source

Aligning Embeddings and Geometric Random Graphs: Informational Results and Computational Approaches for the Procrustes-Wasserstein Problem

Neural Information Processing Systems
The Procrustes-Wasserstein problem consists in matching two high-dimensional point clouds in an unsupervised setting, and has many applications in natural language processing and computer vision.
Mathieu Even, Luca Ganassali, Jakob Maier, Laurent Massouli'e   +3 more
semanticscholar   +1 more source

Designing Sparse Reliable Pose-Graph SLAM: A Graph-Theoretic Approach

Workshop on the Algorithmic Foundations of Robotics, 2016
In this paper, we aim to design sparse D-optimal (determinantoptimal) pose-graph SLAM problems through the synthesis of sparse graphs with the maximum weighted number of spanning trees.
Kasra Khosoussi, G. Sukhatme, Shoudong Huang, G. Dissanayake   +3 more
semanticscholar   +1 more source

Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring

Symposium on Theoretical Aspects of Computer Science
Hyperbolic random graphs inherit many properties that are present in real-world networks. The hyperbolic geometry imposes a scale-free network with a strong clustering coefficient.
S. Baguley, Yannic Maus, Janosch Ruff, George Skretas   +3 more
semanticscholar   +1 more source

Phase transitions for detecting latent geometry in random graphs

Probability theory and related fields, 2019
Random graphs with latent geometric structure are popular models of social and biological networks, with applications ranging from network user profiling to circuit design.
Matthew Brennan, Guy Bresler, Dheeraj M. Nagaraj   +2 more
semanticscholar   +1 more source

Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles

Random Struct. Algorithms
Given access to the vertex set V$$ V $$ of a connected graph G=(V,E)$$ G=\left(V,E\right) $$ and an oracle that given two vertices u,v∈V$$ u,v\in V $$ , returns the shortest path distance between u$$ u $$ and v$$ v $$ , how many queries are needed to ...
Paul Bastide, Carla Groenland
semanticscholar   +1 more source

Microgrid Multivariate Load Forecasting Based on Weighted Visibility Graph: A Regional Airport Case Study

Electricity
This paper introduces an alternative forecasting approach that leverages the application of visibility graphs in the context of multivariate energy forecasting for a regional airport, which incorporates energy demand of diverse types of buildings and ...
Georgios Vontzos, Vasileios Laitsos, D. Bargiotas, Athanasios Fevgas, Aspassia Daskalopulu, L. Tsoukalas   +5 more
semanticscholar   +1 more source

Optimality Aspects of Greedy Schemes in Parallel Processing of Random Graph-Structured Jobs

Probability in the engineering and informational sciences (Print), 1994
N. Bambos, Shouyuan Chen
semanticscholar   +1 more source

ROBUSTNESS AND VULNERABILITY ANALYSIS OF WATER DISTRIBUTION NETWORKS USING GRAPH THEORETIC AND COMPLEX NETWORK PRINCIPLES

, 2011
A. Yazdani, P. Jeffrey
semanticscholar   +1 more source

Genomic Signatures from DNA Word Graphs

International Symposium on Bioinformatics Research and Applications, 2007
Lenwood S. Heath, Amrita Pati
semanticscholar   +1 more source