Influence Maximization in Ising Models
Fuente:
arXiv
Saved in:
| Main Authors: | Chen, Zongchen, Mossel, Elchanan |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Finding the root in random nearest neighbor trees
by: Brandenberger, Anna, et al.
Published: (2024)
by: Brandenberger, Anna, et al.
Published: (2024)
Errors are Robustly Tamed in Cumulative Knowledge Processes
by: Brandenberger, Anna, et al.
Published: (2023)
by: Brandenberger, Anna, et al.
Published: (2023)
On Algorithmic Robustness of Corrupted Markov Chains
by: Gaitonde, Jason, et al.
Published: (2025)
by: Gaitonde, Jason, et al.
Published: (2025)
Comparison Theorems for the Mixing Times of Systematic and Random Scan Dynamics
by: Gaitonde, Jason, et al.
Published: (2024)
by: Gaitonde, Jason, et al.
Published: (2024)
Reconstructing Riemannian Metrics From Random Geometric Graphs
by: Huang, Han, et al.
Published: (2025)
by: Huang, Han, et al.
Published: (2025)
Improved Mixing of Critical Hardcore Model
by: Chen, Zongchen, et al.
Published: (2025)
by: Chen, Zongchen, et al.
Published: (2025)
Better Models and Algorithms for Learning Ising Models from Dynamics
by: Gaitonde, Jason, et al.
Published: (2025)
by: Gaitonde, Jason, et al.
Published: (2025)
Local Limits of Small World Networks
by: Alimohammadi, Yeganeh, et al.
Published: (2025)
by: Alimohammadi, Yeganeh, et al.
Published: (2025)
The Metric Dimension of Sparse Random Graphs
by: Díaz, Josep, et al.
Published: (2025)
by: Díaz, Josep, et al.
Published: (2025)
Influence Maximization in Hypergraphs by Stratified Sampling for Efficient Generation of Reverse Reachable Sets
by: Zhang, Lingling, et al.
Published: (2024)
by: Zhang, Lingling, et al.
Published: (2024)
Subquadratic Counting via Perfect Marginal Sampling
by: Chen, Xiaoyu, et al.
Published: (2026)
by: Chen, Xiaoyu, et al.
Published: (2026)
Rapid Mixing at the Uniqueness Threshold
by: Chen, Xiaoyu, et al.
Published: (2024)
by: Chen, Xiaoyu, et al.
Published: (2024)
Almost‐Linear Planted Cliques Elude the Metropolis Process
by: Zongchen Chen, et al.
Published: (2025)
by: Zongchen Chen, et al.
Published: (2025)
Rapid Mixing on Random Regular Graphs beyond Uniqueness
by: Chen, Xiaoyu, et al.
Published: (2025)
by: Chen, Xiaoyu, et al.
Published: (2025)
Node Similarities under Random Projections: Limits and Pathological Cases
by: Tadić, Tvrtko, et al.
Published: (2024)
by: Tadić, Tvrtko, et al.
Published: (2024)
Profit Maximization in Closed Social Networks
by: Sharma, Poonam, et al.
Published: (2026)
by: Sharma, Poonam, et al.
Published: (2026)
Opinion Maximization in Social Networks by Modifying Internal Opinions
by: Wang, Gengyu, et al.
Published: (2025)
by: Wang, Gengyu, et al.
Published: (2025)
On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule
by: Chen, Zongchen, et al.
Published: (2024)
by: Chen, Zongchen, et al.
Published: (2024)
An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale
by: Spaeh, Fabian, et al.
Published: (2025)
by: Spaeh, Fabian, et al.
Published: (2025)
Modularity and partially observed graphs
by: McDiarmid, Colin, et al.
Published: (2021)
by: McDiarmid, Colin, et al.
Published: (2021)
Efficient Graph Matching for Correlated Stochastic Block Models
by: Chai, Shuwen, et al.
Published: (2024)
by: Chai, Shuwen, et al.
Published: (2024)
On Sampling from Ising Models with Spectral Constraints
by: Galanis, Andreas, et al.
Published: (2024)
by: Galanis, Andreas, et al.
Published: (2024)
Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs
by: Nakamura, Kengo, et al.
Published: (2026)
by: Nakamura, Kengo, et al.
Published: (2026)
Spectral clustering in the Gaussian mixture block model
by: Li, Shuangping, et al.
Published: (2023)
by: Li, Shuangping, et al.
Published: (2023)
Strong spatial mixing for colorings on trees and its algorithmic applications
by: Chen, Zongchen, et al.
Published: (2023)
by: Chen, Zongchen, et al.
Published: (2023)
Fixed-magnetization Ising on random graphs up to reconstruction
by: Gheissari, Reza, et al.
Published: (2025)
by: Gheissari, Reza, et al.
Published: (2025)
Spectral Independence via Stability and Applications to Holant-Type Problems
by: Chen, Zongchen, et al.
Published: (2021)
by: Chen, Zongchen, et al.
Published: (2021)
Fast Mixing in Sparse Random Ising Models
by: Liu, Kuikui, et al.
Published: (2024)
by: Liu, Kuikui, et al.
Published: (2024)
Sample-Efficient Linear Regression with Self-Selection Bias
by: Gaitonde, Jason, et al.
Published: (2024)
by: Gaitonde, Jason, et al.
Published: (2024)
Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics
by: Gaitonde, Jason, et al.
Published: (2024)
by: Gaitonde, Jason, et al.
Published: (2024)
Towards Tight Bounds for Estimating Degree Distribution in Streaming and Query Models
by: Bishnu, Arijit, et al.
Published: (2025)
by: Bishnu, Arijit, et al.
Published: (2025)
Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation
by: Bläsius, Thomas, et al.
Published: (2024)
by: Bläsius, Thomas, et al.
Published: (2024)
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
by: Chen, Jingbang, et al.
Published: (2024)
by: Chen, Jingbang, et al.
Published: (2024)
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling
by: Blanca, Antonio, et al.
Published: (2022)
by: Blanca, Antonio, et al.
Published: (2022)
Spectral Independence Beyond Total Influence on Trees and Related Graphs
by: Chen, Xiaoyu, et al.
Published: (2024)
by: Chen, Xiaoyu, et al.
Published: (2024)
Entropic independence via sparse localization
by: Jain, Vishesh, et al.
Published: (2026)
by: Jain, Vishesh, et al.
Published: (2026)
Succinct Preferential Attachment Graphs
by: Alaoui, Ziad Ismaili, et al.
Published: (2025)
by: Alaoui, Ziad Ismaili, et al.
Published: (2025)
An Edge-Based Decomposition Framework for Temporal Networks
by: Oettershagen, Lutz, et al.
Published: (2023)
by: Oettershagen, Lutz, et al.
Published: (2023)
Finding coherent node groups in directed graphs
by: Kumpulainen, Iiro, et al.
Published: (2023)
by: Kumpulainen, Iiro, et al.
Published: (2023)
Temporal Betweenness Centrality on Shortest Walks Variants
by: Naima, Mehdi
Published: (2023)
by: Naima, Mehdi
Published: (2023)
Similar Items
-
Finding the root in random nearest neighbor trees
by: Brandenberger, Anna, et al.
Published: (2024) -
Errors are Robustly Tamed in Cumulative Knowledge Processes
by: Brandenberger, Anna, et al.
Published: (2023) -
On Algorithmic Robustness of Corrupted Markov Chains
by: Gaitonde, Jason, et al.
Published: (2025) -
Comparison Theorems for the Mixing Times of Systematic and Random Scan Dynamics
by: Gaitonde, Jason, et al.
Published: (2024) -
Reconstructing Riemannian Metrics From Random Geometric Graphs
by: Huang, Han, et al.
Published: (2025)