activity
20192021
most citedA Note on Enumeration by Fair Sampling

1 citations · 1 across the 3 of their papers we have counts for

collaborators

5 papers

nlin.AO2021

Transfer entropy dependent on distance among agents in quantifying leader-follower relationships

Udoy S. Basak, Sulimon Sattari, Md. Motaleb Hossain +2

Synchronized movement of (both unicellular and multicellular) systems can be observed almost everywhere. Understanding of how organisms are regulated to synchronized behavior is on…

quant-ph20211 cited

A Note on Enumeration by Fair Sampling

Yuta Mizuno, Tamiki Komatsuzaki

This note describes an algorithm for enumerating all the elements in a finite set based on uniformly random sampling from the set. This algorithm can be used for enumeration by fai…

nlin.AO2020

An information-theoretic approach to infer the underlying interaction domain among elements from finite length trajectories in a noisy environment

Udoy S. Basak, Sulimon Sattari, Hossain M. Motaleb +2

Transfer entropy in information theory was recently demonstrated [Phys. Rev. E 102, 012404 (2020)] to enable us to elucidate the interaction domain among interacting elements solel…

quant-ph2020

Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102,400 nodes

Yuya Sugie, Yuki Yoshida, Normann Mertig +7

Minor embedding heuristics have become an indispensable tool for compiling problems in quadratically unconstrained binary optimization (QUBO) into the hardware graphs of quantum an…

cs.LG2019

A Bad Arm Existence Checking Problem

Koji Tabata, Atsuyoshi Nakamura, Junya Honda +1

We study a bad arm existing checking problem in which a player's task is to judge whether a positive arm exists or not among given K arms by drawing as small number of arms as poss…