Operator Calculus on Graphs: Theory and Applications in Computer Science
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Singapore
World Scientific
2012
|
| Schlagworte: | |
| Online-Zugang: | FAW01 FAW02 Volltext |
| Beschreibung: | 11. Partition-Dependent Stochastic Measures Print version record |
| Beschreibung: | 1 online resource (428 pages) |
| ISBN: | 1280669063 1848168764 1848168772 9781280669064 9781848168763 9781848168770 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043032858 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 151120s2012 |||| o||u| ||||||eng d | ||
| 020 | |a 1280669063 |9 1-280-66906-3 | ||
| 020 | |a 1848168764 |9 1-84816-876-4 | ||
| 020 | |a 1848168772 |c electronic bk. |9 1-84816-877-2 | ||
| 020 | |a 9781280669064 |9 978-1-280-66906-4 | ||
| 020 | |a 9781848168763 |9 978-1-84816-876-3 | ||
| 020 | |a 9781848168770 |c electronic bk. |9 978-1-84816-877-0 | ||
| 035 | |a (OCoLC)794328387 | ||
| 035 | |a (DE-599)BVBBV043032858 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 |a DE-1047 | ||
| 082 | 0 | |a 515 | |
| 082 | 0 | |a 515.72 | |
| 100 | 1 | |a Schott, Rene |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Operator Calculus on Graphs |b Theory and Applications in Computer Science |
| 264 | 1 | |a Singapore |b World Scientific |c 2012 | |
| 300 | |a 1 online resource (428 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a 11. Partition-Dependent Stochastic Measures | ||
| 500 | |a Print version record | ||
| 505 | 8 | |a Preface; Acknowledgments; Contents; Combinatorial Algebras and Their Properties; 1. Introduction; 1.1 Notational Preliminaries; 2. Combinatorial Algebra; 2.1 Six Group and Semigroup Algebras; 2.1.1 The group of blades Bp, q; 2.1.1.1 Involutions; 2.1.1.2 The n-dimensional hypercube Qn; 2.1.2 The abelian blade group Bp, q sym; 2.1.3 The null blade semigroup; 2.1.4 The abelian null blade semigroup sym; 2.1.5 The semigroup of idempotent blades idem; 2.1.6 The path semigroup n; 2.1.7 Summary; 2.1.7.1 Algebras I-IV; 2.1.7.2 Algebra V; 2.1.7.3 Algebra VI; 2.2 Clifford and Grassmann Algebras | |
| 505 | 8 | |a 2.2.1 Grassmann (exterior) algebras2.2.2 Clifford algebras; 2.2.3 Operator calculus on Clifford algebras; 2.3 The Symmetric Clifford Algebra sym; 2.4 The Idempotent-Generated Algebra idem; 2.5 The n-Particle Zeon Algebra nil; 2.6 Generalized Zeon Algebras; 3. Norm Inequalities on Clifford Algebras; 3.1 Norms on C p; q; 3.2 Generating Functions; 3.3 Clifford Matrices and the Clifford-Frobenius Norm; 3.4 Powers of Clifford Matrices; Combinatorics and Graph Theory; 4. Specialized Adjacency Matrices; 4.1 Essential Graph Theory; 4.2 Clifford Adjacency Matrices; 4.3 Nilpotent Adjacency Matrices | |
| 505 | 8 | |a 4.3.1 Euler circuits4.3.2 Conditional branching; 4.3.3 Time-homogeneous random walks on finite graphs; 5. Random Graphs; 5.1 Preliminaries; 5.2 Cycles in Random Graphs; 5.3 Convergence of Moments; 6. Graph Theory and Quantum Probability; 6.1 Concepts; 6.1.1 Operators as random variables; 6.1.2 Operators as adjacency matrices; 6.2 From Graphs to Quantum Random Variables; 6.2.1 Nilpotent adjacency operators in infinite spaces; 6.2.2 Decomposition of nilpotent adjacency operators; 6.3 Connected Components in Graph Processes; 6.3.1 Algebraic preliminaries; 6.3.2 Connected components | |
| 505 | 8 | |a 6.3.2.1 (k, d)-components6.3.3 Second quantization of graph processes; 7. Geometric Graph Processes; 7.1 Preliminaries; 7.2 Dynamic Graph Processes; 7.2.1 Vertex degrees in Gn; 7.2.2 Energy and Laplacian energy of geometric graphs; 7.2.3 Convergence conditions and a limit theorem; 7.3 Time-Homogeneous Walks on Random Geometric Graphs; Probability on Algebraic Structures; 8. Time-Homogeneous Random Walks; 8.1 sym and Random Walks on Hypercubes; 8.2 Multiplicative Walks on C p, q; 8.2.1 Walks on directed hypercubes; 8.2.2 Random walks on directed hypercubes with loops | |
| 505 | 8 | |a 8.2.3 Properties of multiplicative walks8.3 Induced Additive Walks on C p, q; 8.3.1 Variance of N; 8.3.2 Variance of; 8.3.3 Central limit theorems; 9. Dynamic Walks in Clifford Algebras; 9.1 Preliminaries; 9.2 Expectation; 9.3 Limit Theorems; 9.3.1 Conditions for convergence; 9.3.2 Induced additive walks; 9.3.3 Central limit theorem; 10. Iterated Stochastic Integrals; 10.1 Preliminaries; 10.2 Stochastic Integrals in; 10.3 Graph-Theoretic Iterated Stochastic Integrals; 10.3.1 Functions on partitions; 10.3.2 The Clifford evolution matrix; 10.3.3 Orthogonal polynomials | |
| 505 | 8 | |a This pioneering book presents a study of the interrelationships among operator calculus, graph theory, and quantum probability in a unified manner, with significant emphasis on symbolic computations and an eye toward applications in computer science. Presented in this book are new methods, built on the algebraic framework of Clifford algebras, for tackling important real world problems related, but not limited to, wireless communications, neural networks, electrical circuits, transportation, and the world wide web. Examples are put forward in Mathematica throughout the book, together with pack | |
| 650 | 4 | |a Clifford algebras | |
| 650 | 4 | |a Combinatorial analysis | |
| 650 | 4 | |a Operator theory | |
| 650 | 4 | |a Mathematics | |
| 650 | 7 | |a MATHEMATICS / Calculus |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS / Mathematical Analysis |2 bisacsh | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Calculus, Operational | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Quantum statistics | |
| 650 | 4 | |a Computer science | |
| 700 | 1 | |a Staples, G. Stacey |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Schott, Rene |t Operator Calculus on Graphs : Theory and Applications in Computer Science |
| 856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=457191 |x Aggregator |3 Volltext |
| 912 | |a ZDB-4-EBA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028457508 | ||
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=457191 |l FAW01 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=457191 |l FAW02 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804175390475812864 |
|---|---|
| any_adam_object | |
| author | Schott, Rene |
| author_facet | Schott, Rene |
| author_role | aut |
| author_sort | Schott, Rene |
| author_variant | r s rs |
| building | Verbundindex |
| bvnumber | BV043032858 |
| collection | ZDB-4-EBA |
| contents | Preface; Acknowledgments; Contents; Combinatorial Algebras and Their Properties; 1. Introduction; 1.1 Notational Preliminaries; 2. Combinatorial Algebra; 2.1 Six Group and Semigroup Algebras; 2.1.1 The group of blades Bp, q; 2.1.1.1 Involutions; 2.1.1.2 The n-dimensional hypercube Qn; 2.1.2 The abelian blade group Bp, q sym; 2.1.3 The null blade semigroup; 2.1.4 The abelian null blade semigroup sym; 2.1.5 The semigroup of idempotent blades idem; 2.1.6 The path semigroup n; 2.1.7 Summary; 2.1.7.1 Algebras I-IV; 2.1.7.2 Algebra V; 2.1.7.3 Algebra VI; 2.2 Clifford and Grassmann Algebras 2.2.1 Grassmann (exterior) algebras2.2.2 Clifford algebras; 2.2.3 Operator calculus on Clifford algebras; 2.3 The Symmetric Clifford Algebra sym; 2.4 The Idempotent-Generated Algebra idem; 2.5 The n-Particle Zeon Algebra nil; 2.6 Generalized Zeon Algebras; 3. Norm Inequalities on Clifford Algebras; 3.1 Norms on C p; q; 3.2 Generating Functions; 3.3 Clifford Matrices and the Clifford-Frobenius Norm; 3.4 Powers of Clifford Matrices; Combinatorics and Graph Theory; 4. Specialized Adjacency Matrices; 4.1 Essential Graph Theory; 4.2 Clifford Adjacency Matrices; 4.3 Nilpotent Adjacency Matrices 4.3.1 Euler circuits4.3.2 Conditional branching; 4.3.3 Time-homogeneous random walks on finite graphs; 5. Random Graphs; 5.1 Preliminaries; 5.2 Cycles in Random Graphs; 5.3 Convergence of Moments; 6. Graph Theory and Quantum Probability; 6.1 Concepts; 6.1.1 Operators as random variables; 6.1.2 Operators as adjacency matrices; 6.2 From Graphs to Quantum Random Variables; 6.2.1 Nilpotent adjacency operators in infinite spaces; 6.2.2 Decomposition of nilpotent adjacency operators; 6.3 Connected Components in Graph Processes; 6.3.1 Algebraic preliminaries; 6.3.2 Connected components 6.3.2.1 (k, d)-components6.3.3 Second quantization of graph processes; 7. Geometric Graph Processes; 7.1 Preliminaries; 7.2 Dynamic Graph Processes; 7.2.1 Vertex degrees in Gn; 7.2.2 Energy and Laplacian energy of geometric graphs; 7.2.3 Convergence conditions and a limit theorem; 7.3 Time-Homogeneous Walks on Random Geometric Graphs; Probability on Algebraic Structures; 8. Time-Homogeneous Random Walks; 8.1 sym and Random Walks on Hypercubes; 8.2 Multiplicative Walks on C p, q; 8.2.1 Walks on directed hypercubes; 8.2.2 Random walks on directed hypercubes with loops 8.2.3 Properties of multiplicative walks8.3 Induced Additive Walks on C p, q; 8.3.1 Variance of N; 8.3.2 Variance of; 8.3.3 Central limit theorems; 9. Dynamic Walks in Clifford Algebras; 9.1 Preliminaries; 9.2 Expectation; 9.3 Limit Theorems; 9.3.1 Conditions for convergence; 9.3.2 Induced additive walks; 9.3.3 Central limit theorem; 10. Iterated Stochastic Integrals; 10.1 Preliminaries; 10.2 Stochastic Integrals in; 10.3 Graph-Theoretic Iterated Stochastic Integrals; 10.3.1 Functions on partitions; 10.3.2 The Clifford evolution matrix; 10.3.3 Orthogonal polynomials This pioneering book presents a study of the interrelationships among operator calculus, graph theory, and quantum probability in a unified manner, with significant emphasis on symbolic computations and an eye toward applications in computer science. Presented in this book are new methods, built on the algebraic framework of Clifford algebras, for tackling important real world problems related, but not limited to, wireless communications, neural networks, electrical circuits, transportation, and the world wide web. Examples are put forward in Mathematica throughout the book, together with pack |
| ctrlnum | (OCoLC)794328387 (DE-599)BVBBV043032858 |
| dewey-full | 515 515.72 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 515 - Analysis |
| dewey-raw | 515 515.72 |
| dewey-search | 515 515.72 |
| dewey-sort | 3515 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05863nmm a2200649zc 4500</leader><controlfield tag="001">BV043032858</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151120s2012 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1280669063</subfield><subfield code="9">1-280-66906-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1848168764</subfield><subfield code="9">1-84816-876-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1848168772</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-84816-877-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781280669064</subfield><subfield code="9">978-1-280-66906-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848168763</subfield><subfield code="9">978-1-84816-876-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848168770</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-84816-877-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)794328387</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043032858</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">515</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">515.72</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schott, Rene</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Operator Calculus on Graphs</subfield><subfield code="b">Theory and Applications in Computer Science</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Singapore</subfield><subfield code="b">World Scientific</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (428 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">11. Partition-Dependent Stochastic Measures</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Print version record</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Preface; Acknowledgments; Contents; Combinatorial Algebras and Their Properties; 1. Introduction; 1.1 Notational Preliminaries; 2. Combinatorial Algebra; 2.1 Six Group and Semigroup Algebras; 2.1.1 The group of blades Bp, q; 2.1.1.1 Involutions; 2.1.1.2 The n-dimensional hypercube Qn; 2.1.2 The abelian blade group Bp, q sym; 2.1.3 The null blade semigroup; 2.1.4 The abelian null blade semigroup sym; 2.1.5 The semigroup of idempotent blades idem; 2.1.6 The path semigroup n; 2.1.7 Summary; 2.1.7.1 Algebras I-IV; 2.1.7.2 Algebra V; 2.1.7.3 Algebra VI; 2.2 Clifford and Grassmann Algebras</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">2.2.1 Grassmann (exterior) algebras2.2.2 Clifford algebras; 2.2.3 Operator calculus on Clifford algebras; 2.3 The Symmetric Clifford Algebra sym; 2.4 The Idempotent-Generated Algebra idem; 2.5 The n-Particle Zeon Algebra nil; 2.6 Generalized Zeon Algebras; 3. Norm Inequalities on Clifford Algebras; 3.1 Norms on C p; q; 3.2 Generating Functions; 3.3 Clifford Matrices and the Clifford-Frobenius Norm; 3.4 Powers of Clifford Matrices; Combinatorics and Graph Theory; 4. Specialized Adjacency Matrices; 4.1 Essential Graph Theory; 4.2 Clifford Adjacency Matrices; 4.3 Nilpotent Adjacency Matrices</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">4.3.1 Euler circuits4.3.2 Conditional branching; 4.3.3 Time-homogeneous random walks on finite graphs; 5. Random Graphs; 5.1 Preliminaries; 5.2 Cycles in Random Graphs; 5.3 Convergence of Moments; 6. Graph Theory and Quantum Probability; 6.1 Concepts; 6.1.1 Operators as random variables; 6.1.2 Operators as adjacency matrices; 6.2 From Graphs to Quantum Random Variables; 6.2.1 Nilpotent adjacency operators in infinite spaces; 6.2.2 Decomposition of nilpotent adjacency operators; 6.3 Connected Components in Graph Processes; 6.3.1 Algebraic preliminaries; 6.3.2 Connected components</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">6.3.2.1 (k, d)-components6.3.3 Second quantization of graph processes; 7. Geometric Graph Processes; 7.1 Preliminaries; 7.2 Dynamic Graph Processes; 7.2.1 Vertex degrees in Gn; 7.2.2 Energy and Laplacian energy of geometric graphs; 7.2.3 Convergence conditions and a limit theorem; 7.3 Time-Homogeneous Walks on Random Geometric Graphs; Probability on Algebraic Structures; 8. Time-Homogeneous Random Walks; 8.1 sym and Random Walks on Hypercubes; 8.2 Multiplicative Walks on C p, q; 8.2.1 Walks on directed hypercubes; 8.2.2 Random walks on directed hypercubes with loops</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">8.2.3 Properties of multiplicative walks8.3 Induced Additive Walks on C p, q; 8.3.1 Variance of N; 8.3.2 Variance of; 8.3.3 Central limit theorems; 9. Dynamic Walks in Clifford Algebras; 9.1 Preliminaries; 9.2 Expectation; 9.3 Limit Theorems; 9.3.1 Conditions for convergence; 9.3.2 Induced additive walks; 9.3.3 Central limit theorem; 10. Iterated Stochastic Integrals; 10.1 Preliminaries; 10.2 Stochastic Integrals in; 10.3 Graph-Theoretic Iterated Stochastic Integrals; 10.3.1 Functions on partitions; 10.3.2 The Clifford evolution matrix; 10.3.3 Orthogonal polynomials</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">This pioneering book presents a study of the interrelationships among operator calculus, graph theory, and quantum probability in a unified manner, with significant emphasis on symbolic computations and an eye toward applications in computer science. Presented in this book are new methods, built on the algebraic framework of Clifford algebras, for tackling important real world problems related, but not limited to, wireless communications, neural networks, electrical circuits, transportation, and the world wide web. Examples are put forward in Mathematica throughout the book, together with pack</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Clifford algebras</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operator theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Calculus</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Mathematical Analysis</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Calculus, Operational</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Quantum statistics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Staples, G. Stacey</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Schott, Rene</subfield><subfield code="t">Operator Calculus on Graphs : Theory and Applications in Computer Science</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=457191</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028457508</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=457191</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=457191</subfield><subfield code="l">FAW02</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043032858 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:15:32Z |
| institution | BVB |
| isbn | 1280669063 1848168764 1848168772 9781280669064 9781848168763 9781848168770 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028457508 |
| oclc_num | 794328387 |
| open_access_boolean | |
| owner | DE-1046 DE-1047 |
| owner_facet | DE-1046 DE-1047 |
| physical | 1 online resource (428 pages) |
| psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | World Scientific |
| record_format | marc |
| spelling | Schott, Rene Verfasser aut Operator Calculus on Graphs Theory and Applications in Computer Science Singapore World Scientific 2012 1 online resource (428 pages) txt rdacontent c rdamedia cr rdacarrier 11. Partition-Dependent Stochastic Measures Print version record Preface; Acknowledgments; Contents; Combinatorial Algebras and Their Properties; 1. Introduction; 1.1 Notational Preliminaries; 2. Combinatorial Algebra; 2.1 Six Group and Semigroup Algebras; 2.1.1 The group of blades Bp, q; 2.1.1.1 Involutions; 2.1.1.2 The n-dimensional hypercube Qn; 2.1.2 The abelian blade group Bp, q sym; 2.1.3 The null blade semigroup; 2.1.4 The abelian null blade semigroup sym; 2.1.5 The semigroup of idempotent blades idem; 2.1.6 The path semigroup n; 2.1.7 Summary; 2.1.7.1 Algebras I-IV; 2.1.7.2 Algebra V; 2.1.7.3 Algebra VI; 2.2 Clifford and Grassmann Algebras 2.2.1 Grassmann (exterior) algebras2.2.2 Clifford algebras; 2.2.3 Operator calculus on Clifford algebras; 2.3 The Symmetric Clifford Algebra sym; 2.4 The Idempotent-Generated Algebra idem; 2.5 The n-Particle Zeon Algebra nil; 2.6 Generalized Zeon Algebras; 3. Norm Inequalities on Clifford Algebras; 3.1 Norms on C p; q; 3.2 Generating Functions; 3.3 Clifford Matrices and the Clifford-Frobenius Norm; 3.4 Powers of Clifford Matrices; Combinatorics and Graph Theory; 4. Specialized Adjacency Matrices; 4.1 Essential Graph Theory; 4.2 Clifford Adjacency Matrices; 4.3 Nilpotent Adjacency Matrices 4.3.1 Euler circuits4.3.2 Conditional branching; 4.3.3 Time-homogeneous random walks on finite graphs; 5. Random Graphs; 5.1 Preliminaries; 5.2 Cycles in Random Graphs; 5.3 Convergence of Moments; 6. Graph Theory and Quantum Probability; 6.1 Concepts; 6.1.1 Operators as random variables; 6.1.2 Operators as adjacency matrices; 6.2 From Graphs to Quantum Random Variables; 6.2.1 Nilpotent adjacency operators in infinite spaces; 6.2.2 Decomposition of nilpotent adjacency operators; 6.3 Connected Components in Graph Processes; 6.3.1 Algebraic preliminaries; 6.3.2 Connected components 6.3.2.1 (k, d)-components6.3.3 Second quantization of graph processes; 7. Geometric Graph Processes; 7.1 Preliminaries; 7.2 Dynamic Graph Processes; 7.2.1 Vertex degrees in Gn; 7.2.2 Energy and Laplacian energy of geometric graphs; 7.2.3 Convergence conditions and a limit theorem; 7.3 Time-Homogeneous Walks on Random Geometric Graphs; Probability on Algebraic Structures; 8. Time-Homogeneous Random Walks; 8.1 sym and Random Walks on Hypercubes; 8.2 Multiplicative Walks on C p, q; 8.2.1 Walks on directed hypercubes; 8.2.2 Random walks on directed hypercubes with loops 8.2.3 Properties of multiplicative walks8.3 Induced Additive Walks on C p, q; 8.3.1 Variance of N; 8.3.2 Variance of; 8.3.3 Central limit theorems; 9. Dynamic Walks in Clifford Algebras; 9.1 Preliminaries; 9.2 Expectation; 9.3 Limit Theorems; 9.3.1 Conditions for convergence; 9.3.2 Induced additive walks; 9.3.3 Central limit theorem; 10. Iterated Stochastic Integrals; 10.1 Preliminaries; 10.2 Stochastic Integrals in; 10.3 Graph-Theoretic Iterated Stochastic Integrals; 10.3.1 Functions on partitions; 10.3.2 The Clifford evolution matrix; 10.3.3 Orthogonal polynomials This pioneering book presents a study of the interrelationships among operator calculus, graph theory, and quantum probability in a unified manner, with significant emphasis on symbolic computations and an eye toward applications in computer science. Presented in this book are new methods, built on the algebraic framework of Clifford algebras, for tackling important real world problems related, but not limited to, wireless communications, neural networks, electrical circuits, transportation, and the world wide web. Examples are put forward in Mathematica throughout the book, together with pack Clifford algebras Combinatorial analysis Operator theory Mathematics MATHEMATICS / Calculus bisacsh MATHEMATICS / Mathematical Analysis bisacsh Informatik Mathematik Calculus, Operational Graph theory Quantum statistics Computer science Staples, G. Stacey Sonstige oth Erscheint auch als Druck-Ausgabe Schott, Rene Operator Calculus on Graphs : Theory and Applications in Computer Science http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=457191 Aggregator Volltext |
| spellingShingle | Schott, Rene Operator Calculus on Graphs Theory and Applications in Computer Science Preface; Acknowledgments; Contents; Combinatorial Algebras and Their Properties; 1. Introduction; 1.1 Notational Preliminaries; 2. Combinatorial Algebra; 2.1 Six Group and Semigroup Algebras; 2.1.1 The group of blades Bp, q; 2.1.1.1 Involutions; 2.1.1.2 The n-dimensional hypercube Qn; 2.1.2 The abelian blade group Bp, q sym; 2.1.3 The null blade semigroup; 2.1.4 The abelian null blade semigroup sym; 2.1.5 The semigroup of idempotent blades idem; 2.1.6 The path semigroup n; 2.1.7 Summary; 2.1.7.1 Algebras I-IV; 2.1.7.2 Algebra V; 2.1.7.3 Algebra VI; 2.2 Clifford and Grassmann Algebras 2.2.1 Grassmann (exterior) algebras2.2.2 Clifford algebras; 2.2.3 Operator calculus on Clifford algebras; 2.3 The Symmetric Clifford Algebra sym; 2.4 The Idempotent-Generated Algebra idem; 2.5 The n-Particle Zeon Algebra nil; 2.6 Generalized Zeon Algebras; 3. Norm Inequalities on Clifford Algebras; 3.1 Norms on C p; q; 3.2 Generating Functions; 3.3 Clifford Matrices and the Clifford-Frobenius Norm; 3.4 Powers of Clifford Matrices; Combinatorics and Graph Theory; 4. Specialized Adjacency Matrices; 4.1 Essential Graph Theory; 4.2 Clifford Adjacency Matrices; 4.3 Nilpotent Adjacency Matrices 4.3.1 Euler circuits4.3.2 Conditional branching; 4.3.3 Time-homogeneous random walks on finite graphs; 5. Random Graphs; 5.1 Preliminaries; 5.2 Cycles in Random Graphs; 5.3 Convergence of Moments; 6. Graph Theory and Quantum Probability; 6.1 Concepts; 6.1.1 Operators as random variables; 6.1.2 Operators as adjacency matrices; 6.2 From Graphs to Quantum Random Variables; 6.2.1 Nilpotent adjacency operators in infinite spaces; 6.2.2 Decomposition of nilpotent adjacency operators; 6.3 Connected Components in Graph Processes; 6.3.1 Algebraic preliminaries; 6.3.2 Connected components 6.3.2.1 (k, d)-components6.3.3 Second quantization of graph processes; 7. Geometric Graph Processes; 7.1 Preliminaries; 7.2 Dynamic Graph Processes; 7.2.1 Vertex degrees in Gn; 7.2.2 Energy and Laplacian energy of geometric graphs; 7.2.3 Convergence conditions and a limit theorem; 7.3 Time-Homogeneous Walks on Random Geometric Graphs; Probability on Algebraic Structures; 8. Time-Homogeneous Random Walks; 8.1 sym and Random Walks on Hypercubes; 8.2 Multiplicative Walks on C p, q; 8.2.1 Walks on directed hypercubes; 8.2.2 Random walks on directed hypercubes with loops 8.2.3 Properties of multiplicative walks8.3 Induced Additive Walks on C p, q; 8.3.1 Variance of N; 8.3.2 Variance of; 8.3.3 Central limit theorems; 9. Dynamic Walks in Clifford Algebras; 9.1 Preliminaries; 9.2 Expectation; 9.3 Limit Theorems; 9.3.1 Conditions for convergence; 9.3.2 Induced additive walks; 9.3.3 Central limit theorem; 10. Iterated Stochastic Integrals; 10.1 Preliminaries; 10.2 Stochastic Integrals in; 10.3 Graph-Theoretic Iterated Stochastic Integrals; 10.3.1 Functions on partitions; 10.3.2 The Clifford evolution matrix; 10.3.3 Orthogonal polynomials This pioneering book presents a study of the interrelationships among operator calculus, graph theory, and quantum probability in a unified manner, with significant emphasis on symbolic computations and an eye toward applications in computer science. Presented in this book are new methods, built on the algebraic framework of Clifford algebras, for tackling important real world problems related, but not limited to, wireless communications, neural networks, electrical circuits, transportation, and the world wide web. Examples are put forward in Mathematica throughout the book, together with pack Clifford algebras Combinatorial analysis Operator theory Mathematics MATHEMATICS / Calculus bisacsh MATHEMATICS / Mathematical Analysis bisacsh Informatik Mathematik Calculus, Operational Graph theory Quantum statistics Computer science |
| title | Operator Calculus on Graphs Theory and Applications in Computer Science |
| title_auth | Operator Calculus on Graphs Theory and Applications in Computer Science |
| title_exact_search | Operator Calculus on Graphs Theory and Applications in Computer Science |
| title_full | Operator Calculus on Graphs Theory and Applications in Computer Science |
| title_fullStr | Operator Calculus on Graphs Theory and Applications in Computer Science |
| title_full_unstemmed | Operator Calculus on Graphs Theory and Applications in Computer Science |
| title_short | Operator Calculus on Graphs |
| title_sort | operator calculus on graphs theory and applications in computer science |
| title_sub | Theory and Applications in Computer Science |
| topic | Clifford algebras Combinatorial analysis Operator theory Mathematics MATHEMATICS / Calculus bisacsh MATHEMATICS / Mathematical Analysis bisacsh Informatik Mathematik Calculus, Operational Graph theory Quantum statistics Computer science |
| topic_facet | Clifford algebras Combinatorial analysis Operator theory Mathematics MATHEMATICS / Calculus MATHEMATICS / Mathematical Analysis Informatik Mathematik Calculus, Operational Graph theory Quantum statistics Computer science |
| url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=457191 |
| work_keys_str_mv | AT schottrene operatorcalculusongraphstheoryandapplicationsincomputerscience AT staplesgstacey operatorcalculusongraphstheoryandapplicationsincomputerscience |