Related papers: The Cavity Approach to Parallel Dynamics of Ising …
We initiate the study of graph algorithms in the streaming setting on massive distributed and parallel systems inspired by practical data processing systems. The objective is to design algorithms that can efficiently process evolving graphs…
We investigate the SIR epidemic on a dynamic inhomogeneous Erd\H{o}s-R\'enyi random graph, in which vertices are of one of $k$ types and in which edges appear and disappear independently of each other. We establish a functional law of large…
This paper deals with the stochastic Ising model with a temperature shrinking to zero as time goes to infinity. A generalization of the Glauber dynamics is considered, on the basis of the existence of simultaneous flips of some spins. Such…
We present a numerical study of the dynamics of the one-dimensional Ising model by applying the large-deviation method to describe ensembles of dynamical trajectories. In this approach trajectories are classified according to a dynamical…
We propose an analytic approach for the steady-state dynamics of Markov processes on locally tree-like graphs. It is based on time-translation invariant probability distributions for edge trajectories, which we encode in terms of infinite…
We investigate the learning performance of the pseudolikelihood maximization method for inverse Ising problems. In the teacher-student scenario under the assumption that the teacher's couplings are sparse and the student does not know the…
We consider a zero-field Ising model defined on a quasiperiodic graph, the so-called Labyrinth tiling. Exact information about the critical behaviour is obtained from duality arguments and the subclass of models which yield commuting…
In dynamic graphs, edges may be added or deleted in each synchronous round. Various connectivity models exist based on constraints on these changes. One well-known model is the $T$-Interval Connectivity model, where the graph remains…
Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many…
Chain Event Graphs are probabilistic graphical models designed especially for the analysis of discrete statistical problems which do not admit a natural product space structure. We show here how they can be used for decision analysis, and…
We focus on evolution equations on co-evolving, infinite, graphs and establish a rigorous link with a class of nonlinear continuity equations, whose vector fields depend on the graphs considered. More precisely, weak solutions of the…
In this paper we study dynamic averaging load balancing on general graphs. We consider infinite time and dynamic processes, where in every step new load items are assigned to randomly chosen nodes. A matching is chosen, and the load is…
The independent cascade model is a widely used framework for simulating the spread of influence in social networks. In this model, activations propagate stochastically through the network, with each edge having a probability of transmitting…
The maximum matching problem on random graphs is studied analytically by the cavity method of statistical physics. When the average vertex degree \mth{c} is larger than \mth{2.7183}, groups of max-matching patterns which differ greatly from…
The antiferromagnetic Ising model samples subsets of vertices of a graph with weight decaying exponentially in the number of edges induced. We study the problem of sampling from this model on the class of bipartite, regular graphs with good…
For a finite random graph, we defined a simple model of statistical mechanics. We obtain an annealed asymptotic result for the random partition function for this model on finite random graphs as n; the size of the graph is very large. To…
Linear accelerators containing the sequence of independently phased cavities with constant geometrical velocity along each structure are widely used in practice. The chain of cavities with identical cell lengths is utilized within a certain…
In public opinion studies, the relationships between opinions on different topics are likely to shift based on the characteristics of the respondents. Thus, understanding the complexities of public opinion requires methods that can account…
Suppose we are given a system of coupled oscillators on an unknown graph along with the trajectory of the system during some period. Can we predict whether the system will eventually synchronize? Even with a known underlying graph…
We study the problem of approximating the partition function of the ferromagnetic Ising model in graphs and hypergraphs. Our first result is a deterministic approximation scheme (an FPTAS) for the partition function in bounded degree graphs…