Indice
Letteratura scientifica selezionata sul tema "Probability-Graphons"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Probability-Graphons".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Articoli di riviste sul tema "Probability-Graphons"
Ackerman, Nate, Cameron E. Freer, Younesse Kaddar, Jacek Karwowski, Sean Moss, Daniel Roy, Sam Staton e Hongseok Yang. "Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets". Proceedings of the ACM on Programming Languages 8, POPL (5 gennaio 2024): 1819–49. http://dx.doi.org/10.1145/3632903.
Testo completoMcMillan, Audra, e Adam Smith. "When is non-trivial estimation possible for graphons and stochastic block models?‡". Information and Inference: A Journal of the IMA 7, n. 2 (23 agosto 2017): 169–81. http://dx.doi.org/10.1093/imaiai/iax010.
Testo completoZHAO, YUFEI. "On the Lower Tail Variational Problem for Random Graphs". Combinatorics, Probability and Computing 26, n. 2 (16 agosto 2016): 301–20. http://dx.doi.org/10.1017/s0963548316000262.
Testo completoBraides, Andrea, Paolo Cermelli e Simone Dovetta. "Γ-limit of the cut functional on dense graph sequences". ESAIM: Control, Optimisation and Calculus of Variations 26 (2020): 26. http://dx.doi.org/10.1051/cocv/2019029.
Testo completoHATAMI, HAMED, e SERGUEI NORINE. "The Entropy of Random-Free Graphons and Properties". Combinatorics, Probability and Computing 22, n. 4 (16 maggio 2013): 517–26. http://dx.doi.org/10.1017/s0963548313000175.
Testo completoKeliger, Dániel, Illés Horváth e Bálint Takács. "Local-density dependent Markov processes on graphons with epidemiological applications". Stochastic Processes and their Applications 148 (giugno 2022): 324–52. http://dx.doi.org/10.1016/j.spa.2022.03.001.
Testo completoBackhausz, Ágnes, e Dávid Kunszenti-Kovács. "On the dense preferential attachment graph models and their graphon induced counterpart". Journal of Applied Probability 56, n. 2 (giugno 2019): 590–601. http://dx.doi.org/10.1017/jpr.2019.34.
Testo completoBackhausz, Ágnes, e Balázs Szegedy. "Action convergence of operators and graphs". Canadian Journal of Mathematics, 17 settembre 2020, 1–50. http://dx.doi.org/10.4153/s0008414x2000070x.
Testo completoMarkering, Maarten. "The Large Deviation Principle for Inhomogeneous Erdős–Rényi Random Graphs". Journal of Theoretical Probability, 14 giugno 2022. http://dx.doi.org/10.1007/s10959-022-01181-1.
Testo completoJanssen, Jeannette, e Aaron Smith. "Reconstruction of line-embeddings of graphons". Electronic Journal of Statistics 16, n. 1 (1 gennaio 2022). http://dx.doi.org/10.1214/21-ejs1940.
Testo completoTesi sul tema "Probability-Graphons"
Weibel, Julien. "Graphons de probabilités, limites de graphes pondérés aléatoires et chaînes de Markov branchantes cachées". Electronic Thesis or Diss., Orléans, 2024. http://www.theses.fr/2024ORLE1031.
Testo completoGraphs are mathematical objects used to model all kinds of networks, such as electrical networks, communication networks, and social networks. Formally, a graph consists of a set of vertices and a set of edges connecting pairs of vertices. The vertices represent, for example, individuals, while the edges represent the interactions between these individuals. In the case of a weighted graph, each edge has a weight or a decoration that can model a distance, an interaction intensity, or a resistance. Modeling real-world networks often involves large graphs with a large number of vertices and edges.The first part of this thesis is dedicated to introducing and studying the properties of the limit objects of large weighted graphs : probability-graphons. These objects are a generalization of graphons introduced and studied by Lovász and his co-authors in the case of unweighted graphs. Starting from a distance that induces the weak topology on measures, we define a cut distance on probability-graphons. We exhibit a tightness criterion for probability-graphons related to relative compactness in the cut distance. Finally, we prove that this topology coincides with the topology induced by the convergence in distribution of the sampled subgraphs. In the second part of this thesis, we focus on hidden Markov models indexed by trees. We show the strong consistency and asymptotic normality of the maximum likelihood estimator for these models under standard assumptions. We prove an ergodic theorem for branching Markov chains indexed by trees with general shapes. Finally, we show that for a stationary and reversible chain, the line graph is the tree shape that induces the minimal variance for the empirical mean estimator among trees with a given number of vertices