Einloggen

Thematische Bibliographien / Combinatorial statistics / Zeitschriftenartikel

Zeitschriftenartikel zum Thema „Combinatorial statistics“

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Combinatorial statistics.

Autor: Grafiati

Veröffentlicht am 20. Juli 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Combinatorial statistics" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Gerards, A. M. H., und A. W. J. Kolen. „Polyhedral Combinatorics in Combinatorial Optimization“. Statistica Neerlandica 41, Nr. 1 (März 1987): 1–25. http://dx.doi.org/10.1111/j.1467-9574.1987.tb01168.x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Niven, R. K. „Combinatorial entropies and statistics“. European Physical Journal B 70, Nr. 1 (16.05.2009): 49–63. http://dx.doi.org/10.1140/epjb/e2009-00168-5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Hansen, J. C. „Order statistics for random combinatorial structures“. Advances in Applied Probability 24, Nr. 4 (Dezember 1992): 774. http://dx.doi.org/10.1017/s0001867800024836.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Denise, Alain, und Rodica Simion. „Two combinatorial statistics on Dyck paths“. Discrete Mathematics 137, Nr. 1-3 (Januar 1995): 155–76. http://dx.doi.org/10.1016/0012-365x(93)e0147-v.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Simion, Rodica. „Combinatorial statistics on non-crossing partitions“. Journal of Combinatorial Theory, Series A 66, Nr. 2 (Mai 1994): 270–301. http://dx.doi.org/10.1016/0097-3165(94)90066-3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Hansen, Jennie C. „Order statistics for decomposable combinatorial structures“. Random Structures & Algorithms 5, Nr. 4 (Oktober 1994): 517–33. http://dx.doi.org/10.1002/rsa.3240050404.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Calvin, James A., und Marshall Hall. „Combinatorial Theory.“ Journal of the American Statistical Association 82, Nr. 400 (Dezember 1987): 1197. http://dx.doi.org/10.2307/2289431.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Bernabei, Maria Simonetta, und Horst Thaler. „Central Limit Theorem for Coloured Hard Dimers“. Journal of Probability and Statistics 2010 (2010): 1–13. http://dx.doi.org/10.1155/2010/781681.

Der volle Inhalt der Quelle

Annotation:

We study the central limit theorem for a class of coloured graphs. This means that we investigate the limit behavior of certain random variables whose values are combinatorial parameters associated to these graphs. The techniques used at arriving this result comprise combinatorics, generating functions, and conditional expectations.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

SCHORK, MATTHIAS. „SOME ALGEBRAICAL, COMBINATORIAL AND ANALYTICAL PROPERTIES OF PARAGRASSMANN VARIABLES“. International Journal of Modern Physics A 20, Nr. 20n21 (20.08.2005): 4797–819. http://dx.doi.org/10.1142/s0217751x05025127.

Der volle Inhalt der Quelle

Annotation:

