Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Takeharu Shiraga"'
Autor:
Takeharu Shiraga, Shuji Kijima
Analysis of algorithms on time-varying networks (often called evolving graphs) is a modern challenge in theoretical computer science. The edge-Markovian is a relatively simple and comprehensive model of evolving graphs: every pair of vertices which i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f89a68eabdf222fe11b1dd795c8ab5e5
http://arxiv.org/abs/2208.12130
http://arxiv.org/abs/2208.12130
Autor:
Takeharu Shiraga, Nobutaka Shimizu
Publikováno v:
Random Structures & Algorithms. 59:96-140
This paper is concerned with voting processes on graphs where each vertex holds one of two different opinions. In particular, we study the \emph{Best-of-two} and the \emph{Best-of-three}. Here at each synchronous and discrete time step, each vertex u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97d3340e4445c2aa992abdc7f42c6968
https://doi.org/10.1002/rsa.20992
https://doi.org/10.1002/rsa.20992
Publikováno v:
Optimization Methods and Software. 36:316-325
In the air-traffic control, the information related to each air-plane needs to be always displayed as the label. Motivated by this application, de Berg and Gerrits (Comput. Geom. 2012) presented free-label maximization problem, where the goal is to m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c073d65682245a6f8db343f1687fc1a
https://doi.org/10.1080/10556788.2020.1833880
https://doi.org/10.1080/10556788.2020.1833880
Publikováno v:
Random Structures & Algorithms. 53:561-585
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5fa5e4985bf98aad5aab0c7498f2c5a9
https://doi.org/10.1002/rsa.20822
https://doi.org/10.1002/rsa.20822
Autor:
Takeharu Shiraga
A deterministic random walk is a deterministic process analogous to a random walk. While there are some results on the cover time of the rotor-router model, which is a deterministic random walk corresponding to a simple random walk, nothing is known
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dec036a308a23d5d94c5dd0660bd52ac
http://arxiv.org/abs/1602.07729
http://arxiv.org/abs/1602.07729
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662486528
DISC
DISC
Distributed voting is a fundamental topic in distributed computing. In the standard model of pull voting, at each step every vertex chooses a neighbour uniformly at random and adopts its opinion. The voting is completed when all vertices hold the sam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3089c3921ba08e655c73aea6b6da30a
https://doi.org/10.1007/978-3-662-48653-5_17
https://doi.org/10.1007/978-3-662-48653-5_17
Publikováno v:
ANALCO
Scopus-Elsevier
Scopus-Elsevier
Motivated by a derandomization of Markov chain Monte Carlo (MCMC), this paper investigates a deterministic random walk, which is a deterministic process analogous to a random walk. There is some recent progress in the analysis of the vertex-wise disc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f391b93117f841f0019e2ee7cc6fc84d
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783319252575
SIROCCO
SIROCCO
We consider the rotor-router mechanism for distributing particles in an undirected graph. If the last particle passing through a vertex v took an edge v,u, then the next time a particle is at v, it will leave v along the next edge v,w according to a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9baa4b6b053c7483baa11f369274518
https://doi.org/10.1007/978-3-319-25258-2_31
https://doi.org/10.1007/978-3-319-25258-2_31
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319087825
COCOON
COCOON
Markov chain Monte Carlo (MCMC) is a standard technique to sample from a target distribution by simulating Markov chains. In an analogous fashion to MCMC, this paper proposes a deterministic sampling algorithm based on deterministic random walk, such
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d39d91274e51a1567fbc6911e379a371
https://doi.org/10.1007/978-3-319-08783-2_3
https://doi.org/10.1007/978-3-319-08783-2_3