activity
20062026
most citedSmoothing of transport plans with fixed marginals and rigorous semiclassical limit of the Hohenberg-Kohn functional

52 citations · 173 across the 14 of their papers we have counts for

collaborators
Showing math.PRShow all

10 papers · 1 filter

math.PR2026

Gradient Gibbs measures with non-convex potentials and the universality class of the Gaussian Free Field

Simon Buchholz, Codina Cotar, Florian Schweiger

We study a general class of gradient interface models with Hamiltonian , , assuming essentially that the potential is even, on $[0,\infty…

math.PR2023

Aizenman-Wehr argument for a class of disordered gradient models

Simon Buchholz, Codina Cotar

We consider random gradient fields with disorder where the interaction potential on an edge can be expressed as $e^{-V_e(s)} = \int ρ(\mathrm{d}κ)\, e^{-κξ_e} e^{-\frac{κ…

math.PR2018★ 3 cited

Extremal decomposition for random Gibbs measures: From general metastates to metastates on extremal random Gibbs measures

Codina Cotar, Benedikt Jahnel, Christof Külske

The concept of metastate measures on the states of a random spin system was introduced to be able to treat the large-volume asymptotics for complex quenched random systems, like sp…

math.PR2015

Edge- and vertex-reinforced random walks with super-linear reinforcement on infinite graphs

Codina Cotar, Debleena Thacker

In this paper we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of o…

math.PR2014

Uniqueness of gradient Gibbs measures with disorder

Codina Cotar, Christof Külske

We consider - in uniformly strictly convex potential regime - two versions of random gradient models with disorder. In model (A) the interface feels a bulk term of random fields wh…

math.PR2012★ 37 cited

On a preferential attachment and generalized Pólya's urn model

Andrea Collevecchio, Codina Cotar, Marco LiCalzi

We study a general preferential attachment and Polya's urn model. At each step a new vertex is introduced, which can be connected to at most one existing vertex. If it is disconnec…