Shortest-Weight Paths In Random Regular Graphs

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem. Spectral algorithms ...

In the rapidly evolving landscape of machine learning research, neural networks stand out with their ever-expanding number of parameters and reliance on increasingly large datasets. The financial cost and computational resources required for the training p ...

Given two jointly distributed random variables (X,Y), a functional representation of X is a random variable Z independent of Y, and a deterministic function g(⋅,⋅) such that X=g(Y,Z). The problem of finding a minimum entropy functional representation is kn ...

We study the performance of Markov chains for the q-state ferromagnetic Potts model on random regular graphs. While the cases of the grid and the complete graph are by now well-understood, the case of random regular graphs has resisted a detailed analysis ...

Graph machine learning offers a powerful framework with natural applications in scientific fields such as chemistry, biology and material sciences. By representing data as a graph, we encode the prior knowledge that the data is composed of a set of entiti ...

Bedload transport often exhibits dual-mode behavior due to interactions of spatiotemporal controlling factors with the migrating three-dimensional bedforms (characterized by the fully developed patterns in the bed, such as alternate bars, pools, and cluste ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

This work presents a graph neural network (GNN) framework for solving the maximum independent set (MIS) problem, inspired by dynamic programming (DP). Specifically, given a graph, we propose a DP-like recursive algorithm based on GNNs that firstly construc ...

We propose nonparametric estimators for the second-order central moments of possibly anisotropic spherical random fields, within a functional data analysis context. We consider a measurement framework where each random field among an identically distribute ...

The convergence speed of machine learning models trained with Federated Learning is significantly affected by non-independent and identically distributed (non-IID) data partitions, even more so in a fully decentralized setting without a central server. In ...

There is sustained and widespread interest in understanding the limit, if there is any, to the human life span. Apart from its intrinsic and biological interest, changes in survival in old age have implications for the sustainability of social security sys ...

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 ...

The quantification of uncertainties can be particularly challenging for problems requiring long-time integration as the structure of the random solution might considerably change over time. In this respect, dynamical low-rank approximation (DLRA) is very a ...

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 ...

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 ...

This thesis focuses on the maximum matching problem in modern computational settings where the algorithms have to make decisions with partial information. First, we consider two stochastic models called query-commit and price-of-information where the algo ...

One of the most basic graph problems, All-Pairs Shortest Paths (APSP) is known to be solvable in n^{3-o(1)} time, and it is widely open whether it has an O(n^{3-ε}) time algorithm for ε > 0. To better understand APSP, one often strives to obtain subcubic t ...

It is well known and readily seen that the maximum of n independent and uniformly on [0, 1] distributed random variables, suitably standardised, converges in total variation distance, as n increases, to the standard negative exponential distribution. We ex ...

We study in this thesis the asymptotic behavior of optimal paths on a random graph model, the configuration model, for which we assign continuous random positive weights on its edges. We start by describing the asymptotic behavior of the diameter and the f ...

We consider three classes of linear differential equations on distribution functions, with a fractional order alpha is an element of [0; 1]. The integer case alpha = 1 corresponds to the three classical extreme families. In general, we show that there is a ...

Shortest-Weight Paths In Random Regular Graphs

Chat with Graph Search

The Power of Two Matrices in Spectral Algorithms for Community Recovery

Random matrix methods for high-dimensional machine learning models

Information Spectrum Converse for Minimum Entropy Couplings and Functional Representations

Metastability of the Potts Ferromagnet on Random Regular Graphs

Equivariant Neural Architectures for Representing and Generating Graphs

Dynamics of Dual-Mode Bedload Transport With Three-Dimensional Alternate Bars Migration in Subcritical Flow: Experiments and Model Analysis

Results on Sparse Integer Programming and Geometric Independent Sets

Maximum Independent Set: Self-Training through Dynamic Programming

Functional estimation of anisotropic covariance and autocovariance operators on the sphere

D-Cliques: Compensating for Data Heterogeneity with Topology in Decentralized Federated Learning

Is There a Cap on Longevity? A Statistical Review

The Role of Adaptivity in Source Identification with Time Queries

Dynamical low rank approximation for uncertainty quantification of time-dependent problems

Space-Efficient Representations of Graphs

Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes

How to Match in Modern Computational Settings

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

Strong convergence of multivariate maxima

Non-Exponential Variations for Classical Results in First Passage Percolation

Fractional extreme distributions