相关论文: Scenery Reconstruction on Finite Abelian Groups
In this paper we present a graph theoretic construction of Steiner quadruple systems (SQS) admitting abelian groups as point-regular automorphism groups. The resulting SQS has an extra property which we call A-reversibility, where A is the…
In this paper we introduce the notion of Random Walk in Changing Environment - a random walk in which each step is performed in a different graph on the same set of vertices, or more generally, a weighted random walk on the same vertex and…
Time-series analysis is fundamental for modeling and predicting dynamical behaviors from time-ordered data, with applications in many disciplines such as physics, biology, finance, and engineering. Measured time-series data, however, are…
We consider a nonlinear random walk which, in each time step, is free to choose its own transition probability within a neighborhood (w.r.t. Wasserstein distance) of the transition probability of a fixed L\'evy process. In analogy to the…
A major task of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on a tree. Given samples from the leaves of the Markov chain, the goal is to reconstruct…
We continue classification of finite groups which can be used as symmetry group of the scalar sector of the four-Higgs-doublet model (4HDM). Our objective is to systematically construct non-abelian groups via the group extension procedure,…
We provide a characterization of distal ordered abelian groups: An ordered abelian group is distal if and only if, for each prime number $p$, the sizes of ribs with respect to the "valuation" $\mathfrak{s}_p$ are uniformly bounded. This…
In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent. Using a renewal approach, we derive the exact expressions of the stationary occupation…
We give three different criteria for transience of a Branching Markov Chain. These conditions enable us to give a classification of Branching Random Walks in Random Environment (BRWRE) on Cayley Graphs in recurrence and transience. This…
The versatility of renewal theory is owed to its abstract formulation. Renewals can be interpreted as steps of a random walk, switching events in two-state models, domain crossings of a random motion, etc. We here discuss a renewal process…
In this paper, we study properties of random walks on finite groups and later use them to obtain the limiting braid length expectation and component number of braid closure in a model of random braids, which is constructed by lifting…
The abelianization is a functor from groups to abelian groups, which is left adjoint to the inclusion functor. Being a left adjoint, the abelianization functor commutes with all small colimits. In this paper we investigate the relation…
In this paper, we introduce the periodic tiling (PT) property for finite abelian groups. A finite abelian group is said to have the PT property if every non-periodic set that tiles the group by translation admits a periodic tiling…
The dynamics of numerous physical systems, such as spins and qubits, can be described as a series of rotation operations, i.e., walks in the manifold of the rotation group. A basic question with practical applications is how likely and…
We consider walks on the edges of the square lattice $\mathbb Z^2$ which obey \emph{two-step rules,} which allow (or forbid) steps in a given direction to be followed by steps in another direction. We classify these rules according to a…
The Tree Builder Random Walk is a special random walk that evolves on trees whose size increases with time, randomly and depending upon the walker. After every s steps of the walker, a random number of vertices are added to the tree and…
This paper defines and develops cycle indices for the finite classical groups. These tools are then applied to study properties of a random matrix chosen uniformly from one of these groups. Properties studied by this technique will include…
We analyze the Brownian Motion limit of a prototypical unit step reinforced random-walk on the half line. A reinforced random walk is one which changes the weight of any edge (or vertex) visited to increase the frequency of return visits.…
Two players alternate moves in the following impartial combinatorial game: Given a finitely generated abelian group $A$, a move consists of picking some nonzero element $a \in A$. The game then continues with the quotient group $A/ \langle…
There are various results in the literature which are part of the general philosophy that a finite group for which a certain parameter (for example, the number of conjugacy classes or the maximum number of elements inverted, squared or…