23 citations · 75 across the 14 of their papers we have counts for
10 papers · 1 filter
Modelling Complex Networks: Cameo Graphs And Transport Processes
Philippe Blanchard, Dimitry Volchenkov
We discuss a model accounting for the creation and development of transport networks based on the Cameo principle which refers to the idea of distribution of resources, including l…
Scale-free Segregation in Transport Networks
Ph. Blanchard, D. Volchenkov
Every route of a transport network approaching equilibrium can be represented by a vector of Euclidean space which length quantifies its segregation from the rest of the graph. We…
Transport Networks Revisited: Why Dual Graphs?
D. Volchenkov, Ph. Blanchard
Deterministic equilibrium flows in transport networks can be investigated by means of Markov's processes defined on the dual graph representations of the network. Sustained movemen…
Ghetto of Venice: Access to the Target Node and the Random Target Access Time
D. Volchenkov, Ph. Blanchard
Random walks defined on undirected graphs assign the absolute scores to all nodes based on the quality of path they provide for random walkers. In city space syntax, the notion of…
Sestieri of Venice
D. Volchenkov, Ph. Blanchard
We have investigated space syntax of Venice by means of random walks. Random walks being defined on an undirected graph establish the Euclidean space in which distances and angles…
Intelligibility and First Passage Times In Complex Urban Networks
Ph. Blanchard, D. Volchenkov
Topology of urban environments can be represented by means of graphs. We explore the graph representations of several compact urban patterns by random walks. The expected time of r…