Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Mohammed Amin Abdullah"'
Autor:
Alexander I. Cowen-Rivers, Daniel Palenicek, Vincent Moens, Mohammed Amin Abdullah, Aivar Sootla, Jun Wang, Haitham Bou-Ammar
Publikováno v:
Machine Learning. 111:173-203
In this paper, we propose SAMBA, a novel framework for safe reinforcement learning that combines aspects from probabilistic modelling, information theory, and statistics. Our method builds upon PILCO to enable active exploration using novel(semi-)met
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c698c64f06f947b174b6bf355fc68d3
https://doi.org/10.1007/s10994-021-06103-6
https://doi.org/10.1007/s10994-021-06103-6
Publikováno v:
Random Structures & Algorithms. 52:379-418
The theme of this paper is the analysis of bootstrap percolation processes on random graphs generated by preferential attachment. This is a class of infection processes where vertices have two states: they are either infected or susceptible. At each
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de82f0883789fd6962006bce09e09b37
https://doi.org/10.1002/rsa.20744
https://doi.org/10.1002/rsa.20744
Autor:
Mohammed Amin Abdullah, Moez Draief
Publikováno v:
Discrete Applied Mathematics. 180:1-10
Suppose in a graph $G$ vertices can be either red or blue. Let $k$ be odd. At each time step, each vertex $v$ in $G$ polls $k$ random neighbours and takes the majority colour. If it doesn't have $k$ neighbours, it simply polls all of them, or all les
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81cafabf5e9da78401d79321ee9db524
https://doi.org/10.1016/j.dam.2014.07.026
https://doi.org/10.1016/j.dam.2014.07.026
Publikováno v:
ICASSP
We study online robust matrix completion on graphs. At each iteration a vector with some entries missing is revealed and our goal is to reconstruct it by identifying the underlying low-dimensional subspace from which the vectors are drawn. We assume
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4dcbd4fef43d4ca06b33c586dd77d790
https://doi.org/10.1109/icassp.2017.7952911
https://doi.org/10.1109/icassp.2017.7952911
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319295152
IWOCA
IWOCA
We analyse the cover time of a random walk on a random graph of a given degree sequence. Weights are assigned to the edges of the graph using a certain type of scheme that uses only local degree knowledge. This biases the transitions of the walk towa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::317c76437ae923fc472b3e252b0b14d0
https://doi.org/10.1007/978-3-319-29516-9_1
https://doi.org/10.1007/978-3-319-29516-9_1
Publikováno v:
Ann. Appl. Probab. 25, no. 2 (2015), 477-522
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques ISBN: 9783642229343
APPROX-RANDOM
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques ISBN: 9783642229343
APPROX-RANDOM
We study the SIR epidemic model with infections carried by $k$ particles making independent random walks on a random regular graph. Here we assume $k\leq n^{\epsilon}$, where $n$ is the number of vertices in the random graph, and $\epsilon$ is some s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c6c01418c86162459d130d077becc9f
https://doi.org/10.1214/13-aap1000
https://doi.org/10.1214/13-aap1000
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319267838
WAW
WAW
Suppose in a graph G vertices can be either red or blue. Let k be odd. At each time step, each vertex v in G polls k random neighbours and takes the majority colour. If it doesn't have k neighbours, it simply polls all of them, or all less one if the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9affc4d3b4f0ab7b22f71c30dbebe3b
https://doi.org/10.1007/978-3-319-26784-5_8
https://doi.org/10.1007/978-3-319-26784-5_8
We study typical distances in a geometric random graph on the hyperbolic plane. Introduced by Krioukov et al.~\cite{ar:Krioukov} as a model for complex networks, $N$ vertices are drawn randomly within a bounded subset of the hyperbolic plane and any
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ceaa306a40ac82920b7069218e68a4f9
In this paper we establish the cover time of a random graph $G(\textbf{d})$ chosen uniformly at random from the set of graphs with vertex set $[n]$ and degree sequence $\textbf{d}$. We show that under certain restrictions on $\textbf{d}$, the cover t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d9f1b0eb604874a72f12b9510691583
https://doi.org/10.46298/dmtcs.2804
https://doi.org/10.46298/dmtcs.2804