Zobrazeno 1 - 10
of 383
pro vyhledávání: '"Bousquet Nicolas"'
Autor:
Bousquet, Nicolas, Zeitoun, Sébastien
In local certification, vertices of a $n$-vertex graph perform a local verification to check if a given property is satisfied by the graph. This verification is performed thanks to certificates, which are pieces of information that are given to the v
Externí odkaz:
http://arxiv.org/abs/2410.14658
Local certification is the area of distributed network computing asking the following question: How to certify to the nodes of a network that a global property holds, if they are limited to a local verification? In this area, it is often essential to
Externí odkaz:
http://arxiv.org/abs/2409.15404
In this paper, we investigate how local rules enforced at every node can influence the topology of a network. More precisely, we establish several results on the diameter of trees as a function of the number of nodes, as listed below. These results h
Externí odkaz:
http://arxiv.org/abs/2409.01305
Autor:
Ketema, Baalu Belay, Bousquet, Nicolas, Costantino, Francesco, Gamboa, Fabrice, Iooss, Bertrand, Sueur, Roman
Input variables in numerical models are often subject to several levels of uncertainty, usually modeled by probability distributions. In the context of uncertainty quantification applied to these models, studying the robustness of output quantities w
Externí odkaz:
http://arxiv.org/abs/2407.21542
An st-shortest path, or st-path for short, in a graph G is a shortest (induced) path from s to t in G. Two st-paths are said to be adjacent if they differ on exactly one vertex. A reconfiguration sequence between two st-paths P and Q is a sequence of
Externí odkaz:
http://arxiv.org/abs/2406.12717
In this short note, we prove that every twin-free graph on $n$ vertices contains a locating-dominating set of size at most $\lceil\frac{5}{8}n\rceil$. This improves the earlier bound of $\lfloor\frac{2}{3}n\rfloor$ due to Foucaud, Henning, L\"owenste
Externí odkaz:
http://arxiv.org/abs/2405.18162
Publikováno v:
Dependence Modeling, Vol 8, Iss 1, Pp 263-297 (2020)
Uncertain information on input parameters of computer models is usually modeled by considering these parameters as random, and described by marginal distributions and a dependence structure of these variables. In numerous real-world applications, whi
Externí odkaz:
https://doaj.org/article/601323385a754922b23ec0ae757a9820
Autor:
Bousquet, Nicolas
This article provides a critical review of the main methods used to produce conservative estimators of probabilities of rare events, or critical failures, for reliability and certification studies in the broadest sense. These probabilities must theor
Externí odkaz:
http://arxiv.org/abs/2403.17505
Detecting specific structures in a network has been a very active theme of research in distributed computing for at least a decade. In this paper, we start the study of subgraph detection from the perspective of local certification. Remember that a l
Externí odkaz:
http://arxiv.org/abs/2402.12148
In this work, we provide an upper bound for global certification of graph homomorphism, a generalization of graph coloring. In certification, the nodes of a network should decide if the network satisfies a given property, thanks to small pieces of in
Externí odkaz:
http://arxiv.org/abs/2402.03849