Some algebraical, combinatorial and analytical aspects of paragrassmann variables are discussed. In particular, the similarity of the combinatorics involved with those of generalized exclusion statistics (Gentile's intermediate statistics) is stressed. It is shown that the dimensions of the algebras of generalized grassmann variables are related to generalized Fibonacci numbers. On the analytical side, some of the simplest differential equations are discussed and a suitably generalized Berezin integral as well as an associated delta-function are considered. Some remarks concerning a geometrical interpretation of recent results about fractional superconformal transformations involving generalized grassmann variables are given. Finally, a quantity related to the Witten index is discussed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Crane, Harry. „Combinatorial Lévy processes“. Annals of Applied Probability 28, Nr. 1 (Februar 2018): 285–339. http://dx.doi.org/10.1214/17-aap1306.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

SHEVCHENKO, VLADIMIR. „INFINITE STATISTICS, SYMMETRY BREAKING AND COMBINATORIAL HIERARCHY“. Modern Physics Letters A 24, Nr. 18 (14.06.2009): 1425–35. http://dx.doi.org/10.1142/s0217732309030825.

Der volle Inhalt der Quelle

Annotation:

The physics of symmetry breaking in theories with strongly interacting quanta obeying infinite (quantum Boltzmann) statistics known as quons is discussed. The picture of Bose/Fermi particles as low energy excitations over nontrivial quon condensate is advocated. Using induced gravity arguments, it is demonstrated that the Planck mass in such low energy effective theory can be factorially (in number of degrees of freedom) larger than its true ultraviolet cutoff. Thus, the assumption that statistics of relevant high energy excitations is neither Bose nor Fermi but infinite can remove the hierarchy problem without necessity to introduce any artificially large numbers. Quantum mechanical model illustrating this scenario is presented.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Vellaisamy, Palaniappan, und Aklilu Zeleke. „Exponential order statistics and some combinatorial identities“. Communications in Statistics - Theory and Methods 48, Nr. 20 (29.10.2018): 5099–105. http://dx.doi.org/10.1080/03610926.2018.1508710.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Dean, Angela, und Gregory M. Constantine. „Combinatorial Theory and Statistical Design.“ Journal of the American Statistical Association 84, Nr. 408 (Dezember 1989): 1103. http://dx.doi.org/10.2307/2290108.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Tierney, Luke, R. C. Bose, B. Manvel, Fred S. Roberts und Kenneth P. Bogart. „Introduction to Combinatorial Theory.“ Journal of the American Statistical Association 80, Nr. 389 (März 1985): 246. http://dx.doi.org/10.2307/2288096.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Bombelli, L., A. Corichi und O. Winkler. „Semiclassical quantum gravity: statistics of combinatorial Riemannian geometries“. Annalen der Physik 517, Nr. 8 (12.07.2005): 499–519. http://dx.doi.org/10.1002/andp.20055170803.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Bombelli, L., A. Corichi und O. Winkler. „Semiclassical quantum gravity: statistics of combinatorial Riemannian geometries“. Annalen der Physik 14, Nr. 8 (01.08.2005): 499–519. http://dx.doi.org/10.1002/andp.200410144.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Ibrahim, M., und A. Musa. „A Study of Some New Statistics on the - non-Deranged Permutations“. International Journal of Science for Global Sustainability 9, Nr. 1 (31.03.2023): 6. http://dx.doi.org/10.57233/ijsgs.v9i1.406.

Der volle Inhalt der Quelle

Annotation:

In this study, we looked at some novel statistics on the -non deranged permutation group, a symmetric group subgroup. We analyzed and redefined some of the statistic namely Lmap, Lmal, Rmip, Rmil and Rmal on -non deranged permutations. We found that in all -non deranged permutations, Lmap is equivalent to Lmal. In addition, we observed that Rmal of is empty for any and other combinatorial features.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Avila, Artur, Jeremy Kahn, Mikhail Lyubich und Weixiao Shen. „Combinatorial rigidity for unicritical polynomials“. Annals of Mathematics 170, Nr. 2 (01.09.2009): 783–97. http://dx.doi.org/10.4007/annals.2009.170.783.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Neykov, Matey, Junwei Lu und Han Liu. „Combinatorial inference for graphical models“. Annals of Statistics 47, Nr. 2 (April 2019): 795–827. http://dx.doi.org/10.1214/17-aos1650.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Lykke Jacobsen, Jesper, und Hubert Saleur. „Combinatorial aspects of boundary loop models“. Journal of Statistical Mechanics: Theory and Experiment 2008, Nr. 01 (29.01.2008): P01021. http://dx.doi.org/10.1088/1742-5468/2008/01/p01021.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Marschner, Ian C. „Combinatorial EM algorithms“. Statistics and Computing 24, Nr. 6 (19.07.2013): 921–40. http://dx.doi.org/10.1007/s11222-013-9411-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Volovik, A. V. „A combinatorial method of small sample identification“. Dependability 24, Nr. 2 (21.05.2024): 3–7. http://dx.doi.org/10.21683/1729-2646-2024-24-2-3-7.

Der volle Inhalt der Quelle

Annotation:

Aim. For the purpose of improving the reliability of decisions regarding the uniformity of distributions over samples of limited size, a combinatorial method has been developed for defining a criterion based on simple combinations of sample values. Methods. The paper uses methods of the probability theory, mathematical statistics, and combinatorics. Results. The proposed criterion is highly efficient for distinguishing small samples when testing statistically similar hypotheses, such as the hypothesis of a uniform distribution law and the hypothesis of a beta distribution of the first kind. Conclusions. The approach proposed in the paper enables a sequential analysis procedure (detection of process “imbalance”). This procedure makes it possible to reliably detect the “imbalance” (deviation of the distribution of observations from the uniform law) of a process with a practically sufficient intensity using recurrent relations.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Gnedin, Alexander V. „Regeneration in random combinatorial structures“. Probability Surveys 7 (2010): 105–56. http://dx.doi.org/10.1214/10-ps163.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Albrecher, Hansjörg, Jozef Teugels und Klaus Scheicher. „A combinatorial identity for a problem in asymptotic statistics“. Applicable Analysis and Discrete Mathematics 3, Nr. 1 (2009): 64–68. http://dx.doi.org/10.2298/aadm0901064a.

Der volle Inhalt der Quelle

Annotation:

Let (Xi)i?1 be a sequence of positive independent identically distributed random variables with regularly varying distribution tail of index 0 < ? < 1 and define Tn = X1?+X2?+???+Xn?/(X1+X2+???+ Xn)?.In this note we simplify an expression for lim n?? E(T kn ), which was obtained by Albrecher and Teugels: Asymptotic analysis of a measure of variation. Theory Prob. Math. Stat., 74 (2006), 1-9, in terms of coefficients of a continued fraction expansion. The new formula establishes an unexpected link to an enumeration problem for rooted maps on orientable surfaces that was studied in Arqu?s and B?raud: Rooted maps of orientable surfaces, Riccati's equation and continued fractions. Discrete Mathematics, 215 (2000), 1-12.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Mason, David M., und Tatyana S. Turova. „Motoo's combinatorial central limit theorem for serial rank statistics“. Journal of Statistical Planning and Inference 91, Nr. 2 (Dezember 2000): 427–40. http://dx.doi.org/10.1016/s0378-3758(00)00192-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Eriksson, Kimmo. „Statistical and Combinatorial Aspects of Comparative Genomics*“. Scandinavian Journal of Statistics 31, Nr. 2 (Juni 2004): 203–16. http://dx.doi.org/10.1111/j.1467-9469.2004.02-114.x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Demange, Gabrielle, und Xiaotie Deng. „Universally Balanced Combinatorial Optimization Games“. Games 1, Nr. 3 (13.09.2010): 299–316. http://dx.doi.org/10.3390/g1030299.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Benjamin, Arthur T., Larry Ericksen, Pallavi Jayawant und Mark Shattuck. „Combinatorial trigonometry with Chebyshev polynomials“. Journal of Statistical Planning and Inference 140, Nr. 8 (August 2010): 2157–60. http://dx.doi.org/10.1016/j.jspi.2010.01.011.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

RVL, Charles J. Colbourne und Jeffrey H. Dinitz. „The CRC Handbook of Combinatorial Designs“. Journal of the American Statistical Association 92, Nr. 438 (Juni 1997): 800. http://dx.doi.org/10.2307/2965756.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Indlekofer, Karl-Heinz. „On Labeled and Unlabeled Combinatorial Structures“. Communications in Statistics - Theory and Methods 40, Nr. 19-20 (Oktober 2011): 3641–53. http://dx.doi.org/10.1080/03610926.2011.581184.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Ramamurthy, K. G., Arvind Seth und Mohammad Khanjari Sadegh. „A Combinatorial Approach for Component Importance“. Communications in Statistics - Theory and Methods 32, Nr. 2 (03.01.2003): 497–507. http://dx.doi.org/10.1081/sta-120018197.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Hyde, Trevor. „Polynomial Factorization Statistics and Point Configurations in ℝ3“. International Mathematics Research Notices 2020, Nr. 24 (11.12.2018): 10154–79. http://dx.doi.org/10.1093/imrn/rny271.

Der volle Inhalt der Quelle

Annotation:

Abstract We use combinatorial methods to relate the expected values of polynomial factorization statistics over $\mathbb{F}_q$ to the cohomology of ordered configurations in $\mathbb{R}^3$ as a representation of the symmetric group. Our method gives a new proof of the twisted Grothendieck–Lefschetz formula for squarefree polynomial factorization statistics of Church, Ellenberg, and Farb.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Balasubramanian, Krishnan. „Symmetry, Combinatorics, Artificial Intelligence, Music and Spectroscopy“. Symmetry 13, Nr. 10 (02.10.2021): 1850. http://dx.doi.org/10.3390/sym13101850.

Der volle Inhalt der Quelle

Annotation:

Symmetry forms the foundation of combinatorial theories and algorithms of enumeration such as Möbius inversion, Euler totient functions, and the celebrated Pólya’s theory of enumeration under the symmetric group action. As machine learning and artificial intelligence techniques play increasingly important roles in the machine perception of music to image processing that are central to many disciplines, combinatorics, graph theory, and symmetry act as powerful bridges to the developments of algorithms for such varied applications. In this review, we bring together the confluence of music theory and spectroscopy as two primary disciplines to outline several interconnections of combinatorial and symmetry techniques in the development of algorithms for machine generation of musical patterns of the east and west and a variety of spectroscopic signatures of molecules. Combinatorial techniques in conjunction with group theory can be harnessed to generate the musical scales, intensity patterns in ESR spectra, multiple quantum NMR spectra, nuclear spin statistics of both fermions and bosons, colorings of hyperplanes of hypercubes, enumeration of chiral isomers, and vibrational modes of complex systems including supergiant fullerenes, as exemplified by our work on the golden fullerene C150,000. Combinatorial techniques are shown to yield algorithms for the enumeration and construction of musical chords and scales called ragas in music theory, as we exemplify by the machine construction of ragas and machine perception of musical patterns. We also outline the applications of Hadamard matrices and magic squares in the development of algorithms for the generation of balanced-pitch chords. Machine perception of musical, spectroscopic, and symmetry patterns are considered.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Frolov, Andrei N. „On combinatorial strong law of large numbers and rank statistics“. Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy 65, Nr. 3 (2020): 490–99. http://dx.doi.org/10.21638/spbu01.2020.311.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Frolov, A. N. „On Combinatorial Strong Law of Large Numbers and Rank Statistics“. Vestnik St. Petersburg University, Mathematics 53, Nr. 3 (Juli 2020): 336–43. http://dx.doi.org/10.1134/s1063454120030073.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

KAMEOKA, Koichi, Makoto NAKATANI und Norio INUI. „Phenomena in Probability and Statistics Found in a Combinatorial Weigher“. Transactions of the Society of Instrument and Control Engineers 36, Nr. 5 (2000): 388–94. http://dx.doi.org/10.9746/sicetr1965.36.388.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Rawlings, D. P., und N. Balakrishnan. „Advances in Combinatorial Methods and Applications to Probability and Statistics.“ Biometrics 54, Nr. 4 (Dezember 1998): 1681. http://dx.doi.org/10.2307/2533700.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

MTW und N. Balakrishnan. „Advances in Combinatorial Methods and Applications to Probability and Statistics“. Journal of the American Statistical Association 93, Nr. 443 (September 1998): 1251. http://dx.doi.org/10.2307/2669904.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

LUNDY, M. „Applications of the annealing algorithm to combinatorial problems in statistics“. Biometrika 72, Nr. 1 (1985): 191–98. http://dx.doi.org/10.1093/biomet/72.1.191.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

徐, 晨. „Proofs of Several Combinatorial Identities Based on Probability Statistics Method“. Advances in Applied Mathematics 13, Nr. 01 (2024): 127–32. http://dx.doi.org/10.12677/aam.2024.131015.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Manolescu, Ciprian, Peter Ozsváth und Sucharit Sarkar. „A combinatorial description of knot Floer homology“. Annals of Mathematics 169, Nr. 2 (01.03.2009): 633–60. http://dx.doi.org/10.4007/annals.2009.169.633.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Aardal, K., und C. P. M. Hoesel. „Polyhedral techniques in combinatorial optimization I: Theory“. Statistica Neerlandica 50, Nr. 1 (März 1996): 3–26. http://dx.doi.org/10.1111/j.1467-9574.1996.tb01478.x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Frolov, Andrei N. „On large deviations for combinatorial sums“. Journal of Statistical Planning and Inference 217 (März 2022): 24–32. http://dx.doi.org/10.1016/j.jspi.2021.07.002.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Chatterjee, Sourav, und Soumik Pal. „A Combinatorial Analysis of Interacting Diffusions“. Journal of Theoretical Probability 24, Nr. 4 (31.12.2009): 939–68. http://dx.doi.org/10.1007/s10959-009-0269-8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Coja-Oghlan, Amin, Tobias Kapetanopoulos und Noela Müller. „The replica symmetric phase of random constraint satisfaction problems“. Combinatorics, Probability and Computing 29, Nr. 3 (03.12.2019): 346–422. http://dx.doi.org/10.1017/s0963548319000440.

Der volle Inhalt der Quelle

Annotation:

AbstarctRandom constraint satisfaction problems play an important role in computer science and combinatorics. For example, they provide challenging benchmark examples for algorithms, and they have been harnessed in probabilistic constructions of combinatorial structures with peculiar features. In an important contribution (Krzakala et al. 2007, Proc. Nat. Acad. Sci.), physicists made several predictions on the precise location and nature of phase transitions in random constraint satisfaction problems. Specifically, they predicted that their satisfiability thresholds are quite generally preceded by several other thresholds that have a substantial impact both combinatorially and computationally. These include the condensation phase transition, where long-range correlations between variables emerge, and the reconstruction threshold. In this paper we prove these physics predictions for a broad class of random constraint satisfaction problems. Additionally, we obtain contiguity results that have implications for Bayesian inference tasks, a subject that has received a great deal of interest recently (e.g. Banks et al. 2016, Proc. 29th COLT).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

BRINGMANN, KATHRIN, KARL MAHLBURG und ROBERT C. RHOADES. „Taylor coefficients of mock-Jacobi forms and moments of partition statistics“. Mathematical Proceedings of the Cambridge Philosophical Society 157, Nr. 2 (09.07.2014): 231–51. http://dx.doi.org/10.1017/s0305004114000292.

Der volle Inhalt der Quelle

Annotation:

AbstractWe develop a new technique for deriving asymptotic series expansions for moments of combinatorial generating functions that uses the transformation theory of Jacobi forms and “mock” Jacobi forms, as well as the Hardy-Ramanujan Circle Method. The approach builds on a suggestion of Zagier, who observed that the moments of a combinatorial statistic can be simultaneously encoded as the Taylor coefficients of a function that transforms as a Jacobi form. Our use of Jacobi transformations is a novel development in the subject, as previous results on the asymptotic behavior of the Taylor coefficients of Jacobi forms have involved the study of each such coefficient individually using the theory of quasimodular forms and quasimock modular forms.As an application, we find asymptotic series for the moments of the partition rank and crank statistics. Although the coefficients are exponentially large, the error in the series expansions is polynomial, and have the same order as the coefficients of the residual Eisenstein series that are undetectable by the Circle Method. We also prove asymptotic series expansions for the symmetrized rank and crank moments introduced by Andrews and Garvan, respectively. Equivalently, the former gives asymptotic series for the enumeration of Andrews k-marked Durfee symbols.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Shattuck, Mark. „Generalizations of Bell number formulas of spivey and Mező“. Filomat 30, Nr. 10 (2016): 2683–94. http://dx.doi.org/10.2298/fil1610683s.

Der volle Inhalt der Quelle

Annotation:

We provide q-generalizations of Spivey?s Bell number formula in various settings by considering statistics on different combinatorial structures. This leads to new identities involving q-Stirling numbers of both kinds and q-Lah numbers. As corollaries, we obtain identities for both binomial and q-binomial coefficients. Our results at the same time also generalize recent r-Stirling number formulas of Mez?. Finally, we provide a combinatorial proof and refinement of Xu?s extension of Spivey?s formula to the generalized Stirling numbers of Hsu and Shiue. To do so, we develop a combinatorial interpretation for these numbers in terms of extended Lah distributions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Gamalo, Margaret. „Networked knowledge, combinatorial creativity, and (statistical) innovation“. Journal of Biopharmaceutical Statistics 31, Nr. 2 (04.03.2021): 109–12. http://dx.doi.org/10.1080/10543406.2021.1907889.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Harrison, J. M., J. P. Keating und J. M. Robbins. „Quantum statistics on graphs“. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 467, Nr. 2125 (21.07.2010): 212–33. http://dx.doi.org/10.1098/rspa.2010.0254.

Der volle Inhalt der Quelle

Annotation:

Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph, concentrating on the simplest case of Abelian statistics for two particles. In spite of the fact that graphs are locally one dimensional, anyon statistics emerge in a generalized form. A given graph may support a family of independent anyon phases associated with topologically inequivalent exchange processes. In addition, for sufficiently complex graphs, there appear new discrete-valued phases. Our analysis is simplified by considering combinatorial rather than metric graphs—equivalently, a many-particle tight-binding model. The results demonstrate that graphs provide an arena in which to study new manifestations of quantum statistics. Possible applications include topological quantum computing, topological insulators, the fractional quantum Hall effect, superconductivity and molecular physics.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Williams, Christopher K. I., und Michalis K. Titsias. „Greedy Learning of Multiple Objects in Images Using Robust Statistics and Factorial Learning“. Neural Computation 16, Nr. 5 (01.05.2004): 1039–62. http://dx.doi.org/10.1162/089976604773135096.

Der volle Inhalt der Quelle

Annotation:

We consider data that are images containing views of multiple objects. Our task is to learn about each of the objects present in the images. This task can be approached as a factorial learning problem, where each image must be explained by instantiating a model for each of the objects present with the correct instantiation parameters. A major problem with learning a factorial model is that as the number of objects increases, there is a combinatorial explosion of the number of configurations that need to be considered. We develop a method to extract object models sequentially from the data by making use of a robust statistical method, thus avoiding the combinatorial explosion, and present results showing successful extraction of objects from real images.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!