Related papers: Directed and multi-directed animals on the king's …
As robotic agents increasingly assist humans in reality, quadruped robots offer unique opportunities for interaction in complex scenarios due to their agile movement. However, building agents that can autonomously navigate, adapt, and…
We address here the problem of generating random graphs uniformly from the set of simple connected graphs having a prescribed degree sequence. Our goal is to provide an algorithm designed for practical use both because of its ability to…
We study the scale function, space of directions and scale-multiplicative semigroups for restricted Burger-Mozes groups. We relate these general notions to intrinsic properties of the group. Among other things, we give a formula for the…
In a graph, a watchman's walk is a minimum closed dominating walk. Given a graph $G$ and a single watchman, the length of a watchman's walk in $G$ (the watchman number) is denoted by $w(G)$ and the typical goals of the watchman's walk…
In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…
There is a growing interest in learning a velocity command tracking controller of quadruped robot using reinforcement learning due to its robustness and scalability. However, a single policy, trained end-to-end, usually shows a single gait…
The sliding square model is a widely used abstraction for studying self-reconfigurable robotic systems, where modules are square-shaped robots that move by sliding or rotating over one another. In this paper, we propose a novel distributed…
Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…
Directed spiral percolation (DSP), percolation under both directional and rotational constraints, is studied on the triangular lattice in two dimensions (2D). The results are compared with that of the 2D square lattice. Clusters generated…
An exciting new algorithmic breakthrough has been advanced for how to carry out inferences in a Dempster-Shafer (DS) formulation of a categorical data generating model. The developed sampling mechanism, which draws on theory for directed…
We consider a decentralized stochastic learning problem where data points are distributed among computing nodes communicating over a directed graph. As the model size gets large, decentralized learning faces a major bottleneck that is the…
We analyze the signum-generation method for creating random dichotomic sequences with prescribed correlation properties. The method is based on a binary mapping of the convolution of continuous random numbers with some function originated…
We introduce the priority lattice, a structure arising from the priority search algorithm on rooted trees and forests. We prove bijectively that its maximal chains are labeled by parking functions, and that the maximal chains of its…
This study addresses a distributed optimization with a novel class of coupling of variables, called clique-wise coupling. A clique is a node set of a complete subgraph of an undirected graph. This setup is an extension of pairwise coupled…
Recent empirical research has indicated that human graph reading performance improves when crossing angles increase. However, crossing angle has not been used as an aesthetic criterion for graph drawing algorithms so far. In this paper, we…
We investigate models of (1+d)-D Lorentzian semi-random lattices with one random (space-like) direction and d regular (time-like) ones. We prove a general inversion formula expressing the partition function of these models as the inverse of…
We extend the merging model for undirected networks by Kim et al. [Eur. Phys. J. B 43, 369 (2004)] to directed networks and investigate the emerging scale-free networks. Two versions of the directed merging model, friendly and hostile…
The C-Orientation problem asks whether it is possible to orient an undirected graph to a directed phylogenetic network of a desired network class C. This problem arises, for example, when visualising evolutionary data, as popular methods…
In this series we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects like undirected graphs, directed graphs, bidirected graphs, hypergraphs or finitary matroids. In…
The main goal of this paper is to provide an algorithm for the random sampling of Butcher trees and the probabilistic numerical solution of ordinary differential equations (ODEs). This approach complements and simplifies a recent approach…