Thèses sur le sujet « Products of groups »
Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Products of groups.
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleures thèses pour votre recherche sur le sujet « Products of groups ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
1
Pack, R. William. « Products of topological groups ». Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.390512.
Texte intégral
2
Green, Elisabeth Ruth. « Graph products of groups ». Thesis, University of Leeds, 1990. http://etheses.whiterose.ac.uk/236/.
Texte intégralRésumé :
In the 1970's Baudisch introduced the idea of the semifree group, that is, a group in which the only relators are commutators of generators. Baudisch was mainly concerned with subgroup problems, employing length arguments on the elements of these groups. More recently Droms and Servatius have continued the study of semifree, or graph groups, as they call them. They answer some of the questions left open by the work of Baudisch. It is possible to take the graph analogy a level higher and study graph products of groups, which not only generalise graph groups, but also free and direct products. In this thesis we seek to explore the properties of graph products of groups. After some preliminaries in chapter 1, chapter 2 quotes the main results from the work of Baudisch, Droms and Servatius on graph groups, and includes a few elementary results. In chapter 3 we show that many of the well known results about free products and direct products will generalise to graph products. We also extend some of the results on graph groups and give a counter example to a plausible conjecture. We develop a normal form for elements in graph products and, with the use of a generalised free product representation, show solvability of the word and conjugacy problems. In-chapter 4 we examine the concept of graphological indecomposability. Having disposed of an obvious conjecture by way of a counter example we present a number of isomorphism theorems. Chapter 5 is devoted to residual properties of graph products. Much work has been done by Stebe, Allenby and others on residual finiteness, conjugacy separability and potency of free groups and free products. We generalise some of these results. Finally, in chapter 6 we return to graph groups for a look at the Freiheitssatz. Various subclasses have been covered by Pride, Baumslag and Howie, and we seek to extend their results.
3
Ward, David Charles. « Topics in finite groups : homology groups, pi-product graphs, wreath products and cuspidal characters ». Thesis, University of Manchester, 2015. https://www.research.manchester.ac.uk/portal/en/theses/topics-in-finite-groups-homology-groups-piproduct-graphs-wreath-products-and-cuspidal-characters(7e90d219-fba7-4ff0-9071-c624acab7aaf).html.
Texte intégral
4
Wilson, James B. 1980. « Group decompositions, Jordan algebras, and algorithms for p-groups ». Thesis, University of Oregon, 2008. http://hdl.handle.net/1794/8302.
Texte intégralRésumé :
viii, 125 p. A print copy of this thesis is available through the UO Libraries. Search the library catalog for the location and call number.Finite p -groups are studied using bilinear methods which lead to using nonassociative rings. There are three main results, two which apply only to p -groups and the third which applies to all groups. First, for finite p -groups P of class 2 and exponent p the following are invariants of fully refined central decompositions of P : the number of members in the decomposition, the multiset of orders of the members, and the multiset of orders of their centers. Unlike for direct product decompositions, Aut P is not always transitive on the set of fully refined central decompositions, and the number of orbits can in fact be any positive integer. The proofs use the standard semi-simple and radical structure of Jordan algebras. These algebras also produce useful criteria for a p -group to be centrally indecomposable. In the second result, an algorithm is given to find a fully refined central decomposition of a finite p -group of class 2. The number of algebraic operations used by the algorithm is bounded by a polynomial in the log of the size of the group. The algorithm uses a Las Vegas probabilistic algorithm to compute the structure of a finite ring and the Las Vegas MeatAxe is also used. However, when p is small, the probabilistic methods can be replaced by deterministic polynomial-time algorithms. The final result is a polynomial time algorithm which, given a group of permutations, matrices, or a polycyclic presentation; returns a Remak decomposition of the group: a fully refined direct decomposition. The method uses group varieties to reduce to the case of p -groups of class 2. Bilinear and ring theory methods are employed there to complete the process.
Adviser: William M. Kantor
5
Griffin, James Thomas. « Automorphisms of free products of groups ». Thesis, University of Cambridge, 2013. https://www.repository.cam.ac.uk/handle/1810/244265.
Texte intégralRésumé :
The symmetric automorphism group of a free product is a group rich in algebraic structure and with strong links to geometric configuration spaces. In this thesis I describe in detail and for the first time the (co)homology of the symmetric automorphism groups. To this end I construct a classifying space for the Fouxe-Rabinovitch automorphism group, a large normal subgroup of the symmetric automorphism group. This classifying space is a moduli space of 'cactus products', each of which has the homotopy type of a wedge product of spaces. To study this space we build a combinatorial theory centred around 'diagonal complexes' which may be of independent interest. The diagonal complex associated to the cactus products consists of the set of forest posets, which in turn characterise the homology of the moduli spaces of cactus products. The machinery of diagonal complexes is then turned towards the symmetric automorphism groups of a graph product of groups. I also show that symmetric automorphisms may be determined by their categorical properties and that they are in particular characteristic of the free product functor. This goes some way to explain their occurence in a range of situations. The final chapter is devoted to a class of configuration spaces of Euclidean n-spheres embedded disjointly in (n+2)-space. When n = 1 this is the configuration space of unknotted, unlinked loops in 3-space, which has been well studied. We continue this work for higher n and find that the fundamental groups remain unchanged. We then consider the homology and the higher homotopy groups of the configuration spaces. Our last contribution is an epilogue which discusses the place of these groups in the wider field of mathematics. It is the functoriality which is important here and using this new-found emphasis we argue that there should exist a generalised version of the material from the final chapter which would apply to a far wider range of configuration spaces.
6
Laurence, Michael Rupen. « Automorphisms of graph products of groups ». Thesis, Queen Mary, University of London, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.412581.
Texte intégralRésumé :
Let r be a graph with vertex set V and for every v E V let Gv be a group with present ation (Sv I Rv). Let E ~ V X V be the set of pairs of adj acent vertices. Then we define the group G = Gr to be the group with presentation G = (SvVv E VI R; Vv E V, [Sv, SVI] = 1 iff (v,v') E E). In [2, LEMMA 3.3] it is shown that up to isomorphism G is independent of the choice of presentation of each group Gv. We call the group G a graph product of groups. Graph products include as special cases free products and direct products, corresponding to the graph G being dixcrete and complete respectively. If the vertex groups G; are infinite cyclic then G is called a graph group and we identify each vertex v with a fixed generator of the vertex group Gv• There is a normal form theorem for graph products which is a generalisation of the normal form theorem for free products and which was proved in [2]. In Part 1we give an alternative proof. We then move on to the study of automorphisms of graph products. In full generality this is an impossible task; however some progress can be made in certain special cases. We first consider the case where G is a graph group. Servatius in [1] gave a simple set of elements of Aut( G), which he calls elementary automorphisms, and proved that if certain conditions are imposed on the graph r then the elementary automorphisms generate Aut(G). In Part 2 we will prove that this holds for all finite graphs r. In Part 3 we study Aut( G) in the case where each vertex group Gv is cyclic of order p for some fixed prime p and we find a simple set of generators for Aut(G). In the case p = 2 we also obtain a presentation for Aut( G). In this case G is a right-angled Coxeter group
7
Goda, Keith Martin. « Centralisers in graph products of groups ». Thesis, University of Newcastle Upon Tyne, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.432489.
Texte intégral
8
Smith, Jeremy Francis. « Topics in products of nilpotent groups ». Thesis, University of Warwick, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340502.
Texte intégral
9
Sert, Cagri. « Joint Spectrum and Large Deviation Principles for Random Products of Matrices ». Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS500/document.
Texte intégralRésumé :
Après une introduction générale et la présentation d'un exemple explicite dans le chapitre 1, nous exposons certains outils et techniques généraux dans le chapitre 2.- dans le chapitre 3, nous démontrons l'existence d'un principe de grandes déviations (PGD) pour les composantes de Cartan le long des marches aléatoires sur les groupes linéaires semi -simples G. L'hypothèse principale porte sur le support S de la mesure de la probabilité en question et demande que S engendre un semi-groupe Zariski dense. - Dans le chapitre 4, nous introduisons un objet limite (une partie de la chambre de Weyl) que l'on associe à une partie bornée S de G et que nous appelons le spectre joint J(S) de S. Nous étudions ses propriétés et démontrons que J(S) est une partie convexe compacte d'intérieur non-vide dès que S engendre un semi -groupe Zariski dense. Nous relions le spectre joint avec la notion classique du rayon spectral joint et la fonction de taux du PGD pour les marches aléatoires. - Dans le chapitre 5, nous introduisons une fonction de comptage exponentiel pour un S fini dans G, nous étudions ses propriétés que nous relions avec J(S) et démontrons un théorème de croissance exponentielle dense. - Dans le chapitre 6, nous démontrons le PGD pour les composantes d'Iwasawa le long des marches aléatoires sur G. L'hypothèse principale demande l'absolue continuité de la mesure de probabilité par rapport à la mesure de Haar.- Dans le chapitre 7, nous développons des outils pour aborder une question de Breuillard sur la rigidité du rayon spectral d'une marche aléatoire sur le groupe libre. Nous y démontrons un résultat de rigidité géométriqueAfter giving a detailed introduction andthe presentation of an explicit example to illustrateour study in Chapter 1, we exhibit some general toolsand techniques in Chapter 2. Subsequently,- In Chapter 3, we prove the existence of a large deviationprinciple (LDP) with a convex rate function, forthe Cartan components of the random walks on linearsemisimple groups G. The main hypothesis is onthe support S of the probability measure in question,and asks S to generate a Zariski dense semigroup.- In Chapter 4, we introduce a limit object (a subsetof the Weyl chamber) that we associate to a boundedsubset S of G. We call this the joint spectrum J(S)of S. We study its properties and show that for asubset S generating a Zariski dense semigroup, J(S)is convex body, i.e. a convex compact subset of nonemptyinterior. We relate the joint spectrum withthe classical notion of joint spectral radius and therate function of LDP for random walks on G.- In Chapter 5, we introduce an exponential countingfunction for a nite S in G. We study its properties,relate it to joint spectrum of S and prove a denseexponential growth theorem.- In Chapter 6, we prove the existence of an LDPfor Iwasawa components of random walks on G. Thehypothesis asks for a condition of absolute continuityof the probability measure with respect to the Haarmeasure.- In Chapter 7, we develop some tools to tackle aquestion of Breuillard on the rigidity of spectral radiusof a random walk on a free group. We prove aweaker geometric rigidity result
10
Nazzal, Lamies Joureus. « Homomorphic images of semi-direct products ». CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2770.
Texte intégralRésumé :
The main purpose of this thesis is to describe methods of constructing computer-free proofs of existence of finite groups and give useful techniques to perform double coset enumeration of groups with symmetric presentations over their control groups.
11
Bhattacharjee, Meenaxi. « Amalgamated free products and inverse limits of wreath products of groups ». Thesis, University of Oxford, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305443.
Texte intégral
12
Hofmann, Eric [Verfasser]. « Automorphic Products on Unitary Groups / Eric Hofmann ». München : Verlag Dr. Hut, 2011. http://d-nb.info/1011441640/34.
Texte intégral
13
Metaftsis, Vasileios. « Studies on one-relator products of groups ». Thesis, Heriot-Watt University, 1994. http://hdl.handle.net/10399/1961.
Texte intégral
14
Ferov, Michal. « Separability properties of graph products of groups ». Thesis, University of Southampton, 2015. https://eprints.soton.ac.uk/384000/.
Texte intégral
15
Volkov, Oleksii. « Random Walks on Products of Hyperbolic Groups ». Thesis, Université d'Ottawa / University of Ottawa, 2021. http://hdl.handle.net/10393/41955.
Texte intégralRésumé :
The subject area of this thesis is the theory of random walks on groups. First, we
study random walks on products of hyperbolic groups and show that the Poisson
boundary can be identified with an appropriate geometric boundary (the skeleton).
Second, we show that in the particular case of free and free-product factors, the Hausdorff dimension of the conditional measures on product fibers of the Poisson boundary is related to the asymptotic entropy and the rate of escape of the corresponding conditional random walks via a generalized entropy-dimension formula.
16
Hendriksen, Michael Arent. « Minimal Permutation Representations of Classes of Semidirect Products of Groups ». Thesis, The University of Sydney, 2015. http://hdl.handle.net/2123/14353.
Texte intégralRésumé :
Given a finite group $G$, the smallest $n$ such that $G$ embeds into the symmetric group $S_n$ is referred to as the minimal degree. Much of the accumulated literature focuses on the interplay between minimal degrees and direct products. This thesis extends this to cover large classes of semidirect products. Chapter 1 provides a background for minimal degrees - stating and proving a number of essential theorems and outlining relevant previous work, along with some small original results. Chapter 2 calculates the minimal degrees for an infinite class of semidirect products - specifically the semidirect products of elementary abelian groups by groups of prime order not dividing the order of the base group. This is established using vector space theory, including a number of novel techniques. The utility of this research is then demonstrated by answering an existing problem in the field of minimal degrees in a new and potentially generalisable way.
17
Genevois, Anthony. « Cubical-like geometry of quasi-median graphs and applications to geometric group theory ». Thesis, Aix-Marseille, 2017. http://www.theses.fr/2017AIXM0569/document.
Texte intégralRésumé :
La classe des graphes quasi-médians est une généralisation des graphes médians, ou de manière équivalente, des complexes cubiques CAT(0). L'objectif de cette thèse est d'introduire ces graphes dans le monde de la théorie géométrique des groupes. Dans un premier temps, nous étendons la notion d'hyperplan définie dans les complexes cubiques CAT(0), et nous montrons que la géométrie d'un graphe quasi-médian se réduit essentiellement à la combinatoire de ses hyperplans. Dans la deuxième partie de notre texte, qui est le cœur de la thèse, nous exploitons la structure particulière des hyperplans pour démontrer des résultats de combinaison. L'idée principale est que si un groupe agit d'une bonne manière sur un graphe quasi-médian de sorte que les stabilisateurs de cliques satisfont une certaine propriété P de courbure négative ou nulle, alors le groupe tout entier doit satisfaire P également. Les propriétés que nous considérons incluent : l'hyperbolicité (éventuellement relative), les compressions lp (équivariantes), la géométrie CAT(0) et la géométrie cubique. Finalement, la troisième et dernière partie de la thèse est consacrée à l'application des critères généraux démontrés précédemment à certaines classes de groupes particulières, incluant les produits graphés, les groupes de diagrammes introduits par Guba et Sapir, certains produits en couronne, et certains graphes de groupes. Les produits graphés constituent notre application la plus naturelle, où le lien entre le groupe et son graphe quasi-médian associé est particulièrement fort et explicite; en particulier, nous sommes capables de déterminer précisément quand un produit graphé est relativement hyperboliqueThe class of quasi-median graphs is a generalisation of median graphs, or equivalently of CAT(0) cube complexes. The purpose of this thesis is to introduce these graphs in geometric group theory. In the first part of our work, we extend the definition of hyperplanes from CAT(0) cube complexes, and we show that the geometry of a quasi-median graph essentially reduces to the combinatorics of its hyperplanes. In the second part, we exploit the specific structure of the hyperplanes to state combination results. The main idea is that if a group acts in a suitable way on a quasi-median graph so that clique-stabilisers satisfy some non-positively curved property P, then the whole group must satisfy P as well. The properties we are interested in are mainly (relative) hyperbolicity, (equivariant) lp-compressions, CAT(0)-ness and cubicality. In the third part, we apply our general criteria to several classes of groups, including graph products, Guba and Sapir's diagram products, some wreath products, and some graphs of groups. Graph products are our most natural examples, where the link between the group and its quasi-median graph is particularly strong and explicit; in particular, we are able to determine precisely when a graph product is relatively hyperbolic
18
Alharbi, Manal. « Random Walks on Free Products of Cyclic Groups ». Thesis, Université d'Ottawa / University of Ottawa, 2018. http://hdl.handle.net/10393/37494.
Texte intégralRésumé :
In this thesis, we investigate examples of random walks on free products of cyclic groups. Free products are groups that contain words constructed by concatenation with possible simplifications[20]. Mairesse in [17] proved that the harmonic measure on the boundary of these random walks has a Markovian Multiplicative structure (this is a class of Markov measures which requires fewer parameters than the usual Markov measures for its description ), and also showed how in the case of the harmonic measure these parameters can be found from Traffic Equations. Then Mairesse and Math ́eus in [20] continued investigation of these random walks and the associated Traffic Equations. They introduced the Stationary Traffic Equations for the situation when the measure is shift-invariant in addition to being μ-invariant. In this thesis, we review these developments as well as explicitly describe several concrete examples of random walks on free products, some of which are new.
19
Ryba, Christopher(Christopher Jonathan). « Stable characters for symmetric groups and wreath products ». Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/126936.
Texte intégralRésumé :
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, May, 2020Cataloged from the official PDF of thesis.
Includes bibliographical references (pages 145-147).
Given a Hopf algebra R, the Grothendieck group of C = R-mod inherits the structure of a ring. We define a ring [mathematical equation]), which is "the [mathematical equation] limit" of the Grothendieck rings of modules for the wreath products [mathematical equation]; it is the Grothendieck group of a certain wreath product Deligne category. The construction yields a basis of [mathematical equation] corresponding to irreducible objects. The structure constants of this basis are stable tensor product multiplicities for the wreath products [mathematical equation]. We generalise [mathematical equation], allowing an arbitrary ring to be substituted for the Grothendieck ring of C. Aside from being a Hopf algebra, [mathematical equation] is the algebra of distributions on a certain affine group scheme. In the special case where C is the category of vector spaces (over C, say), [mathematical equation] is the ring of symmetric functions. The basis obtained by our construction is the family of stable Specht polynomials, which is closely related to the problem of calculating restriction multiplicities from [mathematical equation]. We categorify the stable Specht polynomials by producing a resolution of irreducible representations of S[subscript n] by modules restricted from [mathematical equation].
by Christopher Ryba.
Ph. D.
Ph.D. Massachusetts Institute of Technology, Department of Mathematics
20
Johnson, Rebecca. « Convergence of Infinite Products in Groups and Semigroups ». OpenSIUC, 2013. https://opensiuc.lib.siu.edu/theses/1115.
Texte intégralRésumé :
This thesis examines convergence infinite products in groups and semigroups. Chapter One formulates the underlying semigroup theory needed for the rest of the thesis. In Chapter Two, results concerning convergence of infinite products are proven. Finally, the thesis culminates with computer simulations of products on semigroups, and a conjecture concerning weak ergodicity in hon-homogeneous Markov chains is generated.
21
Jasim, We'am Muhammad. « Algebraically Determined Semidirect Products ». Thesis, University of North Texas, 2011. https://digital.library.unt.edu/ark:/67531/metadc67993/.
Texte intégralRésumé :
Let G be a Polish group. We say that G is an algebraically determined Polish group if given any Polish group L and any algebraic isomorphism from L to G, then the algebraic isomorphism is a topological isomorphism. We will prove a general theorem that gives useful sufficient conditions for a semidirect product of two Polish groups to be algebraically determined. This will smooth the way for the proofs for some special groups. For example, let H be a separable Hilbert space and let G be a subset of the unitary group U(H) acting transitively on the unit sphere. Assume that -I in G and G is a Polish topological group in some topology such that H x G to H, (x,U) to U(x) is continuous, then H x G is a Polish topological group. Hence H x G is an algebraically determined Polish group. In addition, we apply the above the above result on the unitary group U(A) of a separable irreducible C*-algebra A with identity acting transitively on the unit sphere in a separable Hilbert space H and proved that the natural semidirect product H x U(A) is an algebraically determined Polish group. A similar theorem is true for the natural semidirect product R^{n} x G(n), where G(n) = GL(n,R), or GL^{+}(n,R), or SL(n,R), or |SL(n,R)|={A in GL(n,R) : |det(A)|=1}. On the other hand, it is known that the Heisenberg group H_{3}(R) , (R, +), (R{0}, x), and GL^{+}(n,R) are not algebraically determined Polish groups.
22
Bowes, David. « Weyl quantization, reduction, and star products ». Thesis, University of Oxford, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358585.
Texte intégral
23
Dison, William John. « Isoperimetric functions for subdirect products and Bestvina-Brady groups ». Thesis, Imperial College London, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.485425.
Texte intégralRésumé :
In this thesis we investigate the Oehn functions of two different classes of groups: subdirect products, in particular subdirect products of limit groups; and Bestvina-Brady groups. Let $0 =\Gamma_1 \times \Idots \times \Gamma_n$ be a direct product of $n \geq 3$ finitely presented groups and let $H$ be a subgroup of $0$. Suppose that each $\Gamma_i$ contains a finite index subgroup $\Gamma_i' \Ieq \Gamma_i$:'such that the commutator subgroup $[0', 0']$ of $0' = \Gamma_1' \times \Idots \times \Gamma_n'$ is contained in $H$. Suppose furthermore that, for each $i$, the subgroup $\Gamma_i H$ has finite index in $0$. We prove that $H$ is finitely presented and satisfies an isoperimetric inequality given in terms of area-radius pairs for the $\Gamma_i$ and the dimension of $(O'/H) \otimes \Q$. In the case that each $\Gamma_i$ admits a polynomial-polynomial area-radius pair, it will follow that $H$ satisfies a polynomial isoperimetric inequality. As a corollary we obtain that if $K$ is a subgroup of a direct product of $n$ limit groups and if $K$ is of type $\textrm{FPL{m}(\Q)$, where $m = \max \{ 2, n-1\}$, then $K$ is finitely presented and .satisfies a polynomial isoperimetric inequality. In particular, we obtain that all finitely presented subgroups of a direct product of at most $3$ limit groups satisfy a polynomial isoperimetric inequality. We also prove that if $B$ is a finitely presented Bestvina-Brady group, then $B$ admits a quartic isoperimetric function.
24
Wreth, Susanna. « Hyperbolicity of one-relator products and equations over groups ». Thesis, Heriot-Watt University, 1995. http://hdl.handle.net/10399/771.
Texte intégral
25
Brinkman, John. « Products of involutions in certain families of finite groups ». Thesis, University of Liverpool, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359154.
Texte intégral
26
Demir, Erdem. « Dimensions Of User Satisfaction For Different Product Groups ». Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606099/index.pdf.
Texte intégralRésumé :
User satisfaction information provides a supporting base for the industrial design processes. Satisfaction is measured via several methods in the industrial design practice. These measurements are not only helpful to direct the design, i.e. formative purposes, but they are also very beneficial to validate the final output of the design process, i.e. summative purposes. Due to its prominent role for shaping and validating the design, it is essential to define and measure satisfaction with household consumer products properly. However, the literature lacks a clear definition of the concept in the context of household consumer products. This remains to be the main obstacle on the way to propose sensitive measurement techniques.
This study mainly aims to clarify user satisfaction with consumer products by identifying its product-related dimensions. Firstly, the psychological background of satisfaction and the models of consumer satisfaction are reviewed to explain the processes underlying satisfaction response. Afterwards, the focus is shifted to the product design and ergonomics domains to come up with the aspects of products that influence user satisfaction. The literature survey provided product-related dimensions such as functionality, usability, product aesthetics, and emotional aspects of the interaction.
The main hypothesis of the study is that the importance of these dimensions for the overall satisfaction response varies in different product groups. In the field study that is conducted in order to question the validity of this hypothesis, the importance of different product related dimensions for user satisfaction in ten different product groups is investigated via semi-structured interviews. The study revealed different prevailing dimensions for different product groups.
27
Bieniecka, Ewa. « Commutativity and free products in Thompson's Group V ». Thesis, University of St Andrews, 2018. http://hdl.handle.net/10023/14652.
Texte intégralRésumé :
We broaden the theory of dynamical interpretation, investigate the property of commutativity and explore the subject of subgroups forming free products in Thompson's group V. We expand Brin's terminology for a revealing pair to an any tree pair. We use it to analyse the dynamical behaviour of an arbitrary tree pair which cannot occur in a revealing pair. Hence, we design a series of algorithms generating Brin's revealing pair from any tree pair, by successively eliminating the undesirable structures. To detect patterns and transitioning between tree pairs, we introduce a new combinatorial object called the chains graph. A newly defined, unique and symmetrical type of a tree pair, called a balanced tree pair, stems from the use of the chains graphs. The main theorem of Bleak et al. in "Centralizers in the R. Thompson's Group V_n" states the necessary structure of the centraliser of an element of V. We provide a converse to this theorem, by proving that each of the predicted structures is realisable. Hence we obtain a complete classification of centralisers in V. We give an explicit construction of an element of V with prescribed centraliser. The underlying concept is to embed a Cayley graph of a finite group into the flow graph (introduced in Bleak et al.) of the desired element. To reflect the symmetry, we present the resulting element in terms of a balanced tree pair. The group V is conjectured to be a universal coCF group, which generates interest in studying its subgroups. We develop a better understanding of embeddings into V by providing a necessary and sufficient dynamical condition for two subgroups (not both torsion) to form a free product in V. For this, we use the properties, explored in Bleak and Salazar-Díaz "Free Products in Thompson's Group V", of sets of so--called important points, and the Ping-Pong action induced on them.
28
Stykow, Maxim. « Representation rings of semidirect products of tori by finite groups ». Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/54513.
Texte intégralRésumé :
This dissertation studies semidirect products of a torus by a finite group from the representation theory point of view. The finite group of greatest interest is the cyclic group of prime order. Such semidirect products occur in nature as isotropy groups of Lie groups acting on themselves by conjugation and as normalizers of maximal tori in reductive linear algebraic groups. The main results of this dissertation are: a) the calculation of the representation ring of such semidirect products as an algebra over the integers for certain special cases, b) the adaptation of an algorithm from invariant theory to find finite presentations of representation rings, c) the computation of the topological K-theory of the classifying space of certain semidirect products, d) the demonstration that the equivariant K-theory of the projective unitary group of degree 2 acting on itself by conjugation is not a free module over its representation ring.Science, Faculty of
Mathematics, Department of
Graduate
29
Ray, Urmie. « Free linear actions of finite groups on products of spheres ». Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.335735.
Texte intégral
30
Chinyere, Ihechukwu. « Certain one-relator products of groups : Freiheitssatz and non-triviality ». Thesis, Heriot-Watt University, 2015. http://hdl.handle.net/10399/3078.
Texte intégral
31
Kam, Siu-Man. « On the rank of the intersection of subgroups in free products of groups and in amalgamated products ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0018/NQ27299.pdf.
Texte intégral
32
Neofytidis, Christoforos. « Non-zero degree maps between manifolds and groups presentable by products ». Diss., Ludwig-Maximilians-Universität München, 2014. http://nbn-resolving.de/urn:nbn:de:bvb:19-172047.
Texte intégral
33
Inyangala, Edward Buhuru. « Categorical semi-direct products in varieties of groups with multiple operators ». Doctoral thesis, University of Cape Town, 2010. http://hdl.handle.net/11427/4890.
Texte intégralRésumé :
The notion of a categorical semidirect product was introduced by Bourn and Janelidze as a generalization of the classical semidirect product in the category of groups. The main aim of this work is to study the general properties of semidirect products of groups with operators, describe them in various classical varieties of such algebraic structures and apply the results to homological algebra and related areas of modern algebra. The context in which the study is done is a semiabelian category (that is, a pointed, Barr-exact and Bourn-protomodular category). The main result in the thesis is the construction of the semidirect product in a variety -RLoop of right -loops as the product of underlying sets equipped with the -algebra structure. A variety of right -loops is a variety that is pointed, has a binary + (not necessarily associative or commutative) and a binary satisfying the identities 0 + x = x, x + 0 = x, (x + y) y = x and (x - y) + y = x. Thus, -RLoop is a generalization of the variety of -groups introduced by Higgins and the results obtained are valid for varieties of -loops. We also describe precrossed and crossed modules in the variety -RLoop. The theory of crossed modules developed is independent of that developed by Janelidze for crossed modules in an arbitrary semiabelian category and gives simplified explicit formulae for crossed modules in -RLoop. Finally, we mention that our constructions agree with the known ones in the familiar algebraic categories, specifically the categories of groups, rings and Lie algebras.
34
Yang, Mingze. « Crossed products by finite groups acting on low dimensional complexes and applications ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq23894.pdf.
Texte intégral
35
Austin, Peter C. « Products of involutions in the Chevalley groups of type F(4)(K) ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ27872.pdf.
Texte intégral
36
Kazachkov, Ilya. « Description of solutions of systems of equations over free products of groups ». Thesis, McGill University, 2009. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66911.
Texte intégralRésumé :
Using an analogue of Makanin-Razborov diagrams, we give a description of the solution set of systems of equations over an equationally Noetherian free product of groups $G$. Equivalently, we give a parametrisation of the set $\Hom(H, G)$ of all homomorphisms from a finitely generated group $H$ to $G$. Furthermore, we show that every algebraic set over $G$ can be decomposed as a union of finitely many images of algebraic sets of NTQ systems. If the universal Horn theory of $G$ (the theory of quasi-identities) is decidable, then our constructions are effective.Utilisant un analogue des diagrammes de Makanin-Razborov, nous donnons une description de l'ensemble des solutions de systémes d'équations dans un produit libre équationallement Noetherien $G$. De maniére équivalente, nous donnons une paramétrisation de l'ensemble $\Hom(H,G)$ des homomorphismes d'un groupe de génération finie $H$à $G$.Si la théorie universelle de Horn de $G$ est décidable, nos constructions sont algorithmique.
37
Cernes, John. « Ends of permutation groups and some centrality properties of permutational wreath products ». Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339282.
Texte intégral
38
Chifman, Julia. « DIRECT PRODUCTS AND THE INTERSECTION MAP OF CERTAIN CLASSES OF FINITE GROUPS ». UKnowledge, 2009. http://uknowledge.uky.edu/gradschool_diss/839.
Texte intégralRésumé :
The main goal of this work is to examine classes of finite groups in which normality, permutability and Sylow-permutability are transitive relations. These classes of groups are called T , PT and PST , respectively. The main focus is on direct products of T , PT and PST groups and the behavior of a collection of cyclic normal, permutable and Sylow-permutable subgroups under the intersection map. In general, a direct product of finitely many groups from one of these classes does not belong to the same class, unless the orders of the direct factors are relatively prime. Examples suggest that for solvable groups it is not required to have relatively prime orders to stay in the class. In addition, the concept of normal, permutable and S-permutable cyclic sensitivity is tied with that of Tc, PTc and PSTc groups, in which cyclic subnormal subgroups are normal, permutable or Sylow-permutable. In the process another way of looking at the Dedekind, Iwasawa and nilpotent groups is provided as well as possible interplay between direct products and the intersection map is observed.
39
Martino, Armando. « On automorphisms of free groups and free products and their fixed points ». Thesis, Queen Mary, University of London, 1998. http://qmro.qmul.ac.uk/xmlui/handle/123456789/25565.
Texte intégralRésumé :
Free group outer automorphisms were shown by Bestvina and Randell to have fixed subgroups whose rank is bounded in terms of the rank of the underlying group. We consider the case where this upper bound is achieved and obtain combinatorial results about such outer automorphisms thus extending the work of Collins and Turner. We go on to show that such automorphisms can be represented by certain graph of group isomorphisms called Dehn Twists and also solve the conjuagacy problem in a restricted case, thus reproducing the work of Cohen and Lustig, but with different methods. We rely heavily on the relative train tracks of Bestvina and Randell and in fact go on to use an analogue of these for free product automorphisms developed by Collins and Turner. We prove an index theorem for such automorphisms which counts not only the group elements which are fixed but also the points which are fixed at infinity - the infinite reduced words. Two applications of this theorem are considered, first to irreducible free group automorphisms and then to the action of an automorphism on the boundary of a hyperbolic group. We reduce the problem of counting the number of points fixed on the. boundary to the case where the hyperbolic group is indecomposable and provide an easy application to virtually free groups.
40
Gibbins, Aliska L. « Automorphism Groups of Buildings Constructed Via Covering Spaces ». The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1373976456.
Texte intégral
41
Gonda, Jessica Lynn. « Subgroups of Finite Wreath Product Groups for p=3 ». University of Akron / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=akron1460027790.
Texte intégral
42
Wharton, Elizabeth. « The model theory of certain infinite soluble groups ». Thesis, University of Oxford, 2006. http://ora.ox.ac.uk/objects/uuid:7bd8d05b-4ff6-4326-8463-f896e2862e25.
Texte intégralRésumé :
This thesis is concerned with aspects of the model theory of infinite soluble groups. The results proved lie on the border between group theory and model theory: the questions asked are of a model-theoretic nature but the techniques used are mainly group-theoretic in character. We present a characterization of those groups contained in the universal closure of a restricted wreath product U wr G, where U is an abelian group of zero or finite square-free exponent and G is a torsion-free soluble group with a bound on the class of its nilpotent subgroups. For certain choices of G we are able to use this characterization to prove further results about these groups; in particular, results related to the decidability of their universal theories. The latter part of this work consists of a number of independent but related topics. We show that if G is a finitely generated abelian-by-metanilpotent group and H is elementarily equivalent to G then the subgroups gamma_n(G) and gamma_n(H) are elementarily equivalent, as are the quotient groups G/gamma_n(G) and G/gamma_n(H). We go on to consider those groups universally equivalent to F_2(VN_c), where the free groups of the variety V are residually finite p-groups for infinitely many primes p, distinguishing between the cases when c = 1 and when c > 2. Finally, we address some important questions concerning the theories of free groups in product varieties V_k · · ·V_1, where V_i is a nilpotent variety whose free groups are torsion-free; in particular we address questions about the decidability of the elementary and universal theories of such groups. Results mentioned in both of the previous two paragraphs have applications here.
43
Wagner, Jennifer D. « The combinatories of the permutation enumeration of wreath products between cyclic and symmetric groups / ». Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2000. http://wwwlib.umi.com/cr/ucsd/fullcit?p9974108.
Texte intégral
44
Haubold, Niko. « Compressed Decision Problems in Groups ». Doctoral thesis, Universitätsbibliothek Leipzig, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-85413.
Texte intégralRésumé :
Wir beschäftigen uns mit Problemen der algorithmischen Gruppentheorie und untersuchen dabei die Komplexität von komprimierten Versionen des Wortproblems und des Konjugationsproblems für endlich erzeugte Gruppen.
Das Wortproblem fragt für eine feste, endlich erzeugte Gruppe ob ein gegebenes Wort über der Erzeugermenge das neutrale Element der Gruppe repräsentiert. Wir betrachten das gegebene Wort jedoch in einer komprimierten Form, als Straight-line Program (SLP) und untersuchen die Komplexität dieses Problems, das wir \'komprimiertes Wortproblem\' nennen. SLPs sind kontextfreie Grammatiken, die genau einen String erzeugen. Die Eingabegröße ist dabei stets die Größe des gegebenen SLPs. Eine Hauptmotivation ist dabei, dass für eine feste endlich erzeugte Gruppe das Wortproblem ihrer Automorphismengruppe durch eine Turingmaschine in Polynomialzeit auf das komprimierte Wortproblem der Gruppe selbst reduzierbar ist.
Wir untersuchen das komprimierte Wortproblem für die verbreiteten Gruppenerweiterungen HNN-Erweiterungen (amalgamierte Produkte und Graphprodukte) und können zeigen, dass sich Instanzen des komprimierten Wortproblems von einer Turingmaschine in Polynomialzeit auf Instanzen des komprimierten Wortproblems der Basisgruppe (respektive Basisgruppen und Knotengruppen) reduzieren lassen. Weiterhin zeigen wir, dass das komprimierte Wortproblem für endlich erzeugte nilpotente Gruppen von einer Turingmaschine in Polynomialzeit entscheidbar ist.
Wir betrachten außerdem eine komprimierte Variante des Konjugationsproblems. Das unkomprimierte Konjugationsproblem fragt für zwei gegebene Wörter über den Erzeugern einer festen endlich erzeugten Gruppe, ob sie in dieser Gruppe konjugiert sind. Beim komprimierten Konjugationsproblem besteht die Eingabe aus zwei SLPs und es wird gefragt, ob die beiden Wörter die von den SLPs erzeugt werden in der Gruppe konjugierte Elemente präsentieren. Wir konnten zeigen, dass sich das komprimierte Konjugationsproblem für Graphgruppen in Polynomialzeit entscheiden lässt.
Weiterhin haben wir das Wortproblem der äußeren Automorphismengruppen von Graphprodukten endlich erzeugter Gruppen untersucht. Durch den engen Zusammenhang des komprimierten Konjugationsproblems einer Gruppe mit dem Wortproblem der äußeren Automorphismengruppe konnten wir zeigen, dass sich das Wortproblem der äußeren Automorphismengruppe eines Graphprodukts von endlich erzeugten Gruppen durch eine Turingmaschine in Polynomialzeit auf Instanzen von simultanen komprimierten Konjugationsproblemen der Knotengruppen und Instanzen von komprimierten Wortproblemen der Knotengruppen reduzieren lässt.
Als Anwendung gelten obige Resultate auch für right-angled Coxetergruppen und Graphgruppen, da beide spezielle Graphprodukte sind. So folgt beispielsweise, dass das komprimierte Wortproblem einer right-angled Coxetergruppe in Polynomialzeit entscheidbar ist.
45
Karrer, Annette [Verfasser], et P. [Akademischer Betreuer] Schwer. « Contracting boundaries of amalgamated free products of CAT(0) groups with applications for right-angled Coxeter groups / Annette Karrer ; Betreuer : P. Schwer ». Karlsruhe : KIT-Bibliothek, 2021. http://d-nb.info/1227450982/34.
Texte intégral
46
Neofytidis, Christoforos [Verfasser], et Dieter [Akademischer Betreuer] Kotschick. « Non-zero degree maps between manifolds and groups presentable by products / Christoforos Neofytidis. Betreuer : Dieter Kotschick ». München : Universitätsbibliothek der Ludwig-Maximilians-Universität, 2014. http://d-nb.info/1054599114/34.
Texte intégral
47
Korogodski, Leonid I. « Representation of quantum algebras arising from non-compact quantum groups : quantum orbit method and super-tensor products ». Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/39076.
Texte intégral
48
Mujumdar, Prashant. « Synthesis and Biological Evaluation of Unusual Natural Products and Novel Heterocyclic Chemotypes as Carbonic Anhydrase Inhibitors ». Thesis, Griffith University, 2017. http://hdl.handle.net/10072/366972.
Texte intégralRésumé :
Carbonic anhydrases (CAs) are zinc metalloenzymes that catalyze the reversible hydration of carbon dioxide to bicarbonate and a proton. The zinc cation in the active site of these metalloenzymes is the suggested target for small molecule inhibitors to block the endogenous CA catalysed reaction. Almost all reported CA inhibitors consist of zinc binding group (ZBG) among which the, primary sulfonamide group (-SO2NH2) is the most prominent example. Primary sulfamate (-OSO2NH2) and primary sulfamide (-NH-SO2NH2) groups also serve as zinc binding groups in CA inhibitors, however they are less represented than the primary sulfonamide group. Natural products (NPs) have proven an invaluable source of compounds for drug discovery. NPs containing primary sulfonamide (-SO2NH2) and primary sulfamate (-OSO2NH2) group are rare, while there are no NP primary sulfamides. A literature search of the Dictionary of Natural Products (DNP) database revealed only two primary sulfonamide and five primary sulfamate compounds. This project will focus on the tractable synthesis of these rare natural products, biological evaluation against CA and protein X-ray crystal structures in complex with medicinally important isozymes of CA.Thesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Natural Sciences
Science, Environment, Engineering and Technology
Full Text
49
Dombray, Thomas. « Catalyse par les métaux de la monnaie : applications à la synthèse de molécules d'intérêt biologique ». Thesis, Strasbourg, 2012. http://www.theses.fr/2012STRAF060.
Texte intégralRésumé :
Au cours de la dernière décennie, l’utilisation de la catalyse à l’or a connu un essor important en synthèse organique. Les complexes d’or permettent de générer des molécules complexes hautement fonctionnalisées à partir de substrats simples de manière efficace et dans des conditions réactionnelles douces. Les propriétés de cet élément découlent des effets relativistes et confèrent aux complexes d’or un caractère à la fois carbophile et oxophile. Cette dualité a été exploitée au laboratoire à travers de nombreuses réactions, notamment des réarrangements d’alcynyloxiranes en furanes ou en divinylcétones.En approfondissant ces travaux, une nouvelle méthode de synthèse d’alpha-pyrones 6 et 3,6-disubstituées à partir de beta-lactones acétyléniques a pu être développé grâce à la catalyse à l’or. Ce motif alpha-pyrone est particulièrement intéressant car il est présent dans de nombreux produits naturels dont certains ont montré une activité biologique intéressante.Toujours en exploitant la dualité des complexes d’or, nous avons tenté de générer des motifs observés dans des substances naturelles, notamment des spironolactones ou des acétals spiranniques, en variant la nature du substrat et des nucléophiles internes. Malgré plusieurs échecs, nous avons bon espoir de développer une méthode de préparation de spironolactones catalysée par l’or. Au cours de ces travaux, nous avons découvert une nouvelle méthode de déprotection des éthers de p-méthoxybenzyle, un groupement protecteur d’alcool communément utilisé en synthèse organique. Des conditions réactionnelles employant une quantité catalytique d’argent, compatible avec de nombreux groupes fonctionnels a ainsi pu être développéDuring the last decade, gold catalysis has experienced significant growth in organic synthesis. Gold–catalyzed reactions can generate highly functionalized, complex molecules from simple substrates efficiently and under mild conditions. The properties of this element, arising from relativistic effects, provide to gold complexes both carbophilic and oxophilic character. This duality has been largely exploited in the laboratory in the rearrangements of alcynyloxiranes to furan or divinylcétones.By expanding this work, a new method for the synthesis of 6 and 3,6-disubstituted alpha-pyrones from beta-alcynylpropiolactones catalyzed by gold has been developed. This alpha-pyrone motif is particularly interesting as it can be found in many natural products, some of which have shown interesting biological activity. Still exploiting the duality of gold complexes, we attempted to generate motifs observed in natural substances, namely spironolactones or spirannic acetals, by modifying the substrate and internal nucleophiles. Despite several failures, we hope to develop a gold catalyzed reaction for the preparation of spironolactones. During this work, we have found a novel method for the p-methoxybenzyl ether cleavage, a protecting group of alcohol commonly used in organic synthesis. The reaction conditions using a catalytic amount of silver, compatible with many functional groups has thus been developed
50
Mehmood, Yasir. « Modeling the roles of individuals and groups in the dynamics of information propagation ». Doctoral thesis, Universitat Pompeu Fabra, 2016. http://hdl.handle.net/10803/393728.
Texte intégralRésumé :
This thesis studies the roles of individuals and groups in the propagation of information
in social networks. The primary aim is to investigate how users and groups
impact information propagation and vice versa. In order to study these complex and
intricate phenomena, we apply tools and techniques from both machine learning and
data mining. Our research results in interesting developments while pursuing our
goals. First, we propose a novel modeling framework that we call as the communitylevel
social in
uence analysis (CSI). CSI enables estimating in
uence probabilities
at a macro-level, between user groups, while extending and generalizing the existing
prediction frameworks that only work at the level of users. Next, we propose a
stochastic model, called MASD, to capture the evolving patterns of the adoption of
innovations. While inspired by the theory of di usion of innovations, MASD uses
left-right HMMs to model the underlying phenomena we aim to study. The simplicity
as well as the robustness of this model has allowed us to build a variety of
applications, from clustering items to analyzing propagation patterns, and above all,
the prediction of future adoptions. Lastly, we propose a creative algorithmic problem
where our aim is to obtain the sphere of in
uence of a node. Working with probabilistic
graphs, we de ne this sphere, corresponding to a node, as a group of nodes
that potentially catch a contagion if the underlying node is infected. Computing the
sphere of in
uence for all the nodes and combining it with an instance of set-cover
greedy algorithm, we propose a unique approach to in
uence maximization (Inf-
Max). Through exhaustive experimentations we show that our method consistently
outperforms the standard greedy algorithm for InfMax.Esta tesis estudia los roles que, tanto individuos como grupos de individuos, desempeñan en la propagación de información en redes sociales. El objetivo primario es investigar el impacto de usuarios y grupos de usuarios en la propagación de información y viceversa. Para estudiar estos fenómenos, de gran complejidad, aplicamos herramientas y técnicas de aprendizaje máquina y minería de datos. Nuestra investigación ha dado como resultado desarrollos muy interesantes que satisfacen nuestros objetivos. En primer lugar, se propone una plataforma innovadora de modelización que denominamos Análisis de la Influencia Social a nivel de Comunidad (Community-level Social Influence Analysis - CSI). CSI permite estimar probabilidades de influencia en un macro-nivel, entre grupos de usuario, al mismo tiempo que extiende y generaliza las plataformas de predicción existentes que sólo trabajan a nivel de usuario. En segundo lugar, se ha desarrollado un modelo estocástico, llamado MASD, para capturar los patrones de evolución de la adopción de innovaciones. Inspirado en la teoria de difusión de innovaciones, MASD utiliza el modelo HMMs izquieda-derecha para representar los fenómenos subyacentes objeto de estudio. La simplicidad, así como la robustez de este modelo, nos han permitido construir una variedad de aplicaciones, desde elementos de clasificación hasta patrones de propagación, y sobre todo, la predicción de adopciones futuras. Finalmente, proponemos un problema algorítmico creativo donde nuestro objetivo es obtener la esfera de influencia de un nodo. Trabajando con grafos probabilísticos, definimos esta esfera, correspondiente a un nodo, como un grupo de nodos que potencialmente capturan un contagio si el nodo subyacente está infectado. Calculando la esfera de influencia para todos los nodos y combinándola con una instancia de un algoritmo goloso de cobertura, proponemos una aproximación única para influenciar la maximización (InfMax). A través de experimentos exhaustivas, podemos mostrar como nuestro método mejora consistentemente el algoritmo goloso estándar para InfMax.
Aquesta tesi estudia els rols que, tant individus com a grups d'individus, exerceixen en la propagació d'informació en xarxes socials. L'objectiu primari és investigar l'impacte d'usuaris i grups d'usuaris en la propagació d'informació i viceversa. Per estudiar aquests fenómens, de gran complexitat, apliquem eines i técniques d'aprenentatge màquina i mineria de dades. La nostra investigació ha donat com resultat desenvolupaments molt interessants que satisfan els nostres objectius. En primer lloc, es proposa una plataforma innovadora de modelització que denominem Anàlisi de la Inuflència Social a nivell de Comunitat (Community-level Social Influence Analysis - CSI). CSI permet estimar probabilitats d'influència en un macronivell, entre grups d'usuari, al mateix temps que estén i generalitza les plataformes de predicció existents que només treballen a nivell d'usuari. En segon lloc, s'ha desenvolupat un model estocàstic, anomenat MASD, per capturar els patrons d'evolució de l'adopció d'innovacions. Inspirat en la teoria de difusió d'innovacions, MASD utilitza el model HMMs izquierda-dreta per representar els fenómens subjacents objecte d'estudi. La simplicitat, així com la robustesa d'aquest model, ens han permés construir una varietat d'aplicacions, des d'elements de classificació fins a patrons de propagació, i sobretot, la predicció d'adopcions futures. Finalment, proposem un problema algorítmic creatiu on el nostre objectiu és obtenir l'esfera d'influència d'un node. Treballant amb gràfics probabilístics, definim aquesta esfera, corresponent a un node, com un grup de nodes que potencialment capturen un contagi si el node subjacent està infectat. Computant l'esfera d'influència per a tots els nodes i combinant-la amb una instància d'un algorisme voraç de cobertura, proposem una aproximació única per influenciar la maximització (InfMax). A través d'experimentacions exhaustives, podem mostrar com el nostre mètode millora consistentment l'algorisme voraç estàndard per InfMax.