Publication

Exceptional graphs for the random walk

Publications associées (32)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Intrinsic area near the origin for self-similar growth-fragmentations and related random surfaces

We study the behaviour of a natural measure defined on the leaves of the genealogical tree of some branching processes, namely self-similar growth-fragmentation processes. Each particle, or cell, is attributed a positive mass that evolves in continuous tim ...

2022

Planted matching problems on random hypergraphs

Lenka Zdeborová, Anshul Toshniwal, Gabriele Sicuro

We consider the problem of inferring a matching hidden in a weighted random k-hypergraph. We assume that the hyperedges' weights are random and distributed according to two different densities conditioning on the fact that they belong to the hidden matchin ...

2022

On the robustness of the metric dimension of grid graphs to adding a single edge

Patrick Thiran, Gergely Odor, Satvik Mehul Mashkaria

The metric dimension (MD) of a graph is a combinatorial notion capturing the minimum number of landmark nodes needed to distinguish every pair of nodes in the graph based on graph distance. We study how much the MD can increase if we add a single edge to t ...

2022

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Ali H. Sayed, Kun Yuan

This paper introduces a new algorithm for consensus optimization in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. All decentralized algorithms rely on communications between adjacent nodes. ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Normal approximation of the solution to the stochastic heat equation with Levy noise

Carsten Hao Ye Chong

Given a sequence L & x2d9;epsilon of Levy noises, we derive necessary and sufficient conditions in terms of their variances sigma 2(epsilon) such that the solution to the stochastic heat equation with noise sigma(epsilon)-1L & x2d9;epsilon converges in law ...

SPRINGER2020

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

EPFL2020

Consider a random process s that is a solution of the stochastic differential equation Ls = w with L a homogeneous operator and w a multidimensional Levy white noise. In this paper, we study the asymptotic effect of zooming in or zooming out of the process ...

SPRINGER/PLENUM PUBLISHERS2019

Asynchronous adaptive networks

Ali H. Sayed

In a recent article [1] we surveyed advances related to adaptation, learning, and optimization over synchronous networks. Various distributed strategies were discussed that enable a collection of networked agents to interact locally in response to streamin ...

Elsevier2018

Gaussian versus Sparse Stochastic Processes

Julien René Pierre Fageot

Although our work lies in the field of random processes, this thesis was originally motivated by signal processing applications, mainly the stochastic modeling of sparse signals. We develop a mathematical study of the innovation model, under which a signal ...

EPFL2017

Real-life acquisition systems are fundamentally limited in their ability to reproduce point sources. For example, a point source object, a star say, observed with an optical telescope is blurred by the imperfect lenses composing the system. Mathematically, ...

2016