Algorithms and Models for the Web Graph : 18th International Workshop, WAW 2023, Toronto, on, Canada, May 23-26, 2023, Proceedings / / Megan Dewar [and four others], editors |
Edizione | [First edition.] |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
Descrizione fisica | 1 online resource (203 pages) |
Disciplina | 005.1 |
Collana | Lecture Notes in Computer Science Series |
Soggetto topico |
Computer algorithms
Data mining World Wide Web |
Soggetto non controllato |
Information Theory
Computer Science Computers |
ISBN |
9783031322969
9783031322952 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Correcting for Granularity Bias in Modularity-Based Community Detection Methods -- 1 Introduction -- 2 Hyperspherical Geometry -- 3 The Heuristic -- 4 Derivation of the Heuristic -- 5 Experiments -- 6 Discussion -- References -- The Emergence of a Giant Component in One-Dimensional Inhomogeneous Networks with Long-Range Effects -- 1 Introduction and Statement of Result -- 1.1 The Weight-Dependent Random Connection Model -- 1.2 Main Result -- 1.3 Examples -- 2 Proof of the Main Theorem -- 2.1 Some Construction and Notation -- 2.2 Connecting Far Apart Vertex Sets -- 2.3 Existence of a Giant Component -- 2.4 Absence of an Infinite Component -- References -- Unsupervised Framework for Evaluating Structural Node Embeddings of Graphs -- 1 Introduction -- 2 Framework -- 2.1 Input/Output -- 2.2 Formal Description of the Algorithm -- 2.3 Properties -- 3 Experimentation -- 3.1 Synthetic Graphs Design -- 3.2 Algorithmic Properties of the Framework -- 3.3 Role Classification Case Study -- 4 Conclusion -- References -- Modularity Based Community Detection in Hypergraphs -- 1 Introduction -- 2 Modularity Functions -- 3 Hypergraph Modularity Optimization Algorithm -- 3.1 Louvain Algorithm -- 3.2 Challenges with Adjusting the Algorithm to Hypergraphs -- 3.3 Our Approach to Hypergraph Modularity Optimization: h-Louvain -- 4 Results -- 4.1 Synthetic Hypergraph Model: h-ABCD -- 4.2 Exhaustive Search for the Best Strategy -- 4.3 Comparing Basic Policies for Different Modularity Functions -- 5 Conclusions -- References -- Establishing Herd Immunity is Hard Even in Simple Geometric Networks -- 1 Introduction -- 2 Preliminaries -- 3 Unanimous Thresholds -- 4 Constant Thresholds -- 5 Majority Thresholds -- 6 Conclusions -- References -- Multilayer Hypergraph Clustering Using the Aggregate Similarity Matrix.
1 Introduction -- 2 Related Work -- 3 Algorithm and Main Results -- 4 Numerical Illustrations -- 5 Analysis of the Algorithm -- 5.1 SDP Analysis -- 5.2 Upper Bound on -- 5.3 Lower Bound on Dii -- 5.4 Assortativity -- 5.5 Proof of Theorem 1 -- 6 Conclusions -- References -- The Myth of the Robust-Yet-Fragile Nature of Scale-Free Networks: An Empirical Analysis -- 1 Introduction -- 2 Data -- 2.1 Network Collection -- 2.2 Network Categorization -- 2.3 Handling Weighted Networks -- 2.4 Preprocessing -- 3 Scale-Freeness Analysis -- 3.1 Scale-Freeness Classification Methods -- 3.2 Results -- 4 Robustness Analysis -- 4.1 Network Robustness -- 4.2 Configuration -- 4.3 Results -- 5 Conclusions -- 6 Appendix -- 6.1 Scale-Freeness Classification: Further Analysis -- 6.2 Robustness: Further Analysis -- 6.3 The Curious Case of Collins Yeast Interactome -- References -- A Random Graph Model for Clustering Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Homomorphism Counts in the Chung-Lu Model -- 4 Random Clustering Graph Model -- 5 Homomorphism Counts -- 5.1 Extension Configurations -- 5.2 Expected Homomorphism Counts -- 5.3 Concentration of Subgraph Counts -- References -- Topological Analysis of Temporal Hypergraphs -- 1 Introduction -- 2 Method and Background -- 2.1 Temporal Hypergraphs -- 2.2 Sliding Windows for Hypergraph Snapshots -- 2.3 Associated ASC of a Hypergraph -- 2.4 Simplicial Homology -- 2.5 Zigzag Persistent Homology -- 3 Applications -- 3.1 Social Network Analysis -- 3.2 Cyber Data Analysis -- 4 Conclusion -- References -- PageRank Nibble on the Sparse Directed Stochastic Block Model -- 1 Introduction -- 2 Main Results -- 3 Proofs -- 4 Results from Simulations -- 5 Remarks and Conclusions -- References -- A Simple Model of Influence -- 1 Introduction -- 2 Analysis for Random Graphs G(n,m) -- 3 Proof of Lemma 1. 4 The Effect of Stubborn Vertices -- 5 The Largest Fragment in G(n,m) -- References -- The Iterated Local Transitivity Model for Tournaments -- 1 Introduction -- 2 Small World Property -- 3 Motifs and Universality -- 4 Graph-Theoretic Properties of the Models -- 4.1 Hamiltonicity -- 4.2 Spectral Properties -- 4.3 Domination Numbers -- 5 Conclusion and Further Directions -- References -- Author Index. |
Record Nr. | UNINA-9910725101403321 |
Cham, Switzerland : , : Springer, , [2023] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithms and Models for the Web Graph : 18th International Workshop, WAW 2023, Toronto, on, Canada, May 23-26, 2023, Proceedings / / Megan Dewar [and four others], editors |
Edizione | [First edition.] |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
Descrizione fisica | 1 online resource (203 pages) |
Disciplina | 005.1 |
Collana | Lecture Notes in Computer Science Series |
Soggetto topico |
Computer algorithms
Data mining World Wide Web |
Soggetto non controllato |
Information Theory
Computer Science Computers |
ISBN |
9783031322969
9783031322952 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Correcting for Granularity Bias in Modularity-Based Community Detection Methods -- 1 Introduction -- 2 Hyperspherical Geometry -- 3 The Heuristic -- 4 Derivation of the Heuristic -- 5 Experiments -- 6 Discussion -- References -- The Emergence of a Giant Component in One-Dimensional Inhomogeneous Networks with Long-Range Effects -- 1 Introduction and Statement of Result -- 1.1 The Weight-Dependent Random Connection Model -- 1.2 Main Result -- 1.3 Examples -- 2 Proof of the Main Theorem -- 2.1 Some Construction and Notation -- 2.2 Connecting Far Apart Vertex Sets -- 2.3 Existence of a Giant Component -- 2.4 Absence of an Infinite Component -- References -- Unsupervised Framework for Evaluating Structural Node Embeddings of Graphs -- 1 Introduction -- 2 Framework -- 2.1 Input/Output -- 2.2 Formal Description of the Algorithm -- 2.3 Properties -- 3 Experimentation -- 3.1 Synthetic Graphs Design -- 3.2 Algorithmic Properties of the Framework -- 3.3 Role Classification Case Study -- 4 Conclusion -- References -- Modularity Based Community Detection in Hypergraphs -- 1 Introduction -- 2 Modularity Functions -- 3 Hypergraph Modularity Optimization Algorithm -- 3.1 Louvain Algorithm -- 3.2 Challenges with Adjusting the Algorithm to Hypergraphs -- 3.3 Our Approach to Hypergraph Modularity Optimization: h-Louvain -- 4 Results -- 4.1 Synthetic Hypergraph Model: h-ABCD -- 4.2 Exhaustive Search for the Best Strategy -- 4.3 Comparing Basic Policies for Different Modularity Functions -- 5 Conclusions -- References -- Establishing Herd Immunity is Hard Even in Simple Geometric Networks -- 1 Introduction -- 2 Preliminaries -- 3 Unanimous Thresholds -- 4 Constant Thresholds -- 5 Majority Thresholds -- 6 Conclusions -- References -- Multilayer Hypergraph Clustering Using the Aggregate Similarity Matrix.
1 Introduction -- 2 Related Work -- 3 Algorithm and Main Results -- 4 Numerical Illustrations -- 5 Analysis of the Algorithm -- 5.1 SDP Analysis -- 5.2 Upper Bound on -- 5.3 Lower Bound on Dii -- 5.4 Assortativity -- 5.5 Proof of Theorem 1 -- 6 Conclusions -- References -- The Myth of the Robust-Yet-Fragile Nature of Scale-Free Networks: An Empirical Analysis -- 1 Introduction -- 2 Data -- 2.1 Network Collection -- 2.2 Network Categorization -- 2.3 Handling Weighted Networks -- 2.4 Preprocessing -- 3 Scale-Freeness Analysis -- 3.1 Scale-Freeness Classification Methods -- 3.2 Results -- 4 Robustness Analysis -- 4.1 Network Robustness -- 4.2 Configuration -- 4.3 Results -- 5 Conclusions -- 6 Appendix -- 6.1 Scale-Freeness Classification: Further Analysis -- 6.2 Robustness: Further Analysis -- 6.3 The Curious Case of Collins Yeast Interactome -- References -- A Random Graph Model for Clustering Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Homomorphism Counts in the Chung-Lu Model -- 4 Random Clustering Graph Model -- 5 Homomorphism Counts -- 5.1 Extension Configurations -- 5.2 Expected Homomorphism Counts -- 5.3 Concentration of Subgraph Counts -- References -- Topological Analysis of Temporal Hypergraphs -- 1 Introduction -- 2 Method and Background -- 2.1 Temporal Hypergraphs -- 2.2 Sliding Windows for Hypergraph Snapshots -- 2.3 Associated ASC of a Hypergraph -- 2.4 Simplicial Homology -- 2.5 Zigzag Persistent Homology -- 3 Applications -- 3.1 Social Network Analysis -- 3.2 Cyber Data Analysis -- 4 Conclusion -- References -- PageRank Nibble on the Sparse Directed Stochastic Block Model -- 1 Introduction -- 2 Main Results -- 3 Proofs -- 4 Results from Simulations -- 5 Remarks and Conclusions -- References -- A Simple Model of Influence -- 1 Introduction -- 2 Analysis for Random Graphs G(n,m) -- 3 Proof of Lemma 1. 4 The Effect of Stubborn Vertices -- 5 The Largest Fragment in G(n,m) -- References -- The Iterated Local Transitivity Model for Tournaments -- 1 Introduction -- 2 Small World Property -- 3 Motifs and Universality -- 4 Graph-Theoretic Properties of the Models -- 4.1 Hamiltonicity -- 4.2 Spectral Properties -- 4.3 Domination Numbers -- 5 Conclusion and Further Directions -- References -- Author Index. |
Record Nr. | UNISA-996534466403316 |
Cham, Switzerland : , : Springer, , [2023] | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
An introduction to mathematical cryptography / Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman |
Autore | Hoffstein, Jeffrey |
Edizione | [2. ed] |
Pubbl/distr/stampa | New York, : Springer, 2014 |
Descrizione fisica | XVII, 538 p. : ill. ; 24 cm |
Altri autori (Persone) |
Pipher, Jill
Silverman, Joseph H. |
Soggetto topico |
94A60 - Cryptography [MSC 2020]
94-XX - Information and communication theory, circuits [MSC 2020] 11T71 Algebraic coding theory; cryptography [MSC 2020] 14G50 - Applications to coding theory and cryptography of algebraic geometry [MSC 2020] |
Soggetto non controllato |
Coding theory
Digital signatures Discrete logarithms Elliptic curves Information Theory Information and communication, circuits Lattices and cryptography Probability Theory |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Titolo uniforme | |
Record Nr. | UNICAMPANIA-VAN0103004 |
Hoffstein, Jeffrey
![]() |
||
New York, : Springer, 2014 | ||
![]() | ||
Lo trovi qui: Univ. Vanvitelli | ||
|
An introduction to mathematical cryptography / Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman |
Autore | Hoffstein, Jeffrey |
Edizione | [2. ed] |
Pubbl/distr/stampa | New York, : Springer, 2014 |
Descrizione fisica | XVII, 538 p. : ill. ; 24 cm |
Altri autori (Persone) |
Pipher, Jill
Silverman, Joseph H. |
Soggetto topico |
11T71 Algebraic coding theory; cryptography [MSC 2020]
14G50 - Applications to coding theory and cryptography of algebraic geometry [MSC 2020] 94-XX - Information and communication theory, circuits [MSC 2020] 94A60 - Cryptography [MSC 2020] |
Soggetto non controllato |
Coding theory
Digital signatures Discrete logarithms Elliptic curves Information Theory Information and communication, circuits Lattices and cryptography Probability Theory |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Titolo uniforme | |
Record Nr. | UNICAMPANIA-VAN00103004 |
Hoffstein, Jeffrey
![]() |
||
New York, : Springer, 2014 | ||
![]() | ||
Lo trovi qui: Univ. Vanvitelli | ||
|
Biological information-- new perspectives : proceedings of a symposium held May 31 through June 3, 2011 at Cornell University / / editors, Robert J. Marks II, Baylor University, USA, Michael J. Behe, Lehigh University, USA, William A. Dembski, Discovery Institute, USA, Bruce L. Gordon, Houston Baptist University, USA, John C. Sanford, Cornell University, USA |
Autore | Robert J Marks II |
Pubbl/distr/stampa | World Scientific Publishing Co, 2013 |
Descrizione fisica | 1 online resource (xix, 563 pages) : illustrations (some color) |
Disciplina |
572.8/629
572.8629 |
Collana | Gale eBooks |
Soggetto topico |
Genomics
Molecular genetics Cell interaction Mutation (Biology) Intelligent design (Teleology) |
Soggetto non controllato |
Molecular Biology
Mutation/Selection Paradigm Numerical Simulation Mathematics Biophysics Physics Thermodynamics Information Theory Evolutionary Theory Computer Science Linguistics Genetics Developmental Biology Biological Information Whole Organism Biology |
ISBN | 981-4508-72-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | section 1. Information theory & biology : introductory comments / Robert J. Marks II -- section 2. Biological information and genetic theory : introductory comments / John C. Sanford -- section 3. Theoretical molecular biology : introductory comments / Michael J. Behe -- section 4. Biological information and self-organizational complexity theory : introductory comments / Bruce L. Gordon. |
Record Nr. | UNINA-9910139028903321 |
Robert J Marks II
![]() |
||
World Scientific Publishing Co, 2013 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Coding Theorems of Information Theory / Jacob Wolfowitz |
Autore | Wolfowitz, Jacob |
Edizione | [3. ed] |
Pubbl/distr/stampa | Berlin, : Springer, 1978 |
Descrizione fisica | xii, 176 p. : ill. ; 24 cm |
Soggetto topico |
94-XX - Information and communication theory, circuits [MSC 2020]
94A05 - Communication theory [MSC 2020] 94Bxx - Theory of error-correcting codes and error-detecting codes [MSC 2020] 94A15 - Information theory (general) [MSC 2020] |
Soggetto non controllato |
Communication Theory
Information Theory Proofs |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNICAMPANIA-VAN0260587 |
Wolfowitz, Jacob
![]() |
||
Berlin, : Springer, 1978 | ||
![]() | ||
Lo trovi qui: Univ. Vanvitelli | ||
|
Coding Theorems of Information Theory / Jacob Wolfowitz |
Autore | Wolfowitz, Jacob |
Edizione | [3. ed] |
Pubbl/distr/stampa | Berlin, : Springer, 1978 |
Descrizione fisica | xii, 176 p. : ill. ; 24 cm |
Soggetto topico |
94-XX - Information and communication theory, circuits [MSC 2020]
94A05 - Communication theory [MSC 2020] 94A15 - Information theory (general) [MSC 2020] 94Bxx - Theory of error-correcting codes and error-detecting codes [MSC 2020] |
Soggetto non controllato |
Communication Theory
Information Theory Proofs |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNICAMPANIA-VAN00260587 |
Wolfowitz, Jacob
![]() |
||
Berlin, : Springer, 1978 | ||
![]() | ||
Lo trovi qui: Univ. Vanvitelli | ||
|
Compressed sensing and its applications : Second International MATHEON Conference 2015 / Holger Boche ... [et al.] editors |
Pubbl/distr/stampa | Cham, : Birkhäuser, 2017 |
Descrizione fisica | xix, 388 p. : ill. ; 24 cm |
Soggetto topico |
90C25 - Convex programming [MSC 2020]
68U10 - Computing methodologies for image processing [MSC 2020] 15B52 - Random matrices (algebraic aspects) [MSC 2020] 94A12 - Signal theory (characterization, reconstruction, filtering, etc.) [MSC 2020] 94A20 - Sampling theory in information and communication theory [MSC 2020] |
Soggetto non controllato |
Compressed Sensing
Dimensionality reduction Fourier phase retrieval Hilbert spaces Information Theory Information and communication, circuits Matrix theory Random matrices Sparse approximation Sparse probability measures Sparse recovery Stochastic block model |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Titolo uniforme | |
Record Nr. | UNICAMPANIA-VAN0124337 |
Cham, : Birkhäuser, 2017 | ||
![]() | ||
Lo trovi qui: Univ. Vanvitelli | ||
|
Compressed sensing and its applications : Second International MATHEON Conference 2015 / Holger Boche ... [et al.] editors |
Pubbl/distr/stampa | Cham, : Birkhäuser, 2017 |
Descrizione fisica | xix, 388 p. : ill. ; 24 cm |
Soggetto topico |
15B52 - Random matrices (algebraic aspects) [MSC 2020]
68U10 - Computing methodologies for image processing [MSC 2020] 90C25 - Convex programming [MSC 2020] 94A12 - Signal theory (characterization, reconstruction, filtering, etc.) [MSC 2020] 94A20 - Sampling theory in information and communication theory [MSC 2020] |
Soggetto non controllato |
Compressed Sensing
Dimensionality reduction Fourier phase retrieval Hilbert spaces Information Theory Information and communication, circuits Matrix theory Random matrices Sparse approximation Sparse probability measures Sparse recovery Stochastic block model |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Titolo uniforme | |
Record Nr. | UNICAMPANIA-VAN00124337 |
Cham, : Birkhäuser, 2017 | ||
![]() | ||
Lo trovi qui: Univ. Vanvitelli | ||
|
Discrete Stochastic Processes and Applications / Jean-François Collet |
Autore | Collet, Jean-François |
Pubbl/distr/stampa | Cham, : Springer, 2018 |
Descrizione fisica | xvii, 220 p. ; 24 cm |
Soggetto topico |
60Jxx - Markov processes [MSC 2020]
94A17 - Measures of information, entropy [MSC 2020] |
Soggetto non controllato |
Brownian Motions
Coding theory Entropy Graduate textbook adoption Information Theory Markov Chains Markov Processes Perron-Frobenius Theorem Poisson process Population dynamics Probability applications Probability information theory Search engine design |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Titolo uniforme | |
Record Nr. | UNICAMPANIA-VAN0124637 |
Collet, Jean-François
![]() |
||
Cham, : Springer, 2018 | ||
![]() | ||
Lo trovi qui: Univ. Vanvitelli | ||
|