Image de couverture de livre

Spectral Triadic Decompositions of Real-World Networks

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Basu, Sabyasachi, Bera, Suman Kalyan, Seshadhri, C.
Format:	Preprint
Publié:	2022
Sujets:	Social and Information Networks Discrete Mathematics Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
par: Basu, Sabyasachi, et autres
Publié: (2024)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
par: Davot, Tom, et autres
Publié: (2024)

Aggregating maximal cliques in real-world graphs
par: Alon, Noga, et autres
Publié: (2025)

A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2022)

Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
par: Paul-Pena, Daniel, et autres
Publié: (2025)

Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2024)

Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing
par: Chakrabarty, Deeparnab, et autres
Publié: (2024)

Staying Fresh: Efficient Algorithms for Timely Social Information Distribution
par: Li, Songhua, et autres
Publié: (2023)

Computing Approximate Pareto Frontiers for Submodular Utility and Cost Tradeoffs
par: Vombatkere, Karan, et autres
Publié: (2026)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
par: Huang, Yufan, et autres
Publié: (2023)

Hypergraphs as Weighted Directed Self-Looped Graphs: Spectral Properties, Clustering, Cheeger Inequality
par: Li, Zihao, et autres
Publié: (2024)

A note on approximating the average degree of bounded arboricity graphs
par: Eden, Talya, et autres
Publié: (2026)

Triadic First-Order Logic Queries in Temporal Networks
par: Bhalerao, Omkar, et autres
Publié: (2025)

Random Abstract Cell Complexes
par: Hoppe, Josef, et autres
Publié: (2024)

Optimal Padded Decomposition For Bounded Treewidth Graphs
par: Filtser, Arnold, et autres
Publié: (2024)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
par: Bandopadhyay, Susobhan, et autres
Publié: (2023)

Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
par: Marx, Dániel, et autres
Publié: (2026)

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets
par: Basu, Sabyasachi, et autres
Publié: (2024)

Pinwheel Scheduling with Real Periods
par: Fujiwara, Hiroshi, et autres
Publié: (2025)

Double-Ended Palindromic Trees in Linear Time
par: Wang, Qisheng, et autres
Publié: (2022)

Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
par: Dutta, Kunal, et autres
Publié: (2026)

Noisy Nonadaptive Group Testing with Binary Splitting: New Test Design and Improvement on Price-Scarlett-Tan's Scheme
par: Li, Xiaxin, et autres
Publié: (2024)

Deletion-correcting codes for an adversarial nanopore channel
par: Xie, Huiling, et autres
Publié: (2026)

Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time
par: Li, Xiaxin, et autres
Publié: (2025)

Optimal and Efficient Partite Decompositions of Hypergraphs
par: Krapivin, Andrew, et autres
Publié: (2025)

Induced Minors and Coarse Tree Decompositions
par: Chudnovsky, Maria, et autres
Publié: (2026)

Robust Contraction Decomposition for Minor-Free Graphs and its Applications
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)

A Structural Linear-Time Algorithm for Computing the Tutte Decomposition
par: Bourneuf, Romain, et autres
Publié: (2025)

Depth-13 Sorting Networks for 28 Channels
par: Wang, Chengu
Publié: (2025)

Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
par: Manna, Bubai, et autres
Publié: (2024)

Linear-Sized Spectral Sparsifiers and the Kadison-Singer Problem
par: Paschalidis, Phevos, et autres
Publié: (2023)

The Instability of all Backoff Protocols
par: Goldberg, Leslie Ann, et autres
Publié: (2026)

Optimally revealing bits for rejection sampling
par: Langevin, Louis-Roy, et autres
Publié: (2025)

On constrained intersection representations of graphs and digraphs
par: Cicalese, Ferdinando, et autres
Publié: (2025)

Construction of orientable sequences in $O(1)$-amortized time per bit
par: Gabric, Daniel, et autres
Publié: (2024)

Undirected Multicast Network Coding Gaps via Locally Decodable Codes
par: Braverman, Mark, et autres
Publié: (2025)

On Finding All Connected Maximum-Sized Common Subgraphs in Multiple Labeled Graphs
par: Petersen, Johannes B. S., et autres
Publié: (2025)

Spectral Independence via Stability and Applications to Holant-Type Problems
par: Chen, Zongchen, et autres
Publié: (2021)

Parameterized Complexity of Path Set Packing
par: Aravind, N. R., et autres
Publié: (2022)

A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals
par: Aouad, Ali, et autres
Publié: (2022)