Related papers: Abelian networks III. The critical group

Given a graph G with a distinguished vertex s, the critical group of (G,s) is the cokernel of their reduced Laplacian matrix L(G,s). In this article we generalize the concept of the critical group to the cokernel of any matrix with entries…

We adapt the theory of partition rank and analytic rank to the category of abelian groups. If $A_1, \dots, A_k$ are finite abelian groups and $\phi : A_1 \times \cdots \times A_k \to \mathbf{T}$ is a multilinear map, where $\mathbf{T} =…

This paper investigates the critical group of a faithful representation of a finite group. It computes the order of the critical group in terms of the character values, and gives some restrictions on its subgroup structure. It also computes…

Let $G$ be a finite abelian group $G$ with $N$ elements. In this paper we give a O(N) time algorithm for computing a basis of $G$. Furthermore, we obtain an algorithm for computing a basis from a generating system of $G$ with $M$ elements…

The critical group K(G) of a directed graph G=(V,E) is the cokernel of the transpose of the Laplacian matrix of G acting on the integer lattice Z^V. For undirected graphs G, this has been considered by Bacher, de la Harpe, and Nagnibeda,…

We study the computations that Bayesian agents undertake when exchanging opinions over a network. The agents act repeatedly on their private information and take myopic actions that maximize their expected utility according to a fully…

It is well understood that the structure of a social network is critical to whether or not agents can aggregate information correctly. In this paper, we study social networks that support information aggregation when rational agents act…

Group cellular automata are continuous, shift-commuting endomorphisms of $G^\mathbb{Z}$, where $G$ is a finite group. We provide an easy-to-check characterization of expansivity for group cellular automata on abelian groups and we prove…

This paper deals with the classification of groups $G$ such that power graphs and proper power graphs of $G$ are line graphs. In fact, we classify all finite nilpotent groups whose power graphs are line graphs. Also, we categorize all…

Let $A$ be a set and $f:A\rightarrow A$ a bijective function. Necessary and sufficient conditions on $f$ are determined which makes it possible to endow $A$ with a binary operation $*$ such that $(A,*)$ is a cyclic group and $f\in…

This paper concentrates on positive definite functions on finite abelian groups, which are central to harmonic analysis and related fields. By leveraging the group structure and employing Fourier analysis, we establish a lower bound for the…

In random walk theory, it is customary to assume that a given walk is irreducible and/or aperiodic. While these prevailing assumptions make particularly tractable the analysis of random walks and help to highlight their diffusive nature,…

Novel computing hardwares are necessary to keep up with today's increasing demand for data storage and processing power. In this research project, we turn to the brain for inspiration to develop novel computing substrates that are…

Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…

Let $G$ be a finite abelian group viewed a $\mathbb{Z}$-module and let $\mathcal{G} = (V, E)$ be a simple graph. In this paper, we consider a graph $\Gamma(G)$ called as a \textit{group-annihilator} graph. The vertices of $\Gamma(G)$ are…

In general the endomorphisms of a non-abelian group do not form a ring under the operations of addition and composition of functions. Several papers have dealt with the ring of functions defined on a group which are endomorphisms when…

We study the frog model on Cayley graphs of groups with polynomial growth rate $D \geq 3$. The frog model is an interacting particle system in discrete time. We consider that the process begins with a particle at each vertex of the graph…

We construct, for the free group acting on its Cayley tree, boomerang subgroups whose critical exponent is arbitrarily close to the critical exponent of a given finitely generated subgroup.

We characterize the strong metric dimension of the power graph of a finite group. As applications, we compute the strong metric dimension of the power graph of a cyclic group, an abelian group, a dihedral group or a generalized quaternion…

In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…