Zobrazeno 1 - 10
of 71
pro vyhledávání: '"graphes aléatoires"'
Autor:
Ribordy, Olivier
L'étude du spectre des réseaux complexes est un problème riche, ayant une longue histoire et des applications dans de nombreux domaines. La densité spectrale limite d'ensembles de graphes aléatoires, en particulier, fournit une information globa
Externí odkaz:
https://hdl.handle.net/20.500.11794/110383
Autor:
Duchemin, Quentin
Publikováno v:
Probability [math.PR]. Université Gustave Eiffel, 2022. English. ⟨NNT : 2022UEFL2003⟩
Statistics [math.ST]. Université Gustave Eiffeil, 2022. English
Statistics [math.ST]. Université Gustave Eiffeil, 2022. English
The first part of this thesis aims at introducing new models of random graphs that account for the temporal evolution of networks. More precisely, we focus on growth models where at each instant a new node is added to the existing graph. We attribute
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0f894b88d5550e2662b0ea34a6a9dbdc
https://tel.archives-ouvertes.fr/tel-03749513
https://tel.archives-ouvertes.fr/tel-03749513
Autor:
Thibault, François
Les réseaux complexes sont un paradigme de plus en plus utilisé pour modéliser la structure des systèmes complexes. Les connexions neuronales ou la transmission de maladies entre différents humains sont des exemples typiques de ce genre de struc
Externí odkaz:
https://hdl.handle.net/20.500.11794/108104
Autor:
Chabert-Liddell, Saint-Clair
This thesis deals with the development of statistical methods for the analysis of collections of interaction networks through three original contributions. Interaction networks are a natural way to represent in graph form the exchanges or relationshi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7dd40fa606e8e3eba6eb30710e7c0ad5
https://hal.archives-ouvertes.fr/tel-03629379
https://hal.archives-ouvertes.fr/tel-03629379
Autor:
Ganassali, Luca
Publikováno v:
Probability [math.PR]. PSL Research University; Ecole normale supérieure, 2022. English. ⟨NNT : ⟩
This thesis focuses on statistical inference in graphs (or matrices) in high dimensionand studies the graph alignment problem which aims to recover a hidden underlyingmatching between the nodes of two correlated random graphs.Similarly to many other
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::03ea953f7537e5d5ec556ae6ff829034
https://hal.science/tel-03921009
https://hal.science/tel-03921009
Autor:
Stephan, Ludovic
Publikováno v:
General Mathematics [math.GM]. Sorbonne Université, 2021. English. ⟨NNT : 2021SORUS497⟩
This manuscript deals with inference problems on large, usually sparse, random graphs. We first focus on a planted tree problem, where a tree with known shape is planted inside a sparse Erdös-Rényi graph. When this tree is a path, we provide a comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::9e9831762717247fba41d320bbf74525
https://theses.hal.science/tel-03720004/file/STEPHAN_Ludovic_2021.pdf
https://theses.hal.science/tel-03720004/file/STEPHAN_Ludovic_2021.pdf
Autor:
CONCHON--KERJAN, Guillaume
Publikováno v:
Probability [math.PR]. Université de Paris / Université Paris Diderot (Paris 7), 2021. English
This thesis is devoted to the study of different random graphs, defined by local properties (suchas the distribution of the degrees of the vertices, or the probability that two given vertices sharean edge). We investigate some of their global charact
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4713713f26518d071db19fe980b46d16
https://hal.archives-ouvertes.fr/tel-03400041
https://hal.archives-ouvertes.fr/tel-03400041
Autor:
Safsafi, Othmane
Publikováno v:
Topologie algébrique [math.AT]. Sorbonne Université, 2021. Français. ⟨NNT : 2021SORUS201⟩
In this thesis we study a specific type of inhomogeneous random minimum spanning trees and their related graphs. For large positive integers n, we put positive weights (wi)i≤n on the nodes of the complete graph of size n. Moreover, the weights (wi)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::eb2e6d68aac1fb8300ea09c4ff1d1e22
https://tel.archives-ouvertes.fr/tel-03457422
https://tel.archives-ouvertes.fr/tel-03457422
Autor:
Painchaud, Vincent
La modélisation de phénomènes biologiques qui impliquent un très grand nombre d'unités pose toujours un défi. De nombreux modèles présentent une vision globale de la dynamique moyenne du phénomène sous la forme d'un système d'équations di
Externí odkaz:
http://hdl.handle.net/20.500.11794/71616
Autor:
Frilet, Nicolas
We study the scaling limits of random graphs constructed by coalescence, the most classical of which are the Erdős – Rényi random graphs. It has been shown that these graphs, under certain criticality assumptions, converge in the scaling limit to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______166::37efcd69b95383901b7479663aa0b7c7
https://theses.hal.science/tel-03667362
https://theses.hal.science/tel-03667362