BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Yusuke Ide

Yusuke Ide contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
quant-phmath-phmath.MPmath.PRmath.COComputation and LanguageDiscrete Mathematicscond-mat.stat-mechmath.SPnlin.AOnlin.PSSocial and Information Networks

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
18works
0followers
12topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

18 published item(s)

preprint2026arXiv

Towards Automated Lexicography: Generating and Evaluating Definitions for Learner's Dictionaries

We study dictionary definition generation (DDG), i.e., the generation of non-contextualized definitions for given headwords. Dictionary definitions are an essential resource for learning word senses, but manually creating them is costly, which motivates us to automate the process. Specifically, we address learner's dictionary definition generation (LDDG), where definitions should consist of simple words. First, we introduce a reliable evaluation approach for DDG, based on our new evaluation criteria and powered by an LLM-as-a-judge. To provide reference definitions for the evaluation, we also construct a Japanese dataset in collaboration with a professional lexicographer. Validation results demonstrate that our evaluation approach agrees reasonably well with human annotators. Second, we propose an LDDG approach via iterative simplification with an LLM. Experimental results indicate that definitions generated by our approach achieve high scores on our criteria while maintaining lexical simplicity.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

What Makes Words Hard? Sakura at BEA 2026 Shared Task on Vocabulary Difficulty Prediction

We describe two types of models for vocabulary difficulty prediction: a high-accuracy black-box model, which achieved the top shared task result in the open track, and an explainable model, which outperforms a fine-tuned encoder baseline. As the black-box model, we fine-tuned an LLM using a soft-target loss function for effective application to the rating task, achieving r > 0.91. The explainable model provides insights into what impacts the difficulty of each item while maintaining a strong correlation (r > 0.77). We further analyze the results, demonstrating that the difficulty of items in the British Council's Knowledge-based Vocabulary Lists (KVL) is often affected by spelling difficulty or the construction of the test items, in addition to the genuine production difficulty of the words. We make our code available online at https://github.com/adno/vocabulary-difficulty .

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Scaling limit of the time averaged distribution for continuous time quantum walk and Szegedy's walk on the path

In this paper, we consider Szegedy's walk, a type of discrete time quantum walk, and corresponding continuous time quantum walk related to the birth and death chain. We show that the scaling limit of time averaged distribution for the continuous time quantum walk induces that of Szegedy's walk if there exists the spectral gap on so-called the corresponding Jacobi matrix .

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Eigenvalues of quantum walk induced by recurrence properties of the underlying birth and death process: application to computation of an edge state

In this paper, we consider an extended coined Szegedy model and discuss the existence of the point spectrum of induced quantum walks in terms of recurrence properties of the underlying birth and death process. We obtain that if the underlying random walk is not null recurrent, then the point spectrum exists in the induced quantum walks. As an application, we provide a simple computational way of the dispersion relation of the edge state part for the topological phase model driven by quantum walk using the recurrence properties of underlying birth and death process.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Turing instability in Reaction-Diffusion models on complex networks

In this paper, the Turing instability in reaction-diffusion models defined on complex networks is studied. Here, we focus on three types of models which generate complex networks, i.e. the Erdős-Rényi, the Watts-Strogatz, and the threshold network models. From analysis of the Laplacian matrices of graphs generated by these models, we numerically reveal that stable and unstable regions of a homogeneous steady state on the parameter space of two diffusion coefficients completely differ, depending on the network architecture. In addition, we theoretically discuss the stable and unstable regions in the cases of regular enhanced ring lattices which include regular circles, and networks generated by the threshold network model when the number of vertices is large enough.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

Analytical solutions for quantum walks on 1D chain with different shift operators

In this paper, we study the discrete-time quantum walks on 1D Chain with the moving and swapping shift operators. We derive analytical solutions for the eigenvalues and eigenstates of the evolution operator $\hat{U}$ using the Chebyshev polynomial technique, and calculate the long-time averaged probabilities for the two different shift operators respectively. It is found that the probability distributions for the moving and swapping shift operators display completely different characteristics. For the moving shift operator, the probability distribution exhibits high symmetry where the probabilities at mirror positions are equal. The probabilities are inversely proportional to the system size $N$ and approach to zero as $N\rightarrow \infty$. On the contrary, for the swapping shift operator, the probability distribution is not symmetric, the probability distribution approaches to a power-law stationary distribution as $N\rightarrow \infty$ under certain coin parameter condition. We show that such power-law stationary distribution is determined by the eigenstates of the eigenvalues $\pm1$ and calculate the intrinsic probability for different starting positions. Our findings suggest that the eigenstates corresponding to eigenvalues $\pm1$ play an important role for the swapping shift operator.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

Asymptotic analysis of the one-dimensional quantum walks by the Tsallis and Rényi entropies

