Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Ahad N. Zehmakan"'
Publikováno v:
Frontiers in Molecular Biosciences, Vol 11 (2024)
The algorithms for phylogenetic reconstruction are central to computational molecular evolution. The relentless pace of data acquisition has exposed their poor scalability and the conclusion that the conventional application of these methods is impra
Externí odkaz:
https://doaj.org/article/d19b5728526e4e0fb1878cb6beb14a0f
Autor:
Sining Li, Ahad N. Zehmakan
Publikováno v:
Physics, Vol 5, Iss 4, Pp 1094-1108 (2023)
We study a graph-based generalization of the Galam opinion formation model. Consider a simple connected graph which represents a social network. Each node in the graph is colored either blue or white, which indicates a positive or negative opinion on
Externí odkaz:
https://doaj.org/article/bd4ab5ebb20049748b319b884590486e
Autor:
Bernd Gärtner, Ahad N. Zehmakan
Publikováno v:
Theoretical Computer Science. 889:41-59
Consider a graph G = ( V , E ) and a random initial coloring where each vertex is black independently with probability p b , and white with probability p w = 1 − p b . In each step, all vertices change their current color synchronously to the most
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed688c025a651229e59c9ee41915bffc
https://doi.org/10.1016/j.tcs.2021.07.035
https://doi.org/10.1016/j.tcs.2021.07.035
Autor:
Ahad N. Zehmakan, Bernd Gärtner
Publikováno v:
Journal of Statistical Physics. 178:1442-1466
Consider a community where initially, each individual is positive or negative regarding a reform proposal. In each round, individuals gather randomly in fixed rooms of different sizes, and all individuals in a room agree on the majority opinion in th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d0be73464e56cb29e7d04a844d985ac
https://doi.org/10.1007/s10955-020-02515-1
https://doi.org/10.1007/s10955-020-02515-1
Autor:
Ahad N. Zehmakan, Clemens Jeger
Publikováno v:
Discrete Applied Mathematics. 262:116-126
We study an extremal question for the (two-way) r − bootstrap percolation processes. Given a graph and an initial configuration where each vertex is active or inactive, in the r − bootstrap percolation process the following rule is applied in dis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98994cc8a6d2a9e39182b753efb3aceb
https://doi.org/10.1016/j.dam.2019.02.011
https://doi.org/10.1016/j.dam.2019.02.011
Autor:
Ahad N. Zehmakan
Publikováno v:
Discrete Mathematics, 344 (2)
Consider a graph G and an initial random configuration, where each node is black with probability p and white otherwise, independently. In discrete-time rounds, each node becomes black if it has at least r black neighbors and white otherwise. We prov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5e7b75054554c9581fd31765a99f140
https://hdl.handle.net/20.500.11850/454339
https://hdl.handle.net/20.500.11850/454339
Autor:
Ahad N. Zehmakan, Charlotte Out
Consider a graph $G$, representing a social network. Assume that initially each node is colored either black or white, which corresponds to a positive or negative opinion regarding a consumer product or a technological innovation. In the majority mod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::989fd2e8dda0243971cc5f37e65b82aa
Autor:
Serge Galam, Ahad N. Zehmakan
Publikováno v:
Chaos: An Interdisciplinary Journal of Nonlinear Science
Chaos: An Interdisciplinary Journal of Nonlinear Science, 2020, 30 (7), pp.-. ⟨10.1063/5.0006984⟩
Chaos: An Interdisciplinary Journal of Nonlinear Science, 30(7), .-. (2020-07)
Chaos: An Interdisciplinary Journal of Nonlinear Science, 2020, 30 (7), pp.-. ⟨10.1063/5.0006984⟩
Chaos: An Interdisciplinary Journal of Nonlinear Science, 30(7), .-. (2020-07)
The dynamics of rumor spreading is investigated using a model with three kinds of agents who are, respectively, the Seeds, the Agnostics, and the Others. While Seeds are the ones who start spreading the rumor being adamantly convinced of its truth, A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df1a894da43d34e5b2d6abf2908dd8b2
https://hal-sciencespo.archives-ouvertes.fr/hal-02997361
https://hal-sciencespo.archives-ouvertes.fr/hal-02997361
Autor:
Ahad N. Zehmakan
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783030134341
LATA
LATA
Assume that you are given a graph \(G=(V,E)\) with an initial coloring, where each node is black or white. Then, in discrete-time rounds all nodes simultaneously update their color following a predefined deterministic rule. This process is called two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::859cc3fd19e19fc37c074dbd64b28908
https://doi.org/10.1007/978-3-030-13435-8_28
https://doi.org/10.1007/978-3-030-13435-8_28
The operation of transforming one spanning tree into another by replacing an edge has been considered widely, both for general and planar straight-line graphs. For the latter, several variants have been studied (e.g., edge slides and edge rotations).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a0fb845687ce9ed2c4136a9f621a4976
http://arxiv.org/abs/1810.02839
http://arxiv.org/abs/1810.02839