Graph neural networks take node features and graph structure as input to build representations for nodes and graphs. While there are a lot of focus on GNN models, understanding the impact of node features and graph structure to GNN performance has received ...
We present Deep MinCut (DMC), an unsupervised approach to learn node embeddings for graph -structured data. It derives node representations based on their membership in communities. As such, the embeddings directly provide insights into the graph structure ...
Understanding epidemic propagation in large networks is an important but challenging task, especially since we usually lack information, and the information that we have is often counter-intuitive. An illustrative example is the dependence of the final siz ...
With the increasing prevalence of massive datasets, it becomes important to design algorithmic techniques for dealing with scenarios where the input to be processed does not fit in the memory of a single machine. Many highly successful approaches have emer ...
Information retrieval (IR) systems such as search engines are important for people to find what they need among the tremendous amount of data available in their organization or on the Internet. These IR systems enable users to search in a large data collec ...
Consider the family of bounded degree graphs in any minor-closed family (such as planar graphs). Let d be the degree bound and n be the number of vertices of such a graph. Graphs in these classes have hyperfinite decompositions, where, one removes a small ...
The intershaft bearing is located between the high and low-pressure rotors of the aero-engine, where the working environment is harsh, the load variation range is large, and the lubrication and heat dissipation are poor. The fault of the intershaft bearing ...
In future High Energy Physics detectors, the coverage of large surfaces with silicon pixel chip sensors poses a challenge for the sensors positioning, for their cooling, assembly, and interconnection. The use of a cooling substrate on which the sensors are ...
We study the problem of identifying the source of a stochastic diffusion process spreading on a graph based on the arrival times of the diffusion at a few queried nodes. In a graph G=(V,E), an unknown source node v∗∈V is drawn uniformly at random, ...