The Tsallis and Rényi entropies are important quantities in the information theory, statistics and related fields because the Tsallis entropy is an one parameter generalization of the Shannon entropy and the Rényi entropy includes several useful entropy measures such as the Shannon entropy, Min-entropy and so on, as special choices of its parameter. On the other hand, the discrete-time quantum walk plays important roles in various applications, for example, quantum speed-up algorithm and universal computation. In this paper, we show limiting behaviors of the Tsallis and Rényi entropies for discrete-time quantum walks on the line which are starting from the origin and defined by arbitrary coin and initial state. The results show that the Tsallis entropy behaves in polynomial order of time with the parameter dependent exponent while the Rényi entropy tends to infinity in logarithmic order of time independent of the choice of the parameter. Moreover, we show the difference between the Rényi entropy and the logarithmic function characterizes by the Rényi entropy of the limit distribution of the quantum walk. In addition, we show an example of asymptotic behavior of the conditional Rényi entropies of the quantum walk.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

Local subgraph structure can cause localization in continuous-time quantum walk

In this paper, we consider continuous-time quantum walks (CTQWs) on finite graphs determined by the Laplacian matrices. By introducing fully interconnected graph decomposition of given graphs, we show a decomposition method for the Laplacian matrices. Using the decomposition method, we show several conditions for graph structure which return probability of CTQW tends to 1 while the number of vertices tends to infinity.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

Localization of discrete time quantum walks on the glued trees

In this paper, we consider the time averaged distribution of discrete time quantum walks on the glued trees. In order to analyse the walks on the glued trees, we consider a reduction to the walks on path graphs. Using a spectral analysis of the Jacobi matrices defined by the corresponding random walks on the path graphs, we have spectral decomposition of the time evolution operator of the quantum walks. We find significant contributions of the eigenvalues $\pm 1$ of the Jacobi matrices to the time averaged limit distribution of the quantum walks. As a consequence we obtain lower bounds of the time averaged distribution.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Combinatorial and approximative analyses in a spatially random division process

For a spatial characteristic, there exist commonly fat-tail frequency distributions of fragment-size and -mass of glass, areas enclosed by city roads, and pore size/volume in random packings. In order to give a new analytical approach for the distributions, we consider a simple model which constructs a fractal-like hierarchical network based on random divisions of rectangles. The stochastic process makes a Markov chain and corresponds to directional random walks with splitting into four particles. We derive a combinatorial analytical form and its continuous approximation for the distribution of rectangle areas, and numerically show a good fitting with the actual distribution in the averaging behavior of the divisions.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

Symmetry and localization of quantum walk induced by extra link in cycles

In this paper, we study the impact of single extra link on the coherent dynamics modeled by continuous-time quantum walks. For this purpose, we consider the continuous-time quantum walk on the cycle with an additional link. We find that the additional link in cycle indeed cause a very different dynamical behavior compared to the dynamical behavior on the cycle. We analytically treat this problem and calculate the Laplacian spectrum for the first time, and approximate the eigenvalues and eigenstates using the Chebyshev polynomial technique and perturbation theory. It is found that the probability evolution exhibits a similar behavior like the cycle if the exciton starts far away from the two ends of the added link. We explain this phenomenon by the eigenstate of the largest eigenvalue. We prove symmetry of the long-time averaged probabilities using the exact determinant equation for the eigenvalues expressed by Chebyshev polynomials. In addition, there is a significant localization when the exciton starts at one of the two ends of the extra link, we show that the localized probability is determined by the largest eigenvalue and there is a significant lower bound for it even in the limit of infinite system. Finally, we study the problem of trapping and show the survival probability also displays significant localization for some special values of network parameters, and we determine the conditions for the emergence of such localization. All our findings suggest that the different dynamics caused by the extra link in cycle is mainly determined by the largest eigenvalue and its corresponding eigenstate. We hope the Laplacian spectral analysis in this work provides a deeper understanding for the dynamics of quantum walks on networks.

0 citations0 reviewsNo code linkedOpen access
preprint2011arXiv

Entanglement for discrete-time quantum walks on the line

The discrete-time quantum walk is a quantum counterpart of the random walk. It is expected that the model plays important roles in the quantum field. In the quantum information theory, entanglement is a key resource. We use the von Neumann entropy to measure the entanglement between the coin and the particle's position of the quantum walks. Also we deal with the Shannon entropy which is an important quantity in the information theory. In this paper, we show limits of the von Neumann entropy and the Shannon entropy of the quantum walks on the one dimensional lattice starting from the origin defined by arbitrary coin and initial state. In order to derive these limits, we use the path counting method which is a combinatorial method for computing probability amplitude.

0 citations0 reviewsNo code linkedOpen access
preprint2010arXiv

Continuous-time quantum walks on the threshold network model

It is well known that many real world networks have the power-law degree distribution (scale-free property). However there are no rigorous results for continuous-time quantum walks on such realistic graphs. In this paper, we analyze space-time behaviors of continuous-time quantum walks and random walks on the threshold network model which is a reasonable candidate model having scale-free property. We show that the quantum walker exhibits localization at the starting point, although the random walker tends to spread uniformly.

0 citations0 reviewsNo code linkedOpen access
preprint2007arXiv

Statistical properties of a generalized threshold network model

The threshold network model is a type of finite random graphs. In this paper, we introduce a generalized threshold network model. A pair of vertices with random weights is connected by an edge when real-valued functions of the pair of weights belong to given Borel sets. We extend several known limit theorems for the number of prescribed subgraphs to show that the strong law of large numbers can be uniform convergence. We also prove two limit theorems for the local and global clustering coefficients.

0 citations0 reviewsNo code linkedOpen access