Related papers: Stabilizers of consistent walks
The fixing number of a graph $G$ is the order of the smallest subset $S$ of its vertex set $V(G)$ such that stabilizer of $S$ in $G$, $\Gamma_{S}(G)$ is trivial. Let $G_{1}$ and $G_{2}$ be disjoint copies of a graph $G$, and let…
Consider $n$ points distributed uniformly in $[0,1]^d$. Form a graph by connecting two points if their mutual distance is no greater than $r(n)$. This gives a random geometric graph, $\gnrn$, which is connected for appropriate $r(n)$. We…
Let $G$ be a reductive algebraic group over an algebraically closed field and let $V$ be a quasi-projective $G$-variety. We prove that the set of points $v\in V$ such that ${\rm dim}(G_v)$ is minimal and $G_v$ is reductive is open. We also…
We prove that the base size of a transitive group $G$ with solvable point stabilizer and with trivial solvable radical is not greater than $k$ provided the same statement holds for the group of $G$-induced automorphisms of each nonabelian…
A $2$-distance-transitive graph is a vertex-transitive graph whose vertex stabilizer is transitive on both the first step and the second step neighborhoods. In this paper, we first answer a question of A. Devillers, M. Giudici, C. H. Li and…
Let $G\curvearrowright T$ be a minimal action on an $\mathbb{R}$--tree with $G$ finitely presented. Assuming that $G$ is accessible over the family of arc-stabilisers of $T$, we give a description of the point-stabilisers of $T$ in terms of…
Stabilization of graphs has received substantial attention in recent years due to its connection to game theory. Stable graphs are exactly the graphs inducing a matching game with non-empty core. They are also the graphs that induce a…
In this paper we discuss a method for bounding the size of the stabiliser of a vertex in a $G$-vertex-transitive graph $\Gamma$. In the main result the group $G$ is quasiprimitive or biquasiprimitive on the vertices of $\Gamma$, and we…
A graph $\Ga$ is $G$-symmetric if $\Ga$ admits $G$ as a group of automorphisms acting transitively on the set of vertices and the set of arcs of $\Ga$, where an arc is an ordered pair of adjacent vertices. In the case when $G$ is…
A graph $\G$ is {\em symmetric} or {\em arc-transitive} if its automorphism group $\Aut(\G)$ is transitive on the arc set of the graph, and $\G$ is {\em basic} if $\Aut(\G)$ has no non-trivial normal subgroup $N$ such that the quotient…
The main result of this paper is that, if $\Gamma$ is a finite connected $4$-valent arc-transitive graph, then either $\Gamma$ is part of a well-understood family of graphs, or every non-identity automorphism of $\Gamma$ fixes at most $1/3$…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
A graph $G$ on $n$ vertices is \textit{pancyclic} if it contains cycles of length $t$ for all $3 \leq t \leq n$. In this paper we prove that for any fixed $\epsilon>0$, the random graph $G(n,p)$ with $p(n)\gg n^{-1/2}$ asymptotically almost…
An original non-standard approach to describing the structure of a column stabilizer in a group of $n \times n$ matrices over a polynomial ring or a Laurent polynomial ring of $n$ variables is presented. The stabilizer is described as an…
A graph is called {\em arc-transitive} (or {\em symmetric}) if its automorphism group has a single orbit on ordered pairs of adjacent vertices, and 2-arc-transitive its automorphism group has a single orbit on ordered paths of length 2. In…
We study the behaviour of a sequence of biased random walks X(i), i>=0 on a sequence of random graphs, where the initial graph is Zd and otherwise the graph for the i-th walk is the trace of the (i - 1)-st walk. The sequence of bias vectors…
In this paper an emergence of leader-following model based on graph theory on the arbitrary time scales is investigated. It means that the step size is not necessarily constant but it is a function of time. We propose and prove conditions…
Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a…
We consider the combinatorial properties of the trace of a random walk on the complete graph and on the random graph $G(n,p)$. In particular, we study the appearance of a fixed subgraph in the trace. We prove that for a subgraph containing…
This paper introduces and studies the stability of the strong domination number of a graph, denoted $\operatorname{st}_{\gamma_{st}}(G)$, defined as the minimum number of vertices whose removal changes the strong domination number…