Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
167 views

Width of the critical window in a random graph

In an Erdős–Rényi random graph $G(n,p)$, the giant component emerges with thresholding function $p(n) = c/n$, where $c>1$. When $c=1$, and $\lambda \in \mathbb{R}$, we can write or "...
apg's user avatar
  • 640
1 vote
1 answer
313 views

What is the exact definition of a sharp transition?

In "Sharp threshold phenomena in statistical physics", H. Duminil-Copin, Japanese J. of Math. 14, 2019, a sharp transition of a boolean function is defined as follows: A sequence of ...
apg's user avatar
  • 640
1 vote
0 answers
88 views

In percolation on a lattice, how is "infected" status correlated for points in a region around the origin?

Consider independent bond percolation on $\mathbb{Z}^2$, with $p>p_c$ so that the process is supercritical. For any site $x$ let $Y_x$ be the indicator of $x$ belonging to the infinite open cluster....
Ben Golub's user avatar
  • 1,068
2 votes
0 answers
64 views

Transversal deviation in first passage percolation

Take the lattice $\mathbb{L}^{2}=(\mathbb{Z}^{2},\mathbb{E}^{2})$ with i.i.d. $\text{U}[0,1]$ weights on the edges, and the random variable $D$ giving the maximal transversal deviation of the geodesic ...
apg's user avatar
  • 640
3 votes
1 answer
108 views

Expected size of matchings in a cubic graph

Let $G$ be a random cubic graph on $n$ vertices. Let $M$ be the set of (not necessarily maximum) matchings of $G$. What is the expected size (i.e. number of edges) of an element of $M$? In other ...
LeechLattice's user avatar
  • 9,501
5 votes
1 answer
222 views

Switching oriented paths in a graph

Consider an oriented graph (e.g. a finite part of the standard grid with some random orientations). Each minute the following operation takes place: we choose uniformly randomly an ordered pair $(A,B)...
Nikita Kalinin's user avatar
0 votes
0 answers
80 views

Not exactly directed percolation

Is the following problem known/well-studies? I'm looking for references or a name that I can look up. I start with $N$ cell, each one divides into two cells, each one of the new cells either dies ...
stochastic's user avatar
5 votes
0 answers
66 views

Full distribution of FPTs in random walks on graphs

There is a lot of published research on the mean passage passage time (FPT) for random walks on various types of graphs. How about the variance of the FPT and higher momenta? In fact, I would be ...
Sandra Wollish's user avatar
1 vote
0 answers
188 views

Generating Conditional Random Graphs

Let $G(n,p)$ be the usual random graph on $n$ vertices with each edge existing independently with probability $p$ (no self loops , or double edges not are allowed). I would like to simulate the ...
Alex R.'s user avatar
  • 4,952
9 votes
1 answer
1k views

Correlation-Function for Random Graph Ising Model

For non-Ising'ers: Given a graph, we study the probability-distribution on the set of colorings ("Spin-up" and "-down") generated by a given correlation ("force to equality") between adjacient nodes (...
Simon Lentner's user avatar