An Urn Model for Social Dynamics on Networks

Fuente: Wiley Open Access

Saved in:

Bibliographic Details
Main Author:	Andrew Melchionna
Format:	Artículo Open Access
Published:	Wiley 2025
Subjects:	Random Structures & Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fast and Slow Mixing of the Kawasaki Dynamics on Bounded‐Degree Graphs
by: Aiya Kuchukova, et al.
Published: (2025)

Models of Random Spanning Trees
by: Eric Babson, et al.
Published: (2026)

Fluctuation Bounds for the Restricted Solid‐On‐Solid Model of Surface Growth
by: Timothy Sudijono
Published: (2025)

Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model
by: Michael Molloy, et al.
Published: (2025)

A Refined Graph Container Lemma and Applications to the Hard‐Core Model on Bipartite Expanders
by: Matthew Jenssen, et al.
Published: (2026)

The Probability That a Random Graph is Even‐Decomposable
by: Oliver Janzer, et al.
Published: (2025)

On the Replica Symmetric Solution in General Diluted Spin Glasses
by: Ratul Biswas, et al.
Published: (2025)

(Random) Trees of Intermediate Volume Growth
by: George Kontogeorgiou, et al.
Published: (2025)

Issue Information
Published: (2025)

Asymptotically Optimal Proper Conflict‐Free Coloring
by: Chun‐Hung Liu, et al.
Published: (2025)

Coloring Graphs With Forbidden Almost Bipartite Subgraphs
by: James Anderson, et al.
Published: (2025)

Fringe Trees for Random Trees With Given Vertex Degrees
by: Gabriel Berzunza Ojeda, et al.
Published: (2025)

Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles
by: Paul Bastide, et al.
Published: (2025)

Issue Information
Published: (2025)

Issue Information
Published: (2025)

Random Algebraic Graphs and Their Convergence to ErdőS–Rényi
by: Kiril Bangachev, et al.
Published: (2025)

On the Edge‐Density of the Brownian Co‐Graphon and Common Ancestors of Pairs in the CRT
by: Guillaume Chapuy
Published: (2025)

Separating Path Systems in Complete Graphs
by: Cristina G. Fernandes, et al.
Published: (2025)

Average‐Case Matrix Discrepancy: Satisfiability Bounds
by: Antoine Maillard
Published: (2025)

Fast Construction on a Restricted Budget
by: Alan Frieze, et al.
Published: (2025)

Scaling Limit of Critical Percolation Clusters on Hyperbolic Random Half‐Planar Triangulations and the Associated Random Walks
by: Eleanor Archer, et al.
Published: (2025)

Almost‐Linear Planted Cliques Elude the Metropolis Process
by: Zongchen Chen, et al.
Published: (2025)

Mixing Cutoff for Simple Random Walks on the Chung–Lu Digraph
by: Alessandra Bianchi, et al.
Published: (2025)

On Rainbow Turán Densities of Trees
by: Seonghyuk Im, et al.
Published: (2025)

Triangle Counting With Local Edge Differential Privacy
by: Talya Eden, et al.
Published: (2025)

Sequentially Constrained Hamilton Cycles in Random Graphs
by: Alan Frieze, et al.
Published: (2025)

Packing Paths in Sparse Random Graphs
by: Vesna Iršič Chenoweth, et al.
Published: (2025)

Reconstructing Random Pictures
by: Bhargav Narayanan, et al.
Published: (2025)

Uniform Temporal Trees
by: Caelan Atamanchuk, et al.
Published: (2025)

Triangle Processes on Graphs With Given Degree Sequence
by: Colin Cooper, et al.
Published: (2025)

Leaf Stripping on Uniform Attachment Trees
by: Louigi Addario‐Berry, et al.
Published: (2025)

Restart Perturbations for Reversible Markov Chains: Trichotomy and Pre‐Cutoff Equivalence
by: Daniel Vial, et al.
Published: (2025)

Expanderizing Higher‐Order Random Walks
by: Vedat Levi Alev, et al.
Published: (2025)

Reconfiguration of Independent Transversals
by: Pjotr Buys, et al.
Published: (2025)

The Moran Process on a Random Graph
by: Alan Frieze, et al.
Published: (2025)

Limits of Chordal Graphs With Bounded Tree‐Width
by: Jordi Castellví, et al.
Published: (2025)

Improved Bounds for the Erdős–Rogers (s,s+2)‐Problem
by: Oliver Janzer, et al.
Published: (2025)

Improving the Convergence of Markov Chains via Permutations and Projections
by: Michael C. H. Choi, et al.
Published: (2025)

Issue Information
Published: (2025)

Issue Information
Published: (2025)