Literatura académica sobre el tema "Statistiques combinatoires"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Statistiques combinatoires".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Statistiques combinatoires"
Rossari, Corinne, Cyrielle Montrichard y Claudia Ricci. "Pour une approche sémantique des connecteurs au-delà de leurs propriétés relationnelles : étude sur des variations génériques et diachroniques dans des corpus écrits". SHS Web of Conferences 138 (2022): 11016. http://dx.doi.org/10.1051/shsconf/202213811016.
Texto completoBuhnila, Ioana, Georgeta Cislaru y Amalia Todirascu. "Analyse qualitative et quantitative des « hallucinations » générées automatiquement dans un corpus de reformulations médicales". SHS Web of Conferences 191 (2024): 11001. http://dx.doi.org/10.1051/shsconf/202419111001.
Texto completoLerman, Israël-César. "Analyse logique, combinatoire et statistique de la construction d’une hiérarchie binaire implicative ; niveaux et nœuds significatifs",. Mathématiques et sciences humaines, n.º 184 (31 de diciembre de 2008): 47–103. http://dx.doi.org/10.4000/msh.10974.
Texto completoMongelli, Pietro. "Kazhdan-Lusztig polynomials of boolean elements". Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AS,..., Proceedings (1 de enero de 2013). http://dx.doi.org/10.46298/dmtcs.2326.
Texto completoChapoton, Frédéric, Gregory Chatel y Viviane Pons. "Two bijections on Tamari Intervals". Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AT,..., Proceedings (1 de enero de 2014). http://dx.doi.org/10.46298/dmtcs.2396.
Texto completoDalal, Avinash J. y Jennifer Morse. "A $t$-generalization for Schubert Representatives of the Affine Grassmannian". Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AS,..., Proceedings (1 de enero de 2013). http://dx.doi.org/10.46298/dmtcs.2371.
Texto completoRemmel, Jeffrey y Mark Tiefenbruck. "Extending from bijections between marked occurrences of patterns to all occurrences of patterns". Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AR,..., Proceedings (1 de enero de 2012). http://dx.doi.org/10.46298/dmtcs.3098.
Texto completoArmstrong, Drew. "Hyperplane Arrangements and Diagonal Harmonics". Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AO,..., Proceedings (1 de enero de 2011). http://dx.doi.org/10.46298/dmtcs.2889.
Texto completoCai, Yue y Margaret Readdy. "Negative $q$-Stirling numbers". Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings, 27th..., Proceedings (1 de enero de 2015). http://dx.doi.org/10.46298/dmtcs.2503.
Texto completoYen, Lily. "Arc-Coloured Permutations". Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AS,..., Proceedings (1 de enero de 2013). http://dx.doi.org/10.46298/dmtcs.2339.
Texto completoTesis sobre el tema "Statistiques combinatoires"
Kasraoui, Anisse. "Études combinatoires sur les permutations et partitions d'ensemble". Phd thesis, Université Claude Bernard - Lyon I, 2009. http://tel.archives-ouvertes.fr/tel-00393631.
Texto completoManouvrier, Jean-François. "Méthode de décomposition pour résoudre des problèmes combinatoires sur les graphes". Compiègne, 1998. http://www.theses.fr/1998COMP1152.
Texto completoBriend, Simon. "Inference of the past of random structures and other random problems". Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASM013.
Texto completoThis thesis is decomposed in three disjoint parts. The first two parts delve into dynamically growing networks. In the first part, we infer information about the past from a snapshot of the graph. We start by the problem of root finding, where the goal is to find confidence set for the root. We propose a method for uniform L-dags and analyse its performance. It is, to the best of our knowledge, the first method achieving network archaeology in general graphs. Then, we naturally extend the question of root finding to the one of seriation. Given a snapshot of a graph, is it possible to retrieve its whole ordering? We present a method and statistical guarantee of its quality in the case of uniform random recursive trees and linear preferential attachment tree. To conclude the network archaeology section, we study the root bit finding problem, where one does not try to infer the position of the root but its state. In such problems, the root is assigned a bit and is then propagated through a noisy channel during network growth. In the L-dag, we study majority voting to infer the bit of the root and we identify three different regimes depending on the noise level. In the second part of this thesis, we study the so called friendship tree, which is a random recursive tree model with complete redirection. This model display emerging properties, but unlike in the preferential attachment model they stem from a local attachment rule. We prove conjectures about degree distribution, diameter and local structure. Finally, we delve into the world of theoretical machine learning and data analysis. We study a random approximation of the Tukey depth. The Tukey depth is a powerful tool for data visualization and can be thought of as an extension of quantiles in higher dimension (they coincide in dimension 1). Its exact computation is NP-hard, and we study the performances of a classical random approximation in the case of data sets sampled from log-concave distribution
Gouraud, Sandrine-Dominique. "Utilisation des Structures Combinatoires pour le Test Statistique". Phd thesis, Université Paris Sud - Paris XI, 2004. http://tel.archives-ouvertes.fr/tel-00011191.
Texto completologiciel à partir d'une description graphique des comportements du
système à tester (graphe de contrôle, statecharts). Son originalité
repose sur la combinaison de résultats et d'outils de combinatoire
(génération aléatoire de structures combinatoires) et d'un solveur de
contraintes, pour obtenir une méthode de test complètement automatisée.
Contrairement aux approches classiques qui tirent des entrées, la
génération aléatoire uniforme est utilisée pour tirer des chemins parmi
un ensemble de chemins d'exécution ou de traces du système à tester.
Puis, une étape de résolution de contraintes est utilisée pour
déterminer les entrées qui permettront d'exécuter ces chemins.
De plus, nous montrons comment les techniques de programmation
linéaire peuvent améliorer la qualité d'un ensemble de tests.
Une première application a été effectuée pour le test statistique
structurel défini par Thévenod-Fosse et Waeselynck (LAAS) et un
prototype a été développé.
Des expériences (plus de 10000 réalisées sur quatre fonctions issues
d'un logiciel industriel) ont été effectuées pour évaluer notre approche
et sa stabilité.
Ces expériences montrent que notre approche est comparable à celle
du LAAS, est stable et a l'avantage d'être complètement automatisée.
Ces premières expériences nous permettent également d'envisager un
passage à l'échelle de notre approche. Plus généralement, ces travaux
pourraient servir de base pour une nouvelle classe d'outils dans le
domaine du test de logiciel, combinant génération aléatoire de
structures combinatoires, techniques de programmation linéaire et
résolution de contraintes.
Oudinet, Johan. "Approches combinatoires pour le test statistique à grande échelle". Paris 11, 2010. http://www.theses.fr/2010PA112347.
Texto completoThis thesis focuses on the development of combinatorial methods for testing and formal verification. Particularly on probabilistic approaches because exhaustive verification is often not tractable for complex systems. For model-based testing, I guide the random exploration of the model to ensure a satisfaction with desired probability of the expected coverage criterion, regardless of the underlying topology of the explored model. Regarding model-checking, I show how to generate a random number of finite paths to check if a property is satisfied with a certain probability. In the first part, I compare different algorithms for generating uniformly at random paths in an automaton. Then I propose a new algorithm that offers a good compromise with a sub-linear space complexity in the path length and a almost-linear time complexity. This algorithm allows the exploration of large models (tens of millions of states) by generating long paths (hundreds of thousands of transitions). In a second part, I present a way to combine partial order reduction and on-the-fly generation techniques to explore concurrent systems without constructing the global model, but relying on models of the components only. Finally, I show how to bias the previous algorithms to satisfy other coverage criteria. When a criterion is not based on paths, but on a set of states or transitions, we use a mixed solution to ensure both various ways of exploring those states or transitions and the criterion satisfaction with a desired probability
Huynh, Cong Bang. "Une promenade aléatoire entre combinatoire et mécanique statistique". Thesis, Université Grenoble Alpes (ComUE), 2019. http://www.theses.fr/2019GREAM026/document.
Texto completoThis thesis is at the interface between combinatorics and probability,and contributes to the study of a few models stemming from statisticalmechanics: polymers, self-interacting random walks and random walks inrandom environment, random maps.bigskipThe first model that we investigate is a one-parameter family ofprobability measures on self-avoiding paths of infinite length on aregular lattice, constructed from biased random walks on the tree offinite self-avoiding paths. These measures, initially introduced byBeretti and Sokal, exist for every bias larger than the inverseconnectivity constant, and their limit at the critical bias would beaamong the natural definitions of the uniform self-avoiding walk ofinfinite length. The aim of our work, in collaboration with VincentBeffara, is to understand the link between this limit, if it indeedexists, and other random infinite paths such as Kesten's measure(which is the weak limit of uniformly random finite self-avoidingwalks in the half-plane) and critical Bernoulli percolationinterfaces; the model can be seen as an interpolation between thesetwo.In a second part, we consider random walks with random conductances ona tree, in the case when the law of the conductances has heavy tail.Our aim, in collabration with Andrea Collevecchio and Daniel Kious, isto show a phase transition in the tail parameter; we express thecritical point as an explicit function of the underlying tree.In parallel, we study excited random walks on trees and their phasetransitions: we extend a conjecture of Volkov's and generalize resultsby Basdevant and Singh.Finally, a third part in collaboration with Vincent Beffara andBenjamin Lévêque contributes to the study of random maps of highergenus: we show the existence of subsequential scaling limits foruniformly random simple triangulations of the torus, extending to thatsetup fromer results by Adario-Berri and Albenque (on simpletriangulations of the sphere) and by Bettinelli (on quadrangulationsof the torus). The question of uniqueness and universality of thelimit remain open, but we obtain partial results in that direction
Krauth, Werner. "Physique statistique des réseaux de neurones et de l'optimisation combinatoire". Phd thesis, Université Paris Sud - Paris XI, 1989. http://tel.archives-ouvertes.fr/tel-00011866.
Texto completoCabon, Bertrand. "Problèmes d'optimisation combinatoire : évaluation de méthodes de la physique statistique". Toulouse, ENSAE, 1996. http://www.theses.fr/1996ESAE0024.
Texto completoBouttier, Jérémie. "Physique statistique des surfaces aléatoires et combinatoire bijective des cartes planaires". Phd thesis, Université Pierre et Marie Curie - Paris VI, 2005. http://tel.archives-ouvertes.fr/tel-00010651.
Texto completoDasse-Hartaut, Sandrine. "Combinatoire des tableaux escalier". Paris 7, 2014. http://www.theses.fr/2014PA077070.
Texto completoA relatively new combinatorial structure, called staircase tableaux, was introduced in recent work of S. Corteel and L. Williams. Staircase tableaux are a generalisation of permutation tableaux and alternative tableaux. Their study gave a combinatorial formula for the moments of Askey-Wilson polynomials. Staircase tableaux are also related to the asymmetric exclusion process on a one-dimensional lattice with open boundaries (ASEP), an important and heavily studied particle model in statistical mechanics. The study of the generating function of the staircase tableau has given a combinatorial formula for the steady state probability of the ASEP. We use differents approaches to study the staircase tableaux : with a probabilistic approach, we prove the asymptotic normality of some parameters of the staircase tableaux ; with bijective combinatorics, we get the properties of some subsets of staircase tableaux, using for example tree-like tableaux or permutations. Finally, a Markov chain on a subset of staircase tableaux confirms intuitively the formula for the steady state probability without using the matrix ansatz
Libros sobre el tema "Statistiques combinatoires"
Maurice-Baumont, Catherine. Statistiques et probabilités en mathématiques: B.T.S. 1ère et 2ème années. Paris: Ellipses, 1990.
Buscar texto completoAmyotte, Luc. Méthodes quantitatives: Applications à la recherche en sciences humaines. Saint-Laurent, Québec: Éditions du Renouveau pédagogique, 1996.
Buscar texto completoAmyotte, Luc. Méthodes quantitatives: Applications à la recherche en sciences humaines. 3a ed. Saint-Laurent: ERPI, 2011.
Buscar texto completoAmyotte, Luc. Méthodes quantitatives: Applications à la recherche en sciences humaines. 2a ed. Saint-Laurent, Québec: Éditions du Renouveau pédagogique, 2002.
Buscar texto completoAmyotte, Luc. Méthodes quantitatives: Formation complémentaire. Saint-Laurent, Qué: Erpi, 1998.
Buscar texto completoOntario. Esquisse de cours 12e année: Sciences de l'activité physique pse4u cours préuniversitaire. Vanier, Ont: CFORP, 2002.
Buscar texto completoOntario. Esquisse de cours 12e année: Technologie de l'information en affaires btx4e cours préemploi. Vanier, Ont: CFORP, 2002.
Buscar texto completoOntario. Esquisse de cours 12e année: Études informatiques ics4m cours préuniversitaire. Vanier, Ont: CFORP, 2002.
Buscar texto completoOntario. Esquisse de cours 12e année: Mathématiques de la technologie au collège mct4c cours précollégial. Vanier, Ont: CFORP, 2002.
Buscar texto completoOntario. Esquisse de cours 12e année: Sciences snc4m cours préuniversitaire. Vanier, Ont: CFORP, 2002.
Buscar texto completoCapítulos de libros sobre el tema "Statistiques combinatoires"
KUZNETSOV, Igor y Nickolay KUZNETSOV. "Méthodes de simulation rapide en files d’attente pour la résolution de certains problèmes combinatoires de grande taille". En Théorie des files d’attente 1, 167–205. ISTE Group, 2021. http://dx.doi.org/10.51926/iste.9001.ch6.
Texto completo