English
Related papers

Related papers: A Random Necklace Model

200 papers

We consider the joint density distribution of the elements of certain random matrix models which are example of globally correlated and asymptotically scale-invariant distributions. It is shown that in their cases, the nonadditive entropy…

Statistical Mechanics · Physics 2011-10-14 A. C. Bertuola , M. P. Pato

Chemical hypergraphs and their associated normalized Laplace operators are generalized and studied in the case where each vertex--hyperedge incidence has a real coefficient. We systematically study the effect of symmetries of a hypergraph…

Combinatorics · Mathematics 2021-04-15 Jürgen Jost , Raffaella Mulas

We study the set ${\cal L}(G)$ of lengths of all cycles that appear in a random $d$-regular $G$ on $n$ vertices for a fixed $d\geq 3$, as well as in Erd\H{o}s--R\'enyi random graphs on $n$ vertices with a fixed average degree $c>1$.…

Combinatorics · Mathematics 2020-09-01 Yahav Alon , Michael Krivelevich , Eyal Lubetzky

We study a recent model for edge exchangeable random graphs introduced by Crane and Dempsey; in particular we study asymptotic properties of the random simple graph obtained by merging multiple edges. We study a number of examples, and show…

Probability · Mathematics 2017-08-02 Svante Janson

In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree…

Probability · Mathematics 2007-05-23 Remco van der Hofstad , Gerard Hooghiemstra , Dmitri Znamenski

We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph ensemble with exponentially decaying random disconnection probabilities determined by an i.i.d. field of variables with heavy tails and infinite mean associated to the vertices of…

Probability · Mathematics 2026-04-01 Luca Avena , Diego Garlaschelli , Rajat Subhra Hazra , Margherita Lalli

We consider limit probabilities of first order properties in random graphs with a given degree sequence. Under mild conditions on the degree sequence, we show that the closure set of limit probabilities is a finite union of closed…

Combinatorics · Mathematics 2024-05-24 Alberto Larrauri , Guillem Perarnau

We present an analytical approach for describing spectrally constrained maximum entropy ensembles of finitely connected regular loopy graphs, valid in the regime of weak loop-loop interactions. We derive an expression for the leading two…

Disordered Systems and Neural Networks · Physics 2020-02-19 Fabian Aguirre Lopez , Anthony CC Coolen

Consider the question: what statistical ensemble corresponds to minimal prior knowledge about a quantum system ? For the case where the system is in fact known to be in a pure state there is an obvious answer, corresponding to the unique…

Quantum Physics · Physics 2009-10-31 Michael J. W. Hall

Consider the random graph sampled uniformly from the set of all simple graphs with a given degree sequence. Under mild conditions on the degrees, we establish a Large Deviation Principle (LDP) for these random graphs, viewed as elements of…

Probability · Mathematics 2020-11-25 Souvik Dhara , Subhabrata Sen

I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees…

Disordered Systems and Neural Networks · Physics 2016-05-04 A C C Coolen

We study a process of pattern formation for a generic model of species anchored to the nodes of a network where local reactions take place, and that experience non-reciprocal long-range interactions, encoded by the network directed links.…

Pattern Formation and Solitons · Physics 2025-10-22 Timoteo Carletti , Riccardo Muolo

We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…

Combinatorics · Mathematics 2026-01-23 Ziemowit Kostana , Jarosław Swaczyna , Agnieszka Widz

In this paper we discuss the continuity properties of the integrated density of states for random models based on that of the single site distribution. Our results are valid for models with independent randomness with arbitrary free parts.…

Mathematical Physics · Physics 2007-05-23 M Krishna

The Laplace operator admits infinite self-adjoint extensions when considered on a segment of the real line. They have different domains of essential self-adjointness characterized by a suitable set of boundary conditions on the wave…

High Energy Physics - Lattice · Physics 2015-06-25 G. Bimonte , E . Ercolessi , P. Teotonio-Sobrinho

We study a general transition operator, generated by a random walk on a graph $X$; in particular we give necessary and sufficient condition on the matrix coefficient (1-step transition probablilities) to be a bounded operator from…

Probability · Mathematics 2007-05-23 Fabio Zucca

Weakly chaotic non-linear maps with marginal fixed points have an infinite invariant measure. Time averages of integrable and non-integrable observables remain random even in the long time limit. Temporal averages of integrable observables…

Statistical Mechanics · Physics 2012-03-06 N. Korabel , E. Barkai

We investigate the distribution of the resonances near spectral thresholds of Laplace operators on regular tree graphs with $k$-fold branching, $k \geq 1$, perturbed by nonself-adjoint exponentially decaying potentials. We establish results…

Mathematical Physics · Physics 2017-08-29 Olivier Bourget , Diomba Sambou , Amal Taarabt

We consider Laplacians on periodic equilateral metric graphs. The spectrum of the Laplacian consists of an absolutely continuous part (which is a union of an infinite number of non-degenerated spectral bands) plus an infinite number of flat…

Spectral Theory · Mathematics 2014-01-21 Evgeny Korotyaev , Natalia Saburova

In the on-line nearest-neighbour graph (ONG), each point after the first in a sequence of points in R^d is joined by an edge to its nearest-neighbour amongst those points that precede it in the sequence. We study the large-sample asymptotic…

Probability · Mathematics 2008-05-13 Mathew D. Penrose , Andrew R. Wade