Yasmin Tousinejad

collaborators

4 papers

math.CO2026

Exponential random graph models with soft clique constraints

Yasmin Tousinejad, Vera Koponen

Let $r \geq 3$ be fixed, and let $G_{n}$ be the set of all simple graphs with vertex set $[n] = {1, \dots, n}$ . We consider an exponential random graph model which gives higher…

math.LO2026

Random coloured digraphs defined by a Markov logic network

Yasmin Tousinejad, Vera Koponen

A Markov Logic Network (MLN) is a probabilistic relational model used in Statistical Relational Artificial Intelligence for defining a probability distribution on the set of possib…

math.PR2026

The stochastic block model has the overlap graph property for modularity

Shankar Bhamidi, David Gamarnik, Remco van der Hofstad +4

The overlap gap property (OGP) is a statement about the geometry of near-optimal solutions. Exhibiting OGP implies failure of a class of local algorithms; and has been observed to…

cs.LO2024

Random expansions of trees with bounded height

Vera Koponen, Yasmin Tousinejad

We consider a sequence $T = (T_{n} : n \in N^{+})$ of trees $T_{n}$ where, for some $Δ \in N^{+}$ every $T_{n}$ has height at most $Δ$ …