14 papers · ranked by Valyu relevance
Binhe Chen, Yaodan Chen, Li Cao, Changzu Chen + 3 more
The Crested Porcupine Optimizer (CPO), as a newly emerging swarm intelligence algorithm, demonstrates advantages in balancing global exploration and local exploitation but still suffers from limitations in convergence speed and local exploitation precision. To address these issues, this paper proposes an enhanced…
Alexander Klotz, Everett Sullivan
A growing self-avoiding walk (GSAW) is a stochastic process that starts from the origin on a lattice and grows by occupying an unoccupied adjacent lattice site at random. A sufficiently long GSAW will reach a state in which all adjacent sites are already occupied by the walk and become trapped, terminating the process.…
Pete Rigas
We extend computations for the scaling limit of the prudent walk on the square lattice, due to Beffara, Friedli, and Velenik in 2010, to obtain the scaling limit of the prudent walk on the triangular lattice. In comparison to computing the probability that a short excursion, which is contained with some box of side…
Wanqing Li, Yingxia Shao, Junping Du, Bin Cui + 1 more
Random walk is widely used in many graph analysis tasks, especially the first-order random walk. However, as a simplification of real-world problems, the first-order random walk is poor at modeling higher-order structures in the data. Recently, second-order random walk-based applications (e.g., Node2vec, Second-order…
Li Gan
We derive explicit closed-form expressions for the generating function CN (A), which enumerates classical closed random walks on square and triangular lattices with N steps and a signed area A, characterized by the number of moves in each hopping direction. This enumeration problem is mapped to the trace of powers of…
Colin Defant, Pakawut Jiradilok
where area(P) and perim(P) are the (appropriately normalized) area and perimeter of P, respectively, and cyc(P) is the number of cycles in πP . The inequality concerning area(P) is tight, and we characterize the polygons P satisfying area(P) = 6 cyc(P) − 6. These results can be reformulated in the language of…
Wen-Hao Zhou, Xiao-Wei Wang, Ruo-Jing Ren, Yu-Xuan Fu + 4 more
Quantum walks provide a speed-up in computational power for various quantum algorithms and serve as inspiration for the construction of complex graph representations. Many pioneering works have been dedicated to expanding the experimental state space and the complexity of graphs. However, these experiments are mostly…
Hirotaka Uchitomi, Yuki Hirobe, Yoshihiro Miyake
State-of-the-art estimation methods using inertial measurement units (IMUs) for global continuous gait path and local stepwise gait trajectory during walking have been developed. However, estimation methods for continuous gait trajectory integrating both these aspects with high accuracy are almost lacking. Thus…
Norberto Lucero-Azuara, Rainer Klages
Imagine you walk in a plane. You move by making a step of a certain length per time interval in a chosen direction. Repeating this process by randomly sampling step length and turning angle defines a two-dimensional random walk in what we call comoving frame coordinates. This is precisely how Ross and Pearson proposed…
Jonathan B. Dingwell, Anna C. Render, David M. Desmet, Joseph P. Cusumano
People rarely walk in straight lines. Instead, we make frequent turns or other maneuvers. Spatiotemporal parameters fundamentally characterize gait. For straight walking, these parameters are well-defined for that task of walking on a straight path. Generalizing these concepts to non-straight walking, however, is not…
Saori Yoshino, Honoka Shiratori, Tomoki Yamagami, Ryoichi Horisaki + 3 more
'Etsuo Segawa' 'Paolo Bordone' 'Luca Razzoli'] We propose a model that interpolates between quantum walks and persistent (correlated) random walks using one parameter on the one-dimensional lattice. We show that the limit distribution is described by the normal variance mixture with the arcsine law.
Munenori Takaku, Tomoki Fukai
The hippocampus (HPC), prefrontal cortex (PFC), and thalamic nuclei, such as reuniens (Re), form a reciprocally connected circuit that plays a critical role in processing hippocampus-dependent memory. Accumulating evidence suggests that this triangular modular circuit is crucial for performing cognitive tasks that…
Ali Tehrani Safa, Tirthabir Biswas, Arun Ramakrishnan, Vikas Bhandawat
Two simple models – vaulting over stiff legs and rebounding over compliant legs – are employed to describe the mechanics of legged locomotion. It is agreed that compliant legs are necessary for describing running and that legs are compliant while walking. Despite this agreement, stiff legs continue to be employed to…
Ping Yang, E. Adrian Henle, Cory M. Simon, Xiaoli Fern
Pesticides benefit agriculture by increasing crop yield, quality, and security. However, pesticides may inadvertently harm bees, which are valuable as pollinators. Thus, candidate pesticides in development pipelines must be assessed for toxicity to bees. Leveraging a data set of 382 molecules with toxicity labels from…