中文
相关论文

相关论文: The two-star model: exact solution in the sparse r…

200 篇论文

In this paper we extend our previous results on the connectivity functions and pressure of the Random Cluster Model in the highly subcritical phase and in the highly supercritical phase, originally proved only on the cubic lattice $\Z^d$,…

数学物理 · 物理学 2008-02-08 Aldo Procacci , Benedetto Scoppola

The two-dimensional (2D) XY model plays a crucial role in statistical and condensed matter physics. With the introduction of long-range interactions, the system exhibits a richer set of physical phenomena and a crossover between…

统计力学 · 物理学 2025-11-14 Dingyun Yao , Tianning Xiao , Chao Zhang , Youjin Deng , Zhijie Fan

Convolutional network are the de-facto standard for analysing spatio-temporal data such as images, videos, 3D shapes, etc. Whilst some of this data is naturally dense (for instance, photos), many other data sources are inherently sparse.…

神经与进化计算 · 计算机科学 2017-06-06 Benjamin Graham , Laurens van der Maaten

Social networks as a representation of relational data, often possess multiple types of dependency structures at the same time. There could be clustering (beyond homophily) at a macro level as well as transitivity (a friend's friend is more…

统计方法学 · 统计学 2017-04-04 Ming Cao

The Ising model is well-known for illustrating the fundamental characteristics of phase transitions in closed systems. In this article, we propose a generalization of the two-dimensional Ising model to open systems, considering the…

材料科学 · 物理学 2024-11-11 Andriy Gusak , Serhii Abakumov

Emergence of dominating cliques in Erd\"os-R\'enyi random graph model ${\bbbg(n,p)}$ is investigated in this paper. It is shown this phenomenon possesses a phase transition. Namely, we have argued that, given a constant probability $p$, an…

组合数学 · 数学 2008-05-15 Martin Nehez , Daniel Olejar , Michal Demetrian

In a graph, a vertex dominates itself and its neighbors, and a dominating set is a set of vertices that together dominate the entire graph. Given a graph and two dominating sets of equal size $k$, the {\em Dominating Set Reconfiguration…

离散数学 · 计算机科学 2025-07-16 Jona Dirks , Alexandre Vigny

The evoSIR model is a modification of the usual SIR process on a graph $G$ in which $S-I$ connections are broken at rate $\rho$ and the $S$ connects to a randomly chosen vertex. The evoSI model is the same as evoSIR but recovery is…

概率论 · 数学 2023-10-03 Rick Durrett , Dong Yao

We discuss striped phases as a state of matter intermediate between two extreme states: a crystalline state and a segregated state. We argue that this state is very sensitive to weak interactions, compared to those stabilizing a crystalline…

强关联电子 · 物理学 2009-11-13 Volodymyr Derzhko , Janusz Jedrzejewski , Taras Krokhmalskii

We study the survival/extinction phase transition for contact processes with quenched disorder. The disorder is given by a locally finite random graph with vertices indexed by the integers that is assumed to be invariant under index shifts…

概率论 · 数学 2025-08-06 Benedikt Jahnel , Lukas Lüchtrath , Christian Mönch

Inspired by "quantum graphity" models for spacetime, a statistical model of graphs is proposed to explore possible realizations of emergent manifolds. Graphs with given numbers of vertices and edges are considered, governed by a very…

广义相对论与量子宇宙学 · 物理学 2013-04-09 Si Chen , Steven S. Plotkin

Hypergraphs model higher-order interactions, but realistic hypergraph generation remains difficult because incidence, hyperedge-size heterogeneity, and overlap structure are not faithfully captured by pairwise reductions. We propose \HEDGE,…

机器学习 · 统计学 2026-05-07 Christopher Nemeth

We study the complexity of determining the edge connectivity of a simple graph with cut queries. We show that (i) there is a bounded-error randomized algorithm that computes edge connectivity with $O(n)$ cut queries, and (ii) there is a…

数据结构与算法 · 计算机科学 2022-01-19 Simon Apers , Yuval Efron , Paweł Gawrychowski , Troy Lee , Sagnik Mukhopadhyay , Danupon Nanongkai

The problem of detecting edge correlation between two Erd\H{o}s-R\'enyi random graphs on $n$ unlabeled nodes can be formulated as a hypothesis testing problem: under the null hypothesis, the two graphs are sampled independently; under the…

概率论 · 数学 2022-05-31 Jian Ding , Hang Du

We propose two classes of dynamic versions of the classical Erd\H{o}s-R\'enyi graph: one in which the transition rates are governed by an external regime process, and one in which the transition rates are periodically resampled. For both…

概率论 · 数学 2017-03-17 M. Mandjes , N. J. Starreveld , R. Bekker , P. Spreij

Exponential random graph models, or ERGMs, are a flexible and general class of models for modeling dependent data. While the early literature has shown them to be powerful in capturing many network features of interest, recent work…

统计方法学 · 统计学 2022-01-10 Vishesh Karwa , Sonja Petrović , Denis Bajić

A graph is $2$-planar if it has local crossing number two, that is, it can be drawn in the plane such that every edge has at most two crossings. A graph is maximal $2$-planar if no edge can be added such that the resulting graph remains…

组合数学 · 数学 2023-03-16 Michael Hoffmann , Meghana M. Reddy

Phase behaviors of two-dimensional (2D) systems constitute a fundamental topic in condensed matter and statistical physics. Although hard polygons and interactive point-like particles are well studied, the phase behaviors of more realistic…

软凝聚态物质 · 物理学 2024-08-06 Ruijian Zhu , Yanting Wang

Transition points mark qualitative changes in the macroscopic properties of large complex systems. Explosive transitions, exhibiting properties of both continuous and discontinuous phase transitions, have recently been uncovered in network…

物理与社会 · 物理学 2021-06-01 Nora Molkenthin , Malte Schröder , Marc Timme

We study a blind deconvolution problem on graphs, which arises in the context of localizing a few sources that diffuse over networks. While the observations are bilinear functions of the unknown graph filter coefficients and sparse input…

信号处理 · 电气工程与系统科学 2024-09-19 Chang Ye , Gonzalo Mateos