Structural Analysis of Networks and Databases
Identifieur interne : 000799 ( Istex/Corpus ); précédent : 000798; suivant : 000800Structural Analysis of Networks and Databases
Auteurs : Philippe Blanchard ; Dimitri VolchenkovSource :
- Springer Series in Synergetics [ 0172-7389 ] ; 2011.
Abstract
Abstract: The structural analysis is an important problem motivating many studies of real – world networks. For instance, the efficient partitioning of a transport network is one of the most effective logistics optimization tools and the biggest opportunity to significantly reduce transportation costs. The structural analysis is also of importance when dealing with extremely large graphs, when we need to cluster the vertices into logical components for storage (to improve virtual memory performance) or for drawing purposes (to collapse dense subgraphs into single nodes in order to reduce cluttering). Finally, the structural analysis is important for accessing large databases. In the present chapter, we apply the methods related to random walks for analyzing of urban structures, evolution of languages, and musical compositions.
Url:
DOI: 10.1007/978-3-642-19592-1_8
Links to Exploration step
ISTEX:75724187013DC05ABD114E728EA276B4C268E367Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Structural Analysis of Networks and Databases</title><author><name sortKey="Blanchard, Philippe" sort="Blanchard, Philippe" uniqKey="Blanchard P" first="Philippe" last="Blanchard">Philippe Blanchard</name><affiliation><mods:affiliation>Fakultät für Physik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: blanchard@physik.uni-bielefeld.de</mods:affiliation></affiliation></author><author><name sortKey="Volchenkov, Dimitri" sort="Volchenkov, Dimitri" uniqKey="Volchenkov D" first="Dimitri" last="Volchenkov">Dimitri Volchenkov</name><affiliation><mods:affiliation>Fakultät für Physik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: dima427@yahoo.com</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:75724187013DC05ABD114E728EA276B4C268E367</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-19592-1_8</idno><idno type="url">https://api.istex.fr/document/75724187013DC05ABD114E728EA276B4C268E367/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000799</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000799</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Structural Analysis of Networks and Databases</title><author><name sortKey="Blanchard, Philippe" sort="Blanchard, Philippe" uniqKey="Blanchard P" first="Philippe" last="Blanchard">Philippe Blanchard</name><affiliation><mods:affiliation>Fakultät für Physik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: blanchard@physik.uni-bielefeld.de</mods:affiliation></affiliation></author><author><name sortKey="Volchenkov, Dimitri" sort="Volchenkov, Dimitri" uniqKey="Volchenkov D" first="Dimitri" last="Volchenkov">Dimitri Volchenkov</name><affiliation><mods:affiliation>Fakultät für Physik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: dima427@yahoo.com</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Springer Series in Synergetics</title><imprint><date>2011</date></imprint><idno type="ISSN">0172-7389</idno><idno type="ISSN">0172-7389</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0172-7389</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The structural analysis is an important problem motivating many studies of real – world networks. For instance, the efficient partitioning of a transport network is one of the most effective logistics optimization tools and the biggest opportunity to significantly reduce transportation costs. The structural analysis is also of importance when dealing with extremely large graphs, when we need to cluster the vertices into logical components for storage (to improve virtual memory performance) or for drawing purposes (to collapse dense subgraphs into single nodes in order to reduce cluttering). Finally, the structural analysis is important for accessing large databases. In the present chapter, we apply the methods related to random walks for analyzing of urban structures, evolution of languages, and musical compositions.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Philippe Blanchard</name><affiliations><json:string>Fakultät für Physik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany</json:string><json:string>E-mail: blanchard@physik.uni-bielefeld.de</json:string></affiliations></json:item><json:item><name>Dimitri Volchenkov</name><affiliations><json:string>Fakultät für Physik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany</json:string><json:string>E-mail: dima427@yahoo.com</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-M4LF98QC-9</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: The structural analysis is an important problem motivating many studies of real – world networks. For instance, the efficient partitioning of a transport network is one of the most effective logistics optimization tools and the biggest opportunity to significantly reduce transportation costs. The structural analysis is also of importance when dealing with extremely large graphs, when we need to cluster the vertices into logical components for storage (to improve virtual memory performance) or for drawing purposes (to collapse dense subgraphs into single nodes in order to reduce cluttering). Finally, the structural analysis is important for accessing large databases. In the present chapter, we apply the methods related to random walks for analyzing of urban structures, evolution of languages, and musical compositions.</abstract><qualityIndicators><score>8.464</score><pdfWordCount>22964</pdfWordCount><pdfCharCount>130914</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>64</pdfPageCount><pdfPageSize>439.37 x 666.142 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>122</abstractWordCount><abstractCharCount>838</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Structural Analysis of Networks and Databases</title><chapterId><json:string>8</json:string><json:string>Chap8</json:string></chapterId><genre><json:string>research-article</json:string></genre><serie><title>Springer Series in Synergetics</title><language><json:string>unknown</json:string></language><copyrightDate>2011</copyrightDate><issn><json:string>0172-7389</json:string></issn></serie><host><title>Random Walks and Diffusions on Graphs and Databases</title><language><json:string>unknown</json:string></language><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-19592-1</json:string></doi><issn><json:string>0172-7389</json:string></issn><eisbn><json:string>978-3-642-19592-1</json:string></eisbn><bookId><json:string>978-3-642-19592-1</json:string></bookId><isbn><json:string>978-3-642-19591-4</json:string></isbn><volume>10</volume><pages><first>107</first><last>170</last></pages><genre><json:string>book-series</json:string></genre><author><json:item><name>Philippe Blanchard</name><affiliations><json:string>Fakultät für Physik, Abt. Theoretische Physik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany</json:string><json:string>E-mail: blanchard@physik.uni-bielefeld.de</json:string></affiliations></json:item><json:item><name>Dimitri Volchenkov</name><affiliations><json:string>Fak. Physik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany</json:string><json:string>E-mail: dima427@yahoo.com</json:string></affiliations></json:item></author><subject><json:item><value>Physics and Astronomy</value></json:item><json:item><value>Physics</value></json:item><json:item><value>Complex Networks</value></json:item><json:item><value>Manifolds and Cell Complexes (incl. Diff.Topology)</value></json:item><json:item><value>Data Structures, Cryptology and Information Theory</value></json:item><json:item><value>Complexity</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-M4LF98QC-9</json:string></ark><publicationDate>2011</publicationDate><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-19592-1_8</json:string></doi><id>75724187013DC05ABD114E728EA276B4C268E367</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/75724187013DC05ABD114E728EA276B4C268E367/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/75724187013DC05ABD114E728EA276B4C268E367/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/75724187013DC05ABD114E728EA276B4C268E367/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Structural Analysis of Networks and Databases</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher scheme="https://publisher-list.data.istex.fr">Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><licence><p>Springer-Verlag Berlin Heidelberg, 2011</p></licence><p scheme="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</p></availability><date>2011</date></publicationStmt><notesStmt><note type="research-article" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</note><note type="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Structural Analysis of Networks and Databases</title><author xml:id="author-0000" corresp="yes"><persName><forename type="first">Philippe</forename><surname>Blanchard</surname></persName><email>blanchard@physik.uni-bielefeld.de</email><affiliation>Fakultät für Physik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany</affiliation></author><author xml:id="author-0001"><persName><forename type="first">Dimitri</forename><surname>Volchenkov</surname></persName><email>dima427@yahoo.com</email><affiliation>Fakultät für Physik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany</affiliation></author><idno type="istex">75724187013DC05ABD114E728EA276B4C268E367</idno><idno type="ark">ark:/67375/HCB-M4LF98QC-9</idno><idno type="DOI">10.1007/978-3-642-19592-1_8</idno><idno type="ChapterID">8</idno><idno type="ChapterID">Chap8</idno></analytic><monogr><title level="m">Random Walks and Diffusions on Graphs and Databases</title><title level="m" type="sub">An Introduction</title><idno type="DOI">10.1007/978-3-642-19592-1</idno><idno type="pISBN">978-3-642-19591-4</idno><idno type="eISBN">978-3-642-19592-1</idno><idno type="pISSN">0172-7389</idno><idno type="book-title-id">217406</idno><idno type="book-id">978-3-642-19592-1</idno><idno type="book-chapter-count">10</idno><idno type="book-volume-number">10</idno><idno type="book-sequence-number">110</idno><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2011-04-26"></date><biblScope unit="volume">10</biblScope><biblScope unit="chap">Chapter 8</biblScope><biblScope unit="page" from="107">107</biblScope><biblScope unit="page" to="170">170</biblScope></imprint></monogr><series><title level="s">Springer Series in Synergetics</title><biblScope><date>2011</date></biblScope><idno type="pISSN">0172-7389</idno><idno type="series-id">712</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2011</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: The structural analysis is an important problem motivating many studies of real – world networks. For instance, the efficient partitioning of a transport network is one of the most effective logistics optimization tools and the biggest opportunity to significantly reduce transportation costs. The structural analysis is also of importance when dealing with extremely large graphs, when we need to cluster the vertices into logical components for storage (to improve virtual memory performance) or for drawing purposes (to collapse dense subgraphs into single nodes in order to reduce cluttering). Finally, the structural analysis is important for accessing large databases. In the present chapter, we apply the methods related to random walks for analyzing of urban structures, evolution of languages, and musical compositions.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11651</label><item><term>Physics and Astronomy</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>SCP</label><label>SCP33010</label><label>SCM28027</label><label>SCI15009</label><label>SCT11022</label><item><term>Physics</term></item><item><term>Complex Networks</term></item><item><term>Manifolds and Cell Complexes (incl. Diff.Topology)</term></item><item><term>Data Structures, Cryptology and Information Theory</term></item><item><term>Complexity</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2011-04-26">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-11-28">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/75724187013DC05ABD114E728EA276B4C268E367/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation><PublisherImprintName>Springer</PublisherImprintName></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>712</SeriesID><SeriesPrintISSN>0172-7389</SeriesPrintISSN><SeriesTitle Language="En">Springer Series in Synergetics</SeriesTitle><SeriesAbbreviatedTitle>Springer Ser.Synergetics</SeriesAbbreviatedTitle></SeriesInfo><Book Language="En"><BookInfo BookProductType="Monograph" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ChapterContent" OutputMedium="All" TocLevels="2"><BookID>978-3-642-19592-1</BookID><BookTitle>Random Walks and Diffusions on Graphs and Databases</BookTitle><BookSubTitle>An Introduction</BookSubTitle><BookVolumeNumber>10</BookVolumeNumber><BookSequenceNumber>110</BookSequenceNumber><BookDOI>10.1007/978-3-642-19592-1</BookDOI><BookTitleID>217406</BookTitleID><BookPrintISBN>978-3-642-19591-4</BookPrintISBN><BookElectronicISBN>978-3-642-19592-1</BookElectronicISBN><BookChapterCount>10</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="SCP" Type="Primary">Physics</BookSubject><BookSubject Code="SCP33010" Priority="1" Type="Secondary">Complex Networks</BookSubject><BookSubject Code="SCM28027" Priority="2" Type="Secondary">Manifolds and Cell Complexes (incl. Diff.Topology)</BookSubject><BookSubject Code="SCI15009" Priority="3" Type="Secondary">Data Structures, Cryptology and Information Theory</BookSubject><BookSubject Code="SCT11022" Priority="4" Type="Secondary">Complexity</BookSubject><SubjectCollection Code="SUCO11651">Physics and Astronomy</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>712</SeriesID></BookContext></BookInfo><BookHeader><AuthorGroup><Author AffiliationIDS="AffID1"><AuthorName DisplayOrder="Western"><GivenName>Philippe</GivenName><FamilyName>Blanchard</FamilyName></AuthorName><Contact><Phone>+49 521 106-6205</Phone><Fax>+49 521 106-6455</Fax><Email>blanchard@physik.uni-bielefeld.de</Email></Contact></Author><Author AffiliationIDS="AffID2"><AuthorName DisplayOrder="Western"><GivenName>Dimitri</GivenName><FamilyName>Volchenkov</FamilyName></AuthorName><Contact><Phone>0521106-6195</Phone><Fax>0521446-94211</Fax><Email>dima427@yahoo.com</Email></Contact></Author><Affiliation ID="AffID1"><OrgDivision>Fakultät für Physik, Abt. Theoretische Physik</OrgDivision><OrgName>Universität Bielefeld</OrgName><OrgAddress><Street>Universitätsstr. 25</Street><City>Bielefeld</City><Postcode>33615</Postcode><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="AffID2"><OrgDivision>Fak. Physik</OrgDivision><OrgName>Universität Bielefeld</OrgName><OrgAddress><Street>Universitätsstr. 25</Street><City>Bielefeld</City><Postcode>33615</Postcode><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup></BookHeader><Chapter ID="Chap8" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingDepth="2" NumberingStyle="ChapterContent" OutputMedium="All" TocLevels="0"><ChapterID>8</ChapterID><ChapterNumber>Chapter 8</ChapterNumber><ChapterDOI>10.1007/978-3-642-19592-1_8</ChapterDOI><ChapterSequenceNumber>8</ChapterSequenceNumber><ChapterTitle Language="En">Structural Analysis of Networks and Databases</ChapterTitle><ChapterFirstPage>107</ChapterFirstPage><ChapterLastPage>170</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>2011</Year><Month>3</Month><Day>3</Day></RegistrationDate><OnlineDate><Year>2011</Year><Month>4</Month><Day>26</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>712</SeriesID><BookID>978-3-642-19592-1</BookID><BookTitle>Random Walks and Diffusions on Graphs and Databases</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1" CorrespondingAffiliationID="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Philippe</GivenName><FamilyName>Blanchard</FamilyName></AuthorName><Contact><Email>blanchard@physik.uni-bielefeld.de</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Dimitri</GivenName><FamilyName>Volchenkov</FamilyName></AuthorName><Contact><Email>dima427@yahoo.com</Email></Contact></Author><Affiliation ID="Aff1"><OrgDivision>Fakultät für Physik</OrgDivision><OrgName>Universität Bielefeld</OrgName><OrgAddress><Street>Universitätsstr. 25</Street><Postcode>33615</Postcode><City>Bielefeld</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En" OutputMedium="Online"><Heading>Abstract</Heading><Para>The structural analysis is an important problem motivating many studies of real – world networks. For instance, the efficient partitioning of a transport network is one of the most effective logistics optimization tools and the biggest opportunity to significantly reduce transportation costs. The structural analysis is also of importance when dealing with extremely large graphs, when we need to cluster the vertices into logical components for storage (to improve virtual memory performance) or for drawing purposes (to collapse dense subgraphs into single nodes in order to reduce cluttering). Finally, the structural analysis is important for accessing large databases. In the present chapter, we apply the methods related to random walks for analyzing of urban structures, evolution of languages, and musical compositions.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Structural Analysis of Networks and Databases</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Structural Analysis of Networks and Databases</title></titleInfo><name type="personal" displayLabel="corresp"><namePart type="given">Philippe</namePart><namePart type="family">Blanchard</namePart><affiliation>Fakultät für Physik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany</affiliation><affiliation>E-mail: blanchard@physik.uni-bielefeld.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Dimitri</namePart><namePart type="family">Volchenkov</namePart><affiliation>Fakultät für Physik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany</affiliation><affiliation>E-mail: dima427@yahoo.com</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="research-article" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2011-04-26</dateIssued><copyrightDate encoding="w3cdtf">2011</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: The structural analysis is an important problem motivating many studies of real – world networks. For instance, the efficient partitioning of a transport network is one of the most effective logistics optimization tools and the biggest opportunity to significantly reduce transportation costs. The structural analysis is also of importance when dealing with extremely large graphs, when we need to cluster the vertices into logical components for storage (to improve virtual memory performance) or for drawing purposes (to collapse dense subgraphs into single nodes in order to reduce cluttering). Finally, the structural analysis is important for accessing large databases. In the present chapter, we apply the methods related to random walks for analyzing of urban structures, evolution of languages, and musical compositions.</abstract><relatedItem type="host"><titleInfo><title>Random Walks and Diffusions on Graphs and Databases</title><subTitle>An Introduction</subTitle></titleInfo><name type="personal"><namePart type="given">Philippe</namePart><namePart type="family">Blanchard</namePart><affiliation>Fakultät für Physik, Abt. Theoretische Physik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany</affiliation><affiliation>E-mail: blanchard@physik.uni-bielefeld.de</affiliation></name><name type="personal"><namePart type="given">Dimitri</namePart><namePart type="family">Volchenkov</namePart><affiliation>Fak. Physik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany</affiliation><affiliation>E-mail: dima427@yahoo.com</affiliation></name><genre type="book-series" displayLabel="Monograph" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11651">Physics and Astronomy</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="SCP">Physics</topic><topic authority="SpringerSubjectCodes" authorityURI="SCP33010">Complex Networks</topic><topic authority="SpringerSubjectCodes" authorityURI="SCM28027">Manifolds and Cell Complexes (incl. Diff.Topology)</topic><topic authority="SpringerSubjectCodes" authorityURI="SCI15009">Data Structures, Cryptology and Information Theory</topic><topic authority="SpringerSubjectCodes" authorityURI="SCT11022">Complexity</topic></subject><identifier type="DOI">10.1007/978-3-642-19592-1</identifier><identifier type="ISBN">978-3-642-19591-4</identifier><identifier type="eISBN">978-3-642-19592-1</identifier><identifier type="ISSN">0172-7389</identifier><identifier type="BookTitleID">217406</identifier><identifier type="BookID">978-3-642-19592-1</identifier><identifier type="BookChapterCount">10</identifier><identifier type="BookVolumeNumber">10</identifier><identifier type="BookSequenceNumber">110</identifier><part><date>2011</date><detail type="volume"><number>10</number><caption>vol.</caption></detail><detail type="chapter"><number>Chapter 8</number></detail><extent unit="pages"><start>107</start><end>170</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Springer Series in Synergetics</title></titleInfo><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0172-7389</identifier><identifier type="SeriesID">712</identifier><part><detail type="chapter"><number>Chapter 8</number></detail></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><identifier type="istex">75724187013DC05ABD114E728EA276B4C268E367</identifier><identifier type="ark">ark:/67375/HCB-M4LF98QC-9</identifier><identifier type="DOI">10.1007/978-3-642-19592-1_8</identifier><identifier type="ChapterID">8</identifier><identifier type="ChapterID">Chap8</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2011</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2011</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/document/75724187013DC05ABD114E728EA276B4C268E367/metadata/json</uri></json:item></metadata><annexes><json:item><extension>xml</extension><original>true</original><mimetype>application/xml</mimetype><uri>https://api.istex.fr/document/75724187013DC05ABD114E728EA276B4C268E367/annexes/xml</uri></json:item></annexes></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/XenakisV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000799 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000799 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= XenakisV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:75724187013DC05ABD114E728EA276B4C268E367
|texte= Structural Analysis of Networks and Databases
}}
| This area was generated with Dilib version V0.6.33. |  |