scholarly journals Random additions in urns of integers

2021 ◽  
Vol 58 (2) ◽  
pp. 335-346
Author(s):  
Mackenzie Simper
Keyword(s):  
Finite Group ◽  
Random Process ◽  
Uniform Distribution ◽  
Discrete Time ◽  
Random Variable ◽  
Urn Model ◽  
Infinite Type ◽  
The Mean ◽  
A Finite Group ◽  
Proof Of Convergence

AbstractConsider an urn containing balls labeled with integer values. Define a discrete-time random process by drawing two balls, one at a time and with replacement, and noting the labels. Add a new ball labeled with the sum of the two drawn labels. This model was introduced by Siegmund and Yakir (2005) Ann. Prob.33, 2036 for labels taking values in a finite group, in which case the distribution defined by the urn converges to the uniform distribution on the group. For the urn of integers, the main result of this paper is an exponential limit law. The mean of the exponential is a random variable with distribution depending on the starting configuration. This is a novel urn model which combines multi-drawing and an infinite type of balls. The proof of convergence uses the contraction method for recursive distributional equations.

scholarly journals PERMUTATIONS OF STRONGLY SELF-ABSORBING C*-ALGEBRAS

2008 ◽  
Vol 19 (09) ◽  
pp. 1137-1145 ◽  
Author(s):  
ILAN HIRSHBERG ◽  
WILHELM WINTER
Keyword(s):  
Finite Group ◽  
C Algebra ◽  
C Algebras ◽  
Infinite Type ◽  
A Finite Group

Let G be a finite group acting on {1,…,n}. For any C*-algebra [Formula: see text], this defines an action α of G on [Formula: see text]. We show that if [Formula: see text] tensorially absorbs a UHF algebra of infinite type, the Jiang–Su algebra, or is approximately divisible, then [Formula: see text] has the corresponding property as well.

scholarly journals The Intersection Graph of Subgroups of the Dihedral Group of Order 2pq

2021 ◽  
pp. 4923-4929
Author(s):  
Peshawa M. Khudhur ◽  
Rashad R. Haji ◽  
Sanhan M.S. Khasraw
Keyword(s):  
Finite Group ◽  
Dihedral Group ◽  
Intersection Graph ◽  
Vertex Set ◽  
The Mean ◽  
A Finite Group ◽  
Trivial Subgroup

   For a finite group G, the intersection graph   of G is the graph whose vertex set is the set of all proper non-trivial subgroups of G, where two distinct vertices are adjacent if their intersection is a non-trivial subgroup of G. In this article, we investigate the detour index, eccentric connectivity, and total eccentricity polynomials of the intersection graph  of subgroups of the dihedral group  for distinct primes . We also find the mean distance of the graph  .

ON HIGHER FROBENIUS–SCHUR INDICATORS

2021 ◽  
pp. 1-11
Author(s):  
YANJUN LIU ◽  
WOLFGANG WILLEMS
Keyword(s):  
Finite Group ◽  
Representation Theory ◽  
Irreducible Characters ◽  
A Finite Group

Abstract Similarly to the Frobenius–Schur indicator of irreducible characters, we consider higher Frobenius–Schur indicators $\nu _{p^n}(\chi ) = |G|^{-1} \sum _{g \in G} \chi (g^{p^n})$ for primes p and $n \in \mathbb {N}$ , where G is a finite group and $\chi $ is a generalised character of G. These invariants give answers to interesting questions in representation theory. In particular, we give several characterisations of groups via higher Frobenius–Schur indicators.

On the absorption probabilities and mean time for absorption for discrete Markov chains

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Nikolaos Halidias
Keyword(s):  
Markov Chain ◽  
Random Walk ◽  
Markov Chains ◽  
Generating Function ◽  
Discrete Time ◽  
Probability Generating Function ◽  
The Mean ◽  
Mean Time ◽  
Absorption Probabilities

Abstract In this note we study the probability and the mean time for absorption for discrete time Markov chains. In particular, we are interested in estimating the mean time for absorption when absorption is not certain and connect it with some other known results. Computing a suitable probability generating function, we are able to estimate the mean time for absorption when absorption is not certain giving some applications concerning the random walk. Furthermore, we investigate the probability for a Markov chain to reach a set A before reach B generalizing this result for a sequence of sets A 1 , A 2 , … , A k {A_{1},A_{2},\dots,A_{k}} .

scholarly journals Finite groups with some weakly pronormal subgroups

2020 ◽  
Vol 18 (1) ◽  
pp. 1742-1747
Author(s):  
Jianjun Liu ◽  
Mengling Jiang ◽  
Guiyun Chen
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
A Finite Group

Abstract A subgroup H of a finite group G is called weakly pronormal in G if there exists a subgroup K of G such that G = H K G=HK and H ∩ K H\cap K is pronormal in G. In this paper, we investigate the structure of the finite groups in which some subgroups are weakly pronormal. Our results improve and generalize many known results.

𝒫-characters and the structure of finite solvable groups

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Jiakuan Lu ◽  
Kaisun Wu ◽  
Wei Meng
Keyword(s):  
Finite Group ◽  
Maximal Subgroup ◽  
Solvable Group ◽  
Irreducible Character ◽  
Solvable Groups ◽  
Irreducible Constituent ◽  
A Finite Group

AbstractLet 𝐺 be a finite group. An irreducible character of 𝐺 is called a 𝒫-character if it is an irreducible constituent of (1_{H})^{G} for some maximal subgroup 𝐻 of 𝐺. In this paper, we obtain some conditions for a solvable group 𝐺 to be 𝑝-nilpotent or 𝑝-closed in terms of 𝒫-characters.

Sign in / Sign up

Export Citation Format

Share Document