1 code implementation • 16 Feb 2024 • Marios Papachristou, Yuan Yuan
Social networks shape opinions, behaviors, and information dissemination in human societies.
no code implementations • 13 Feb 2024 • Marios Papachristou, M. Amin Rahimian
How can individuals exchange information to learn from each other despite their privacy needs and security concerns?
no code implementations • 3 Nov 2023 • Marios Papachristou, Longqi Yang, Chin-Chia Hsu
In various work contexts, such as meeting scheduling, collaborating, and project planning, collective decision-making is essential but often challenging due to diverse individual preferences, varying work focuses, and power dynamics among members.
1 code implementation • 28 Jun 2023 • Marios Papachristou, M. Amin Rahimian
We show that the noise that minimizes the convergence time to the best estimates is the Laplace noise, with parameters corresponding to each agent's sensitivity to their signal and network characteristics.
no code implementations • 1 Nov 2022 • Marios Papachristou, Rishab Goel, Frank Portman, Matthew Miller, Rong Jin
On the other hand, shallow (or node-level) models using ego features and adjacency embeddings work well in heterophilous graphs.
1 code implementation • 1 Jun 2022 • Marios Papachristou, Jon Kleinberg
Our inference algorithm is capable of learning embeddings that correspond to the reputation (rank) of a node within the hypergraph.
1 code implementation • 4 Mar 2021 • Marios Papachristou
In this paper we devise a generative random network model with core-periphery properties whose core nodes act as sublinear dominators, that is, if the network has $n$ nodes, the core has size $o(n)$ and dominates the entire network.
Social and Information Networks
1 code implementation • 25 Feb 2021 • Apostolos Chalkis, Vissarion Fisikopoulos, Marios Papachristou, Elias Tsigaridas
We introduce Reflective Hamiltonian Monte Carlo (ReHMC), an HMC-based algorithm, to sample from a log-concave distribution restricted to a convex body